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

Theorem dfbi 573
Description: Definition df-bi 164 rewritten in an abbreviated form to help intuitive understanding of that definition. Note that it is a conjunction of two implications; one which asserts properties that follow from the biconditional and one which asserts properties that imply the biconditional.
Assertion
Ref Expression
dfbi |- (((ph <-> ps) -> ((ph -> ps) /\ (ps -> ph))) /\ (((ph -> ps) /\ (ps -> ph)) -> (ph <-> ps)))

Proof of Theorem dfbi
StepHypRef Expression
1 dfbi2 572 . . 3 |- ((ph <-> ps) <-> ((ph -> ps) /\ (ps -> ph)))
21biimpi 168 . 2 |- ((ph <-> ps) -> ((ph -> ps) /\ (ps -> ph)))
31biimpri 169 . 2 |- (((ph -> ps) /\ (ps -> ph)) -> (ph <-> ps))
42, 3pm3.2i 307 1 |- (((ph <-> ps) -> ((ph -> ps) /\ (ps -> ph))) /\ (((ph -> ps) /\ (ps -> ph)) -> (ph <-> ps)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240
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 164  df-an 242
Copyright terms: Public domain