Theorem: All natural numbers are boring. Proof (by contradiction): Assume the set of non-boring natural numbers is nonempty, so it must have a smallest element

Theorem: All natural numbers are boring. Proof (by contradiction): Assume the set of non-boring natural numbers is nonempty, so it must have a smallest element. Call it x. So what? yawn QED