Theorem cadcomb 1615

Description: Commutative law for the adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.) (Proof shortened by Wolf Lammen, 11-Jul-2020.)

Assertion

Ref	Expression
cadcomb	⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ cadd(𝜑, 𝜒, 𝜓))

Proof of Theorem cadcomb

Step	Hyp	Ref	Expression
1		cadan 1611	. . 3 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)))
2		3ancoma 1095	. . 3 ⊢ (((𝜑 ∨ 𝜓) ∧ (𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜑 ∨ 𝜓) ∧ (𝜓 ∨ 𝜒)))
3		orcom 867	. . . 4 ⊢ ((𝜓 ∨ 𝜒) ↔ (𝜒 ∨ 𝜓))
4	3	3anbi3i 1156	. . 3 ⊢ (((𝜑 ∨ 𝜒) ∧ (𝜑 ∨ 𝜓) ∧ (𝜓 ∨ 𝜒)) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜑 ∨ 𝜓) ∧ (𝜒 ∨ 𝜓)))
5	1, 2, 4	3bitri 300	. 2 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜑 ∨ 𝜓) ∧ (𝜒 ∨ 𝜓)))
6		cadan 1611	. 2 ⊢ (cadd(𝜑, 𝜒, 𝜓) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜑 ∨ 𝜓) ∧ (𝜒 ∨ 𝜓)))
7	5, 6	bitr4i 281	1 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ cadd(𝜑, 𝜒, 𝜓))

Syntax hints:   ↔ wb 209   ∨ wo 844   ∧ w3a 1084  caddwcad 1608

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 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-xor 1503  df-cad 1609

This theorem is referenced by:  cadrot  1616