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

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

Proof of Theorem sylancb
StepHypRef Expression
1 sylancb.1 . . 3 |- ((ph /\ ps) -> ch)
2 sylancb.2 . . 3 |- (th <-> ph)
3 sylancb.3 . . 3 |- (th <-> ps)
41, 2, 3syl2anb 457 . 2 |- ((th /\ th) -> ch)
54anidms 436 1 |- (th -> ch)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223
This theorem is referenced by:  crrecz 6742
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
Copyright terms: Public domain