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

Theorem bibi1i 461
Description: Inference adding a biconditional to the right in an equivalence.
Hypothesis
Ref Expression
bibi.a |- (ph <-> ps)
Assertion
Ref Expression
bibi1i |- ((ph <-> ch) <-> (ps <-> ch))

Proof of Theorem bibi1i
StepHypRef Expression
1 bicom 398 . 2 |- ((ph <-> ch) <-> (ch <-> ph))
2 bibi.a . . 3 |- (ph <-> ps)
32bibi2i 460 . 2 |- ((ch <-> ph) <-> (ch <-> ps))
4 bicom 398 . 2 |- ((ch <-> ps) <-> (ps <-> ch))
51, 3, 43bitr 155 1 |- ((ph <-> ch) <-> (ps <-> ch))
Colors of variables: wff set class
Syntax hints:   <-> wb 127
This theorem is referenced by:  bibi12i 462  sbrbis 892  axac 1085  sbabel 1189  aceq1 3552  aceq0 3553  zfcndac 3765
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