cantor_uncountability
Provedprovedset-theory
Cantor's theorem: The power set of any set is strictly larger. Specifically, ℕ is countable but its power set is not. Proved by Cantor (1891).
Preamble
import Mathlib
Formal statement
import Mathlib
theorem cantor_uncountability :
¬ ∃ f : ℕ → Set ℕ, Function.Surjective f := by
sorrySource