Because False Implies Anything

Theorem: There is a finite number of prime numbers

Proof: assume there is a finite number of primes, p₁, p₂, p₃, …, p_n, with p_n being the largest. Consider (p₁ x p₂ x p₃ x … x p_n) + 1, this number has no prime divisors and is greater than p_n, making it the exception that proves the rule. QED.