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

Theorem bii 140
Description: Relate the biconditional connective to primitive connectives. See biigb 129 for an unusual version proved directly from axioms.
Assertion
Ref Expression
bii |- ((ph <-> ps) <-> -. ((ph -> ps) -> -. (ps -> ph)))

Proof of Theorem bii
StepHypRef Expression
1 bi1 130 . . 3 |- ((ph <-> ps) -> (ph -> ps))
2 bi2 131 . . 3 |- ((ph <-> ps) -> (ps -> ph))
31, 2jc 119 . 2 |- ((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph)))
4 bi3 132 . . 3 |- ((ph -> ps) -> ((ps -> ph) -> (ph <-> ps)))
54impi 124 . 2 |- (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps))
63, 5impbi 139 1 |- ((ph <-> ps) <-> -. ((ph -> ps) -> -. (ps -> ph)))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127
This theorem is referenced by:  bi 396
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
metamath.org