A set is transitive if every element of an element of is itself in , equivalently each element of is a subset of . Proceed by transfinite induction. The empty set is transitive. If is transitive and , then gives , and transitivity of gives . Thus , proving the successor stage transitive. A union of transitive sets is transitive: if , choose with and infer . This proves the limit step and hence every is transitive.
For , transitivity of gives . Therefore , provingTogether with the union definition at limits, transfinite induction now gives whenever . No rank theorem is needed for this monotonicity argument.
Induct on . For every , the induction hypothesis says , and monotonicity gives . Thus every element of the ordinal lies in , so . Taking its power set givesFor the inclusion is vacuous and supplies the base case. This argument uses ordinal membership as strict order and the previously proved hierarchy monotonicity.
Articles by others on the same topic
There are currently no matching articles.