I need to prove, using the Hilbert System: $(\neg A → \neg B) → ((\neg B → A) → B)$
The Axioms are:
- $A→(B→ A)$
- $(A→(B → C)) → ((A→ B)→ (A→ C))$
$(\neg A → \neg B) → (B → A)$
MP: $\dfrac{A, A→ B}{B}$
Any idea?
I need to prove, using the Hilbert System: $(\neg A → \neg B) → ((\neg B → A) → B)$
The Axioms are:
$(\neg A → \neg B) → (B → A)$
MP: $\dfrac{A, A→ B}{B}$
Any idea?
I'm not 100% certain, but I think that in a calculus with these axioms the fact that the substitution $(\lnot T \to \lnot F) \to ((\lnot F \to T) \to F)$ (where $T$ stands for True and $F$ for False) results in the formula being invalidated means that it cannot be deduced.
I'm stuck with the last step, I don't know if I can leave it as it:
4.$(\neg A\rightarrow \neg B)$hypothesis
5.$(B\rightarrow A)$ MP(3,4)
6.$(B\rightarrow A)\rightarrow (\neg B \rightarrow (B\rightarrow A) )$ applying Axiom 1
7.$(\neg B \rightarrow (B\rightarrow A) )$ MP(1,4)
8.$(\neg B \rightarrow (B\rightarrow A) )\rightarrow ((\neg B \rightarrow B) \rightarrow (\neg B \rightarrow A)) $ Applying axiom 2
9.$(\neg B \rightarrow B) \rightarrow (\neg B \rightarrow A) $ MP(7,8)
10.$(\neg B \rightarrow A) $ because it is a tautology
... Stuck