We now prove the completeness of our Fitch-style system of natural
deduction for first-order languages, i.e.,
Theorem 4.1 (Completeness of Natural Deduction for First-Order
Languages)
Let

be a set of first-order formulas, and let

be one such formula. Then