We give a short proof of the theorem that, assuming the axiom of choice, every set can be well-ordered. The proof makes direct use of neither induction nor ordinals.

Let S be any given set and its power-set. Let be a choice function, i.e. we denote Ζ — {γΖ} by Ζ'.