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

Theorem bisyl7 189
Description: A mixed syllogism inference from a doubly nested implication and a biconditional.
Hypotheses
Ref Expression
bisyl7.1 |- (ph -> (ps -> (ch -> th)))
bisyl7.2 |- (ta <-> ch)
Assertion
Ref Expression
bisyl7 |- (ph -> (ps -> (ta -> th)))

Proof of Theorem bisyl7
StepHypRef Expression
1 bisyl7.1 . 2 |- (ph -> (ps -> (ch -> th)))
2 bisyl7.2 . . 3 |- (ta <-> ch)
32biimp 133 . 2 |- (ta -> ch)
41, 3syl7 24 1 |- (ph -> (ps -> (ta -> th)))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127
This theorem is referenced by:  jao 274  zfpair 1891
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
metamath.org