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

Theorem dn1 932
Description: A single axiom for Boolean algebra known as DN1. See http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf. (Contributed by Jeffrey Hankins, 3-Jul-2009.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 6-Jan-2013.)
Assertion
Ref Expression
dn1

Proof of Theorem dn1
StepHypRef Expression
1 pm2.45 386 . . . . 5
2 imnan 411 . . . . 5
31, 2mpbi 199 . . . 4
43biorfi 396 . . 3
5 orcom 376 . . . 4
6 ordir 835 . . . 4
75, 6bitri 240 . . 3
84, 7bitri 240 . 2
9 pm4.45 669 . . . . 5
10 anor 475 . . . . 5
119, 10bitri 240 . . . 4
1211orbi2i 505 . . 3
1312anbi2i 675 . 2
14 anor 475 . 2
158, 13, 143bitrri 263 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wb 176   wo 357   wa 358
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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator