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

Theorem ibd 451
Description: Deduction that converts a biconditional implied by one of its arguments, into an implication.
Hypothesis
Ref Expression
ibd.1 |- (ph -> (ps -> (ps <-> ch)))
Assertion
Ref Expression
ibd |- (ph -> (ps -> ch))

Proof of Theorem ibd
StepHypRef Expression
1 ibd.1 . 2 |- (ph -> (ps -> (ps <-> ch)))
2 ibib 448 . 2 |- ((ps -> ch) <-> (ps -> (ps <-> ch)))
31, 2sylibr 175 1 |- (ph -> (ps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127
This theorem is referenced by:  oibabs 493  sssn 1852  unblem2 3432  alephon 3671  atcv0eq 5767  atcv1 5768  atcvatlem 5770
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