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

Theorem cadbi123i 1385
Description: Equality theorem for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)
Hypotheses
Ref Expression
hadbii.1
hadbii.2
hadbii.3
Assertion
Ref Expression
cadbi123i cadd cadd

Proof of Theorem cadbi123i
StepHypRef Expression
1 hadbii.1 . . . 4
21a1i 10 . . 3
3 hadbii.2 . . . 4
43a1i 10 . . 3
5 hadbii.3 . . . 4
65a1i 10 . . 3
72, 4, 6cadbi123d 1383 . 2 cadd cadd
87trud 1323 1 cadd cadd
Colors of variables: wff setvar class
Syntax hints:   wb 176   wtru 1316  caddwcad 1379
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-xor 1305  df-tru 1319  df-cad 1381
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator