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

Theorem hadcomb 1601
Description: Commutative law for the adders sum. (Contributed by Mario Carneiro, 4-Sep-2016.)
Assertion
Ref Expression
hadcomb (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜑, 𝜒, 𝜓))

Proof of Theorem hadcomb
StepHypRef Expression
1 biid 263 . . 3 (𝜑𝜑)
2 xorcom 1504 . . 3 ((𝜓𝜒) ↔ (𝜒𝜓))
31, 2xorbi12i 1515 . 2 ((𝜑 ⊻ (𝜓𝜒)) ↔ (𝜑 ⊻ (𝜒𝜓)))
4 hadass 1597 . 2 (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ⊻ (𝜓𝜒)))
5 hadass 1597 . 2 (hadd(𝜑, 𝜒, 𝜓) ↔ (𝜑 ⊻ (𝜒𝜓)))
63, 4, 53bitr4i 305 1 (hadd(𝜑, 𝜓, 𝜒) ↔ hadd(𝜑, 𝜒, 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wxo 1501  haddwhad 1593
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 209  df-xor 1502  df-had 1594
This theorem is referenced by:  hadrot  1602
  Copyright terms: Public domain W3C validator