Please help me prove the following $$∀x(A→ B) ├ ¬∃x(A ∧ ¬B)$$ using natural deduction.
This is what I have done so far:
- $∀x(A→ B)$
- $∃x(A ∧ ¬B)$ assumption
- n $(A ∧ ¬B)[n/x]$ assumption
- $A[n/x] ∧ ¬B[n/x]$
- $A[n/x]$ $∧e,4$
- $B[n/x]$ $∧e,4$
How should I continue?
1) $\forall x(A \rightarrow B)$ --- premise
2) $A \rightarrow B$ --- from 1) by $\forall$-elimintion
3) $\exists x (A \land \lnot B)$ --- assumed [a]
4) $A \land \lnot B$ --- assumed [b] for $\exists$-elimination
5) $A$ --- from 4) by $\land$-elimination
6) $\lnot B$ --- from 4) by $\land$-elimination
7) $B$ --- from 5) and 2) by $\rightarrow$-elimination
8) $\bot$ --- from 6) and 7) by $\rightarrow$-elimination ($\lnot B$ is an abbreviation for : $B \rightarrow \bot$)
9) $\bot$ --- from 3), 4)-8) by $\exists$-elimination, discharging assumption [b]