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

Theorem syld3an1 873
Description: A syllogism inference.
Hypotheses
Ref Expression
syl3an.1 |- ((ph /\ ps /\ ch) -> th)
syld3an1.2 |- ((ta /\ ps /\ ch) -> ph)
Assertion
Ref Expression
syld3an1 |- ((ta /\ ps /\ ch) -> th)

Proof of Theorem syld3an1
StepHypRef Expression
1 syl3an.1 . . . 4 |- ((ph /\ ps /\ ch) -> th)
213com13 840 . . 3 |- ((ch /\ ps /\ ph) -> th)
3 syld3an1.2 . . . 4 |- ((ta /\ ps /\ ch) -> ph)
433com13 840 . . 3 |- ((ch /\ ps /\ ta) -> ph)
52, 4syld3an3 872 . 2 |- ((ch /\ ps /\ ta) -> th)
653com13 840 1 |- ((ta /\ ps /\ ch) -> th)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ w3a 777
This theorem is referenced by:  npncant 5419  ppncant 5500
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-an 225  df-3an 779
Copyright terms: Public domain