We prove simultaneously that each is a transitive set and that . The key observation is that if is transitive and , then andThis is an internal definition with parameter , so . Hence . Every is a subset of ; if , then . Thus the definable power set is transitive too.
Start with the empty set. At successor stages the observation proves transitivity and inclusion. At a limit stage the union of the earlier transitive sets is transitive, and the same observation then proves its inclusion in its own definable power set. This completes the transfinite induction and gives
The argument in part (a) established for every ordinal . A transfinite induction on now proves that every earlier level is contained in . If , use the inductive inclusions into followed by . At a limit stage, every earlier level is one of the sets in the defining union. Equality of indices is trivial. ThusThe constructible hierarchy is a nondecreasing family of sets.
Induct on using the transitivity and inclusion already established. The zero stage is immediate. Suppose . Being an ordinal is expressible by a bounded formula in set theory, for example transitivity, transitivity of all members, and membership comparability. It is therefore absolute for the transitive set . The subset of its elements that are ordinals is internally definable, soBy inclusion, all smaller ordinals are present as well. Conversely, if an ordinal belongs to , then , since every member of a definable power set is a subset of the preceding domain. All members of are ordinals, so and . Hence the ordinal part of the successor level is exactly .
Articles by others on the same topic
There are currently no matching articles.