I got confused with these:
using ONLY this three axioms and Modus Ponens:$$1. \ F \implies (G\implies F) \\ 2. \ (F \implies (G\implies H))\implies ((F \implies G)\implies (F \implies H)) \\ 3. \ (\neg G \implies \neg F)\implies ((\neg G\implies F)\implies G)$$
I need to prove: $$4. \ (F \implies G)\implies ((G \implies H)\implies(F\implies H))\\$$ I see it intuitively, but I have to use ONLY the axioms.
I started like this: $$1. F \implies G\\2. \ H \implies (F \implies G) \ by \ (1)\\3.((H\implies F)\implies (H \implies G)) \ by \ (2)$$ but that is not what I want
Thank you for your help.
The automated theorem prover OTTER has found a 10 step, level 5 proof:
Interestingly enough, there exists at least two proofs with a greater level, but which have less steps. OTTER found a 9 step, level 7 proof:
And a 7 step, level 6 proof: