To prove that the set of all ordinal numbers does not exist, first prove that any set of ordinal numbers is well ordered. Suppose that a set A of ordinal numbers exists which is not well ordered. Then at least one subset B exists that does not have a least element. This set must contain a strictly decreasing sequence of ordinal numbers
![]()
This sequence is a subset of the set
and this set is not well ordered because it contains a strictly decreasing infinite sequence. This is a contradiction so
is well ordered.
Now suppose that a set
of all ordinal numbers exists. By the argument above this set is well ordered. Let
be the ordinal number of
with the ordering
on![]()
must be an element of
We then have
![]()
This is a contradiction so there is no set of all ordinal numbers.