Acknowledging the Futility of Proving 2

A Proof by Induction

Let P(n) be the statement that this proof is pointless.

Base case: P(1) is trivially true, because even the most ardent enthusiast of pointless endeavors cannot deny the futility of proving something so obvious.

Inductive step: assume P(n) is true for some n, and show that P(n+1) must also be true.

By the power vested in us by the infinite, P(n+1) is, in fact, not true.

Conclusion:

We have shown that P(2) is, in fact, just as futile as P(1).

Try to prove it for n=3. We dare you.

Or, if you're feeling particularly masochistic, try to prove it for n=-1.