MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nannot Unicode version

Theorem nannot 1299
Description: Show equivalence between negation and the Nicod version. To derive nic-dfneg 1441, apply nanbi 1300. (Contributed by Jeff Hoffman, 19-Nov-2007.)
Assertion
Ref Expression
nannot  |-  ( -. 
ps 
<->  ( ps  -/\  ps )
)

Proof of Theorem nannot
StepHypRef Expression
1 df-nan 1294 . . 3  |-  ( ( ps  -/\  ps )  <->  -.  ( ps  /\  ps ) )
2 anidm 626 . . 3  |-  ( ( ps  /\  ps )  <->  ps )
31, 2xchbinx 302 . 2  |-  ( ( ps  -/\  ps )  <->  -. 
ps )
43bicomi 194 1  |-  ( -. 
ps 
<->  ( ps  -/\  ps )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 177    /\ wa 359    -/\ wnan 1293
This theorem is referenced by:  nanbi  1300  trunantru  1360  falnanfal  1363  nic-dfneg  1441  andnand1  26056  imnand2  26057
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 178  df-an 361  df-nan 1294
  Copyright terms: Public domain W3C validator