Theorem dfbi1 175

Description: Relate the biconditional connective to primitive connectives. See dfbi1gb 176 for an unusual version proved directly from axioms.

Assertion

Ref	Expression
dfbi1	|- ((ph <-> ps) <-> -. ((ph -> ps) -> -. (ps -> ph)))

Proof of Theorem dfbi1

Step	Hyp	Ref	Expression
1		bi1 165	. . 3 |- ((ph <-> ps) -> (ph -> ps))
2		bi2 166	. . 3 |- ((ph <-> ps) -> (ps -> ph))
3	1, 2	jc 153	. 2 |- ((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph)))
4		bi3 167	. . 3 |- ((ph -> ps) -> ((ps -> ph) -> (ph <-> ps)))
5	4	impi 160	. 2 |- (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps))
6	3, 5	impbii 174	1 |- ((ph <-> ps) <-> -. ((ph -> ps) -> -. (ps -> ph)))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 163

This theorem is referenced by:  dfbi2 572  pm5.18 722  axrepprim 13786  axacprim 13791  tbw-bijust 14165  rb-bijust 14216

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

Copyright terms: Public domain