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

Theorem luklem1 661
Description: Lemma for rederiving standard propositional axioms from Lukasiewicz'.
Hypotheses
Ref Expression
luklem1.1 |- (ph -> ps)
luklem1.2 |- (ps -> ch)
Assertion
Ref Expression
luklem1 |- (ph -> ch)

Proof of Theorem luklem1
StepHypRef Expression
1 luklem1.2 . 2 |- (ps -> ch)
2 luklem1.1 . . 3 |- (ph -> ps)
3 luk-1 658 . . 3 |- ((ph -> ps) -> ((ps -> ch) -> (ph -> ch)))
42, 3ax-mp 6 . 2 |- ((ps -> ch) -> (ph -> ch))
51, 4ax-mp 6 1 |- (ph -> ch)
Colors of variables: wff set class
Syntax hints:   -> wi 2
This theorem is referenced by:  luklem2 662  luklem3 663  luklem4 664  luklem5 665  luklem6 666  luklem7 667  ax2 670  ax3 671
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org