Use transfinite induction. The assertion is immediate at stage zero, and at a limit stage it follows by taking the increasing union of the earlier stages.
Assume . Any ordinal is a subset of , since members of the definable power set are such subsets. Every element of is an ordinal, so
which implies . This gives the upper bound on the ordinals appearing at the successor stage.
For the reverse inclusion, the smaller ordinals are already in and hence in . The remaining ordinal itself is the definable subset . The fact used here is absoluteness of ordinalhood between a transitive set and the universe: ordinalhood has a bounded definition, and bounded formulas are absolute for transitive sets. Thus the formula asserting that a member is an ordinal, interpreted over , defines exactly . Therefore .
This proves
In particular each ordinal is a member of , so .

Articles by others on the same topic (0)

There are currently no matching articles.