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

Theorem sylancbr 363
Description: A syllogism inference combined with contraction.
Hypotheses
Ref Expression
sylancbr.1 |- ((ph /\ ps) -> ch)
sylancbr.2 |- (ph <-> th)
sylancbr.3 |- (ps <-> th)
Assertion
Ref Expression
sylancbr |- (th -> ch)

Proof of Theorem sylancbr
StepHypRef Expression
1 sylancbr.1 . . 3 |- ((ph /\ ps) -> ch)
2 sylancbr.2 . . 3 |- (ph <-> th)
3 sylancbr.3 . . 3 |- (ps <-> th)
41, 2, 3syl2anbr 351 . 2 |- ((th /\ th) -> ch)
54anidms 332 1 |- (th -> ch)
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196
This theorem is referenced by:  sucxpdom 3652
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198
metamath.org