The well-ordering theorem states that every set can be well-ordered, meaning there exists a binary relation on the set such that every non-empty subset has a least element. This theorem is equivalent to the Axiom of Choice and is fundamental in the study of order types and ordinal numbers.