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

Theorem syl6d 54
Description: A nested syllogism deduction. (The proof was shortened by Josh Purinton, 29-Dec-00.)
Hypotheses
Ref Expression
syl6d.1 |- (ph -> (ps -> (ch -> th)))
syl6d.2 |- (ph -> (th -> ta ))
Assertion
Ref Expression
syl6d |- (ph -> (ps -> (ch -> ta )))

Proof of Theorem syl6d
StepHypRef Expression
1 syl6d.1 . 2 |- (ph -> (ps -> (ch -> th)))
2 syl6d.2 . . 3 |- (ph -> (th -> ta ))
32syl3d 26 . 2 |- (ph -> ((ch -> th) -> (ch -> ta )))
41, 3syld 27 1 |- (ph -> (ps -> (ch -> ta )))
Colors of variables: wff set class
Syntax hints:   -> wi 2
This theorem is referenced by:  cbv1 845  sbi1 884  tfinds 2401  ltexprlem7 3942
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6
metamath.org