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

Theorem ibd 594
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 590 . 2 |- ((ps -> ch) <-> (ps -> (ps <-> ch)))
31, 2sylibr 200 1 |- (ph -> (ps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146
This theorem is referenced by:  oibabs 654  sssn 2473  reuuni4 2887  unblem2 4541  alephon 4865  atcv0eq 10306  atcv1t 10307  atoml 10309  atcvatlem 10312
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