The Teichmüller–Tukey lemma
ProvedFamousTheorems.teichmuller_tukey_lemmaThe Teichmüller–Tukey lemma. Let be a family of subsets of a set of finite character: a set belongs to if and only if every finite subset of it does. Then every member is contained in a maximal member of (with respect to inclusion).
This is one of the classical equivalents of the axiom of choice, alongside Zorn's lemma and the well-ordering theorem. It is often the most convenient form in algebra and logic, for example to extend a linearly independent set to a basis or a consistent set of sentences to a maximal consistent one.
Formalization note. Mathlib's Order.IsOfFiniteCharacter.exists_maximal. Order.IsOfFiniteCharacter F is the finite-character condition, and Maximal (fun y => y ∈ F) m says that and no member of strictly contains .
import Mathlib
namespace FamousTheorems
theorem teichmuller_tukey_lemma {α : Type*} {F : Set (Set α)} (hF : Order.IsOfFiniteCharacter F) {x : Set α} (hx : x ∈ F) :
∃ m : Set α, x ⊆ m ∧ Maximal (fun y => y ∈ F) m := by sorry
end FamousTheorems