| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cadcomb | Structured version Visualization version Unicode version | ||
| Description: Commutative law for the adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.) (Proof shortened by Wolf Lammen, 11-Jul-2020.) |
| Ref | Expression |
|---|---|
| cadcomb |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cadan 1548 |
. . 3
| |
| 2 | 3ancoma 1045 |
. . 3
| |
| 3 | orcom 402 |
. . . 4
| |
| 4 | 3 | 3anbi3i 1255 |
. . 3
|
| 5 | 1, 2, 4 | 3bitri 286 |
. 2
|
| 6 | cadan 1548 |
. 2
| |
| 7 | 5, 6 | bitr4i 267 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| 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-3or 1038 df-3an 1039 df-xor 1465 df-cad 1546 |
| This theorem is referenced by: cadrot 1553 |
| Copyright terms: Public domain | W3C validator |