HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem merlem11 655
Description: Step 20 of Meredith's proof of Lukasiewicz axioms from his sole axiom.
Assertion
Ref Expression
merlem11 |- ((ph -> (ph -> ps)) -> (ph -> ps))

Proof of Theorem merlem11
StepHypRef Expression
1 meredith 644 . 2 |- (((((ph -> ph) -> (-. ph -> -. ph)) -> ph) -> ph) -> ((ph -> ph) -> (ph -> ph)))
2 merlem10 654 . . 3 |- ((ph -> (ph -> ps)) -> ((ph -> (ph -> ps)) -> (ph -> ps)))
3 merlem10 654 . . 3 |- (((ph -> (ph -> ps)) -> ((ph -> (ph -> ps)) -> (ph -> ps))) -> ((((((ph -> ph) -> (-. ph -> -. ph)) -> ph) -> ph) -> ((ph -> ph) -> (ph -> ph))) -> ((ph -> (ph -> ps)) -> (ph -> ps))))
42, 3ax-mp 6 . 2 |- ((((((ph -> ph) -> (-. ph -> -. ph)) -> ph) -> ph) -> ((ph -> ph) -> (ph -> ph))) -> ((ph -> (ph -> ps)) -> (ph -> ps)))
51, 4ax-mp 6 1 |- ((ph -> (ph -> ps)) -> (ph -> ps))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  merlem12 656  merlem13 657  luk-2 659  luk-3 660
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org