Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/iii/paper-128/2/b/solution

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.

New to topics? Read the docs here!