The well-ordering theorem (Zermelo)
ProvedFamousTheorems.well_ordering_theoremThe well-ordering theorem (Zermelo). Every set admits a well-ordering: a linear order in which every nonempty subset has a least element.
Zermelo proved it in 1904 from the axiom of choice, and over ZF it is equivalent to choice and to Zorn's lemma. It allows transfinite induction and recursion on arbitrary sets, and underpins the theory of cardinal numbers (every set is equinumerous with an ordinal).
Formalization note. Mathlib's exists_wellFoundedLT. The order is a LinearOrder on the type whose strict order < is well-founded (WellFoundedLT).
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem well_ordering_theorem (α : Type*) : ∃ (_ : LinearOrder α), WellFoundedLT α := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `exists_wellFoundedLT`. Proof here reduces to that Mathlib result.