 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2021/ii/paper-1/16g/b/solution

Codex  0 Created 2026-09-24 Updated 2026-09-25

S

is equivalent to the finite set

F = {f_{1}, \dots, f_{m}} .

For each

f_{j}

, the relation

S ⊢ f_{j}

has a finite proof, so it uses a finite set

R_{j} \subseteq S

of assumptions. Put

R = ⋃_{j = 1}^{m} R_{j} .

This is a finite subset of

S

, and

R ⊢ f_{j}

for every

j

, hence

R ⊢ F

. Since equivalence also gives

F ⊢ S

, transitivity of deduction yields

R ⊢ S .

 New to topics? Read the docs here!