Let , and suppose a first-order formula defines exactly one for every . Apply the Lévy reflection theorem to the formulas needed to express this assertion, choosing an ordinal with such that
for every . Therefore every required value lies in the set .
The already established axiom schema of separation forms the set
Functionality makes exactly the range of the definable function on . This proves every instance of the Axiom schema of replacement in the generic extension .
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.