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

Theorem syldanl 449
Description: A syllogism deduction with conjoined antecedents. (Contributed by Jeff Madsen, 20-Jun-2011.)
Hypotheses
Ref Expression
syldanl.1  |-  ( (
ph  /\  ps )  ->  ch )
syldanl.2  |-  ( ( ( ph  /\  ch )  /\  th )  ->  ta )
Assertion
Ref Expression
syldanl  |-  ( ( ( ph  /\  ps )  /\  th )  ->  ta )

Proof of Theorem syldanl
StepHypRef Expression
1 syldanl.1 . . . 4  |-  ( (
ph  /\  ps )  ->  ch )
21ex 115 . . 3  |-  ( ph  ->  ( ps  ->  ch ) )
32imdistani 445 . 2  |-  ( (
ph  /\  ps )  ->  ( ph  /\  ch ) )
4 syldanl.2 . 2  |-  ( ( ( ph  /\  ch )  /\  th )  ->  ta )
53, 4sylan 283 1  |-  ( ( ( ph  /\  ps )  /\  th )  ->  ta )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This theorem is referenced by:  grplmulf1o  12800  grplactcnv  12828
  Copyright terms: Public domain W3C validator