ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  syl5d Unicode version

Theorem syl5d 67
Description: A nested syllogism deduction. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Josh Purinton, 29-Dec-2000.) (Proof shortened by O'Cat, 2-Feb-2006.)
Hypotheses
Ref Expression
syl5d.1  |-  ( ph  ->  ( ps  ->  ch ) )
syl5d.2  |-  ( ph  ->  ( th  ->  ( ch  ->  ta ) ) )
Assertion
Ref Expression
syl5d  |-  ( ph  ->  ( th  ->  ( ps  ->  ta ) ) )

Proof of Theorem syl5d
StepHypRef Expression
1 syl5d.1 . . 3  |-  ( ph  ->  ( ps  ->  ch ) )
21a1d 22 . 2  |-  ( ph  ->  ( th  ->  ( ps  ->  ch ) ) )
3 syl5d.2 . 2  |-  ( ph  ->  ( th  ->  ( ch  ->  ta ) ) )
42, 3syldd 66 1  |-  ( ph  ->  ( th  ->  ( ps  ->  ta ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7
This theorem is referenced by:  syl7  68  syl9  71  imim12d  73  jaddc  795  pm4.79dc  843
  Copyright terms: Public domain W3C validator