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

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

Proof of Theorem syl3anr1
StepHypRef Expression
1 syl3anr1.1 . . . 4 |- ((ph /\ (ps /\ ch /\ th)) -> ta)
21ancoms 436 . . 3 |- (((ps /\ ch /\ th) /\ ph) -> ta)
3 syl3anr1.2 . . 3 |- (et -> ps)
42, 3syl3anl1 873 . 2 |- (((et /\ ch /\ th) /\ ph) -> ta)
54ancoms 436 1 |- ((ph /\ (et /\ ch /\ th)) -> ta)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   /\ w3a 775
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 777
Copyright terms: Public domain