 One can show using the Replacement Axiom that every well-ordered set W has a unique decoration d.   An ordinal number (or ordinal)  is a set of the form d(w), for some well-ordered set  (W,&lt; ) and some w ∈ W. 