Theorem: Every permutation in $S_n$ is a product of transpositions.

Proof: If I number cups from 1 to $n$ and set them down in a row on the table in a mixed-up order, even a child could put the cups back into their natural order by exchanging cups two at a time using the left hand and right hand. QED

I learned this example from Ryan Kinser.