I'm self-studying propositional calculus, and one of the exercises is to prove that replacing the law of excluded middle ($A \lor \lnot A$) with double negation elimination (that is, $\lnot \lnot A \rightarrow A$) does not change the set of provable theorems in the axiomatic set.
The most obvious way to prove this is to prove the claim in the title. I managed to prove it in one direction, that is $A \lor \lnot A$ along with other schemas implies $\lnot \lnot A \rightarrow A$, but I'm quite stuck with the other direction.
So, the ten remaining axiom schemas (after removing the law of excluded middle) are as follows:
- $A \rightarrow (B \rightarrow A)$;
- $(A \rightarrow (B \rightarrow C)) \rightarrow ((A \rightarrow B) \rightarrow (A \rightarrow C))$;
- $(A \land B) \rightarrow A$;
- $(A \land B) \rightarrow B$;
- $A \rightarrow (B \rightarrow (A \land B))$;
- $A \rightarrow (A \lor B)$;
- $B \rightarrow (A \lor B)$;
- $(A \rightarrow C) \rightarrow ((B \rightarrow C) \rightarrow (A \lor B \rightarrow C))$;
- $\lnot A \rightarrow (A \rightarrow B)$;
- $(A \rightarrow B) \rightarrow ((A \rightarrow \lnot B) \rightarrow \lnot A)$.
I'm only having modus ponens as the inference rule, and I'm not supposed to know about $\bot$ yet (since some similar questions here mention it).
I also managed to prove $\lnot \lnot \lnot A \rightarrow \lnot A$ and $A \rightarrow \lnot \lnot A$ in the meanwhile, but they don't seem to help here.