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

Theorem nbbn 724
Description: Move negation outside of biconditional. Compare Theorem *5.18 of [WhiteheadRussell] p. 124.
Assertion
Ref Expression
nbbn |- ((-. ph <-> ps) <-> -. (ph <-> ps))

Proof of Theorem nbbn
StepHypRef Expression
1 bicom 579 . 2 |- ((-. ph <-> ps) <-> (ps <-> -. ph))
2 bicom 579 . . . 4 |- ((ph <-> ps) <-> (ps <-> ph))
3 pm5.18 722 . . . 4 |- ((ps <-> ph) <-> -. (ps <-> -. ph))
42, 3bitri 190 . . 3 |- ((ph <-> ps) <-> -. (ps <-> -. ph))
54con2bii 238 . 2 |- ((ps <-> -. ph) <-> -. (ph <-> ps))
61, 5bitri 190 1 |- ((-. ph <-> ps) <-> -. (ph <-> ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 163
This theorem is referenced by:  xor 734  biass 816  symdif2OLD 2858  canth 5112  TFBid 14121  assxor 14279
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