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

Theorem merlem4 925
Description: Step 8 of Meredith's proof of Lukasiewicz axioms from his sole axiom.
Assertion
Ref Expression
merlem4 |- (ta -> ((ta -> ph) -> (th -> ph)))

Proof of Theorem merlem4
StepHypRef Expression
1 meredith 921 . 2 |- (((((ph -> ph) -> (-. th -> -. th)) -> th) -> ta) -> ((ta -> ph) -> (th -> ph)))
2 merlem3 924 . 2 |- ((((((ph -> ph) -> (-. th -> -. th)) -> th) -> ta) -> ((ta -> ph) -> (th -> ph))) -> (ta -> ((ta -> ph) -> (th -> ph))))
31, 2ax-mp 7 1 |- (ta -> ((ta -> ph) -> (th -> ph)))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem is referenced by:  merlem5 926  merlem6 927  merlem7 928  merlem12 933  luk-2 936
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain