I just need a little help finishing off this proof, not sure where to go from here with introducing (∀x)
(∀x) F(x) ⇒ G(x), (∃x) F(x) ⊢ (∀x) G(x)
1 (1) (∀x) F(x) ⇒ G(x) A
2 (2) (∃x) F(x) A
3 (3) F(a) A
1 (4) F(a) ⇒ G(a) 1 ∀ E
1, 3 (5) G(a) 3, 4 MP
Thanks