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

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

Proof of Theorem syl3an2br
StepHypRef Expression
1 syl3an.1 . 2 |- ((ph /\ ps /\ ch) -> th)
2 syl3an2br.2 . . 3 |- (ps <-> ta)
32biimpri 169 . 2 |- (ta -> ps)
41, 3syl3an2 1131 1 |- ((ph /\ ta /\ ch) -> th)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ w3a 858
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 164  df-an 242  df-3an 860
Copyright terms: Public domain