MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cadrot Structured version   Visualization version   GIF version

Theorem cadrot 1647
Description: Rotation law for the adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)
Assertion
Ref Expression
cadrot (cadd(𝜑, 𝜓, 𝜒) ↔ cadd(𝜓, 𝜒, 𝜑))

Proof of Theorem cadrot
StepHypRef Expression
1 cadcoma 1645 . 2 (cadd(𝜑, 𝜓, 𝜒) ↔ cadd(𝜓, 𝜑, 𝜒))
2 cadcomb 1646 . 2 (cadd(𝜓, 𝜑, 𝜒) ↔ cadd(𝜓, 𝜒, 𝜑))
31, 2bitri 278 1 (cadd(𝜑, 𝜓, 𝜒) ↔ cadd(𝜓, 𝜒, 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  caddwcad 1639
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-an 402  df-or 862  df-3or 1104  df-3an 1105  df-xor 1542  df-cad 1640
This theorem is used by:  wl-df-3mintru2  38171
  Copyright terms: Public domain W3C validator