⚛️Igor Kan
Search
Search
Dark mode
Light mode
Reader mode
Explorer
Home
❯
Digital Garden (proof of concept)
❯
Well Ordering Theorem
Well-Ordering Theorem
Every set can be well-ordered.
Equivalent to
axiom of choice
.
∀
A
∃
R
⊆
A
×
A
a well-ordering on
A
Graph View