So I need to prove ⊢ (B → ¬B) → ¬B
I can use the Modus ponus (MP) rule, and deduction theorem (DT). And I have these 3 axioms:
α → (β → α) --- (A1)
(α → (β → γ)) → ((α → β) → (α → γ)) --- (A2)
(¬β → ¬α) → ((¬β → α) → β) --- (A3)
The first step I did was to use DT to simplify what I need to proof to (B → ¬B) ⊢ ¬B. And then I'm stuck.
Does anyone know how to go on to solve the formal proof? Or any hints on how to start would be greatly appreciated! Also, as a general rule, how do you know which axioms to use to solve the proof? Is there any particular pattern that I should look out for? If not, it seems very trial and error to me and I always get stuck at the start of the proof.
Thank you so much!
Note that the third axiom says that if the negation of a proposition implies some other proposition and it's negation, then the original proposition holds. Note also that the negation of $\lnot$B is $\lnot$$\lnot$B.
So, assume $\lnot$$\lnot$B. Deduce B (hint assume $\lnot$B next). And I hope you can take it from there.