 Ordinal numbers are defined as equivalence classes of well-orderings under similarity. There is a natural order on ordinal numbers, and in NFU as in the usual set theory it turns out to be a well-ordering—and, as in naive set theory, a set! Since the natural order on the ordinal numbers is a set, it has an order type \(\Omega\) which is itself one of the ordinal numbers. Now in the usual set theory we prove that the order type of the restriction of the natural order on the ordinals to the ordinals less than \(\alpha\) is the ordinal \(\alpha\) itself; however, this is an ill-typed statement in TST, where, assuming a type level ordered pair, the second occurrence of \(\alpha\) is two types higher than the first (it would be four types higher if the Kuratowski ordered pair were used). Since the ordinals are isomorphism types of relations, we can define the operation \(T\) on them as above.