Well-ordering theorem

Every set can be given a well-order.
Well-ordering theorem

Well-ordering theorem: For every XX, there exists a X×X\le\,\subseteq X\times X such that (X,)(X,\le) is a .

Over ZF, the well-ordering theorem is equivalent to the and to .