The forcing theorem has two parts. The definability lemma says that for every formula , the relation
is definable in . The truth lemma says that if is generic over , then
Assume the forcing relation and the forcing theorem have been constructed for . Define
to mean that
is dense below . This definition is first-order over , so the definability lemma is preserved.
Suppose forces the existential statement. Genericity below gives and a name with . The truth lemma for yields
so the existential statement is true. Conversely, if , choose a name for a witness. The truth lemma for gives with , and then . This proves both directions of the forcing theorem for the existential formula.
Conditions in are compatible finite functions, so their union is a function . For each , the set
is dense: choose a normal function extending and add its value at . Genericity makes total.
If , choose a condition in the filter extending conditions that decide both values. It is contained in a normal function on an ordinal, so . Thus is strictly increasing.
It remains to prove continuity. For every limit and , let contain the conditions such that and either
or there is some in with . This set is dense. Given , extend it to a normal function and add ; if , continuity of supplies an with , which may also be added.
Now fix . Since meets , compatibility with the condition deciding rules out the first alternative and gives with . Therefore values below are cofinal in . Strict increase supplies the reverse bound, so
Hence is normal on in .

Articles by others on the same topic (0)

There are currently no matching articles.