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

Theorem merlem4 648
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 644 . 2 |- (((((ph -> ph) -> (-. th -> -. th)) -> th) -> ta ) -> ((ta -> ph) -> (th -> ph)))
2 merlem3 647 . 2 |- ((((((ph -> ph) -> (-. th -> -. th)) -> th) -> ta ) -> ((ta -> ph) -> (th -> ph))) -> (ta -> ((ta -> ph) -> (th -> ph))))
31, 2ax-mp 6 1 |- (ta -> ((ta -> ph) -> (th -> ph)))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  merlem5 649  merlem6 650  merlem7 651  merlem12 656  luk-2 659
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org