THEOREM OF THE DAY: The Well-ordering Theorem

Theorem

Any set X can be well-ordered: an order relation ‘less than’ can be defined on X such that every non-empty subset of X contains a least element of X.

Click on the image.

Ernst Zermelo proved his theorem in 1904 using the Axiom of Choice: for any collection of nonempty sets there is a way of choosing a representative from each.