Theorem add32d 8247

Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by Mario Carneiro, 27-May-2016.)

Hypotheses

Ref	Expression
addd.1	⊢ (𝜑 → 𝐴 ∈ ℂ)
addd.2	⊢ (𝜑 → 𝐵 ∈ ℂ)
addd.3	⊢ (𝜑 → 𝐶 ∈ ℂ)

Assertion

Ref	Expression
add32d	⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))

Proof of Theorem add32d

Step	Hyp	Ref	Expression
1		addd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ ℂ)
2		addd.2	. 2 ⊢ (𝜑 → 𝐵 ∈ ℂ)
3		addd.3	. 2 ⊢ (𝜑 → 𝐶 ∈ ℂ)
4		add32 8238	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
5	1, 2, 3, 4	syl3anc 1250	1 ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))

Syntax hints:   → wi 4   = wceq 1373   ∈ wcel 2177  (class class class)co 5951  ℂcc 7930   + caddc 7935

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188  ax-addcom 8032  ax-addass 8034

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-rex 2491  df-v 2775  df-un 3171  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-br 4048  df-iota 5237  df-fv 5284  df-ov 5954

This theorem is referenced by:  nppcan  8301  muladd  8463  peano5uzti  9488  flqaddz  10447  seq3shft2  10633  zesq  10810  abstri  11459  bdtrilem  11594  pythagtriplem1  12632  pythagtriplem12  12642  gsumfzconst  13721