Choose a name for and a condition forcing that it is a function . The ordinals belong to , by forcing preserves ordinals. For each , choose in a maximal forcing antichain in the cone above , every member deciding as an ordinal below . Conditions deciding an ordinal-valued name are dense, by the forcing theorem.
Let be the set of values decided by members of . The chain condition gives , and Choice and Replacement in assemble all these sets into a function with domain . Since , genericity ensures that meets each deciding forcing antichain above ; equivalently enlarge it to a global maximal forcing antichain by conditions incompatible with . Its chosen value is the actual . ThereforeThis is the possible-values lemma for chain-condition forcing. All size bounds in its construction are internal to the ground model.
Suppose a ground cardinal became smaller in the extension. There would be a surjection for some ordinal . A finite domain cannot map onto an infinite ordinal, so use part (a) to cover by a ground function of small value sets. Its range is contained in .
If , the ground cardinality of is at most . If , regularity bounds a union of fewer than sets of size less than by a cardinal less than . In either case is a proper ground subset of , and the same missing ordinal remains missing in the extension, contradicting surjectivity.
Hence all ground cardinalities at least are preserved. Ground bijections also remain bijections, so old noncardinals cannot turn into cardinals. The assertion does not prevent collapse of smaller cardinals, and consequently does not by itself preserve the aleph index of .
Articles by others on the same topic
There are currently no matching articles.