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

Theorem merlem2 646
Description: Step 4 of Meredith's proof of Lukasiewicz axioms from his sole axiom.
Assertion
Ref Expression
merlem2 |- (((ph -> ph) -> ch) -> (th -> ch))

Proof of Theorem merlem2
StepHypRef Expression
1 merlem1 645 . 2 |- ((((ch -> ch) -> (-. ph -> -. th)) -> ph) -> (ph -> ph))
2 meredith 644 . 2 |- (((((ch -> ch) -> (-. ph -> -. th)) -> ph) -> (ph -> ph)) -> (((ph -> ph) -> ch) -> (th -> ch)))
31, 2ax-mp 6 1 |- (((ph -> ph) -> ch) -> (th -> ch))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  merlem3 647  merlem12 656
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org