| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hadrot | Structured version Visualization version GIF version | ||
| Description: Rotation law for the adder sum. (Contributed by Mario Carneiro, 4-Sep-2016.) |
| Ref | Expression |
|---|---|
| hadrot | ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜓, 𝜒, 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hadcoma 1629 | . 2 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜓, 𝜑, 𝜒)) | |
| 2 | hadcomb 1630 | . 2 ⊢ (hadd(𝜓, 𝜑, 𝜒) ↔ hadd(𝜓, 𝜒, 𝜑)) | |
| 3 | 1, 2 | bitri 278 | 1 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜓, 𝜒, 𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 haddwhad 1623 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-xor 1542 df-had 1624 |
| This theorem is used by: had1 1633 had0 1634 had1OLD 1635 sadadd2lem2 16544 saddisjlem 16558 |
| Copyright terms: Public domain | W3C validator |