Well-Ordering theorem
Revision as of 11:39, 2 June 2019 by Mrmxs (talk | contribs) (Created page with "The '''Well-Ordering theorem''' is an axiom for Set theory. It states that every set can be well-ordered. A well-ordered set is a totally ordered set <math>(S,\pre...")
The Well-Ordering theorem is an axiom for Set theory. It states that every set can be well-ordered. A well-ordered set is a totally ordered set 
for which each set 
has a minimum element.
The Well-Ordering theorem is equivalent to the Axiom of choice and Zorn's Lemma.
