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

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

Proof of Theorem syl3anl1
StepHypRef Expression
1 syl3anl1.1 . . . 4 |- (((ph /\ ps /\ ch) /\ th) -> ta)
21ex 373 . . 3 |- ((ph /\ ps /\ ch) -> (th -> ta))
3 syl3anl1.2 . . 3 |- (et -> ph)
42, 3syl3an1 857 . 2 |- ((et /\ ps /\ ch) -> (th -> ta))
54imp 350 1 |- (((et /\ ps /\ ch) /\ th) -> ta)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   /\ w3a 773
This theorem is referenced by:  syl3anr1 874  ltdiv2t 5835
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 775
Copyright terms: Public domain