Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cadcoma | Structured version Visualization version Unicode version |
Description: Commutative law for the adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.) |
Ref | Expression |
---|---|
cadcoma | cadd cadd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ancom 466 | . . 3 | |
2 | xorcom 1467 | . . . 4 | |
3 | 2 | anbi2i 730 | . . 3 |
4 | 1, 3 | orbi12i 543 | . 2 |
5 | df-cad 1546 | . 2 cadd | |
6 | df-cad 1546 | . 2 cadd | |
7 | 4, 5, 6 | 3bitr4i 292 | 1 cadd cadd |
Colors of variables: wff setvar class |
Syntax hints: wb 196 wo 383 wa 384 wxo 1464 caddwcad 1545 |
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 197 df-or 385 df-an 386 df-xor 1465 df-cad 1546 |
This theorem is referenced by: cadrot 1553 sadcom 15185 |
Copyright terms: Public domain | W3C validator |