Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/ii/paper-1/16i/i/solution

For distinct and distinct , take all clauses
The first family says that each is paired with at most one ; the second says that each is paired with at most one . There is no existence clause, so the domain may be any subset of . Thus the relations are exactly the injective partial functions from to .

New to topics? Read the docs here!