NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  nic-dfneg Unicode version

Theorem nic-dfneg 1435
Description: Define negation in terms of 'nand'. Analogous to . In a pure (standalone) treatment of Nicod's axiom, this theorem would be changed to a definition ($a statement). (Contributed by NM, 11-Dec-2008.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
nic-dfneg

Proof of Theorem nic-dfneg
StepHypRef Expression
1 nannot 1293 . . 3
21bicomi 193 . 2
3 nanbi 1294 . 2
42, 3mpbi 199 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wb 176   wnan 1287
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288
This theorem is referenced by:  nic-luk2  1457  nic-luk3  1458
  Copyright terms: Public domain W3C validator