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

Theorem hadnot 1393
Description: The half adder distributes over negation. (Contributed by Mario Carneiro, 4-Sep-2016.)
Assertion
Ref Expression
hadnot hadd hadd

Proof of Theorem hadnot
StepHypRef Expression
1 xorneg 1313 . . . 4  \/_  \/_
2 biid 227 . . . 4
31, 2xorbi12i 1314 . . 3  \/_  \/_  \/_  \/_
4 xorneg2 1312 . . 3  \/_  \/_  \/_  \/_
53, 4bitr2i 241 . 2  \/_  \/_  \/_  \/_
6 df-had 1380 . . 3 hadd  \/_  \/_
76notbii 287 . 2 hadd  \/_  \/_
8 df-had 1380 . 2 hadd  \/_  \/_
95, 7, 83bitr4i 268 1 hadd hadd
Colors of variables: wff setvar class
Syntax hints:   wn 3   wb 176    \/_ wxo 1304  haddwhad 1378
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-xor 1305  df-had 1380
This theorem is referenced by:  had0  1403
  Copyright terms: Public domain W3C validator