Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2018/digital-systems-linear-algebra-introduction-to-formal-proof/8/b/i/solution

Use a fresh witness in the existential elimination subproof. The universal elimination step gives the opposite of its assumed negated property.
1. ∀x R(x)              premise
2.   ∃y ¬R(y)           assumption [i]
3.     ¬R(a)            fresh witness assumption [j]
4.     R(a)             ∀E, 1
5.     ⊥                ¬E, 3, 4
6.   ⊥                  ∃E, 2, 3–5, discharging [j]
7. ¬∃y ¬R(y)            ¬I, 2–6, discharging [i]
The witness is absent from the premise and from the conclusion of the existential-elimination step, so its freshness condition is met.

New to topics? Read the docs here!