Rare card
Well-ordering theorem
- Value
- 50 W
- Attack
- 245
- Defence
- 196
- Players
- 0
In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering.
Get Well-ordering theorem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack