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

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

Proof of Theorem ibir
StepHypRef Expression
1 ibir.1 . . 3 |- (ph -> (ps <-> ph))
21bicomd 399 . 2 |- (ph -> (ph <-> ps))
32ibi 449 1 |- (ph -> ps)
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127
This theorem is referenced by:  oacl 3138  cdafi 3730  expcllem 4682
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