well-ordering principle implies axiom of choice
Theorem.
The well-ordering principle implies the axiom of choice![]()
.
Proof.
Let be a collection![]()
of nonempty sets. Then is a set. By the well-ordering principle, is well-ordered under some relation
![]()
. Since each is a nonempty subset of , each has a least member with respect to the relation .
Define by . Then is a choice function. Hence, the axiom of choice holds. ∎
| Title | well-ordering principle implies axiom of choice |
|---|---|
| Canonical name | WellorderingPrincipleImpliesAxiomOfChoice |
| Date of creation | 2013-03-22 16:07:46 |
| Last modified on | 2013-03-22 16:07:46 |
| Owner | Wkbj79 (1863) |
| Last modified by | Wkbj79 (1863) |
| Numerical id | 7 |
| Author | Wkbj79 (1863) |
| Entry type | Theorem |
| Classification | msc 03E25 |
| Related topic | AxiomOfChoice |
| Related topic | ZermelosWellOrderingTheorem |