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

Theorem syldd 50
Description: Nested syllogism deduction.
Hypotheses
Ref Expression
syldd.1 |- (ph -> (ps -> (ch -> th)))
syldd.2 |- (ph -> (ps -> (th -> ta )))
Assertion
Ref Expression
syldd |- (ph -> (ps -> (ch -> ta )))

Proof of Theorem syldd
StepHypRef Expression
1 syldd.1 . 2 |- (ph -> (ps -> (ch -> th)))
2 syldd.2 . . 3 |- (ph -> (ps -> (th -> ta )))
3 syl1 16 . . 3 |- ((th -> ta ) -> ((ch -> th) -> (ch -> ta )))
42, 3syl6 23 . 2 |- (ph -> (ps -> ((ch -> th) -> (ch -> ta ))))
51, 4mpdd 47 1 |- (ph -> (ps -> (ch -> ta )))
Colors of variables: wff set class
Syntax hints:   -> wi 2
This theorem is referenced by:  prlem934 3933
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6
metamath.org