Theorem xor3 737

Description: Two ways to express "exclusive or."

Assertion

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

Proof of Theorem xor3

Step	Hyp	Ref	Expression
1		pm5.18 722	. . 3 |- ((ph <-> ps) <-> -. (ph <-> -. ps))
2	1	con2bii 238	. 2 |- ((ph <-> -. ps) <-> -. (ph <-> ps))
3	2	bicomi 189	1 |- (-. (ph <-> ps) <-> (ph <-> -. ps))

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

This theorem is referenced by:  notzfaus 3478  nmogtmnf 9772  nmopgtmnf 11432

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