Set theory - Chapter 6: The Axiom of Regularity
6.1
- ≤ , . So
- ≥ For all , . Hence i.e .
6.2
By induction on , we show that is finite (using 3.1 (iii)). Hence
. (Note that we can apply Lemma 5.8, since only the first term is equal
to zero). Moreover, since . Finally .
Now we shall show by induction on
that . We see below that it is true for
. If it is the case for an ordinal
, then . Finally, consider a limit ordinal
such that the property holds below it. Then
. But Beth is a normal function, so
and .
6.3
For all we have so .
Suppose is inaccessible. Then by induction on
, we have . For , it is true because is uncountable. If the property holds for an
then it also holds for since is strong limit. The regularity of
allows to prove the property at limit step. Finally we have :
6.4
Let be two sets of rank less than
. Then by 6.1, . . But we've just seen that the rank
and is . So . If then , so and . If then there is such that . So , . So . If then for all , , , . Hence . Finally . . For , and so . Finally, .
6.5
We can write , and where are relations of equivalence on
and and the ideal . Hence we have :
- .
- .
- .
6.6
Let be a class and the class of sets that are hereditarily in the class
.
- ⇒ Let .
- If , then because is transitive. Finally,
⇐
- xxx