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

Theorem ibir 595
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 523 . 2 |- (ph -> (ph <-> ps))
32ibi 594 1 |- (ph -> ps)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146
This theorem is referenced by:  elpr2 2429  ffdm 3645  oprabval 4029  oacl 4176  nnacl 4235  cdafi 4948  nnnn0addclt 6127  uzaddclt 6450  expcllem 6576  pjin 9639
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