Theorem add32i 8039

Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by NM, 21-Jan-1997.)

Hypotheses

Ref	Expression
add.1	⊢ 𝐴 ∈ ℂ
add.2	⊢ 𝐵 ∈ ℂ
add.3	⊢ 𝐶 ∈ ℂ

Assertion

Ref	Expression
add32i	⊢ ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)

Proof of Theorem add32i

Step	Hyp	Ref	Expression
1		add.1	. 2 ⊢ 𝐴 ∈ ℂ
2		add.2	. 2 ⊢ 𝐵 ∈ ℂ
3		add.3	. 2 ⊢ 𝐶 ∈ ℂ
4		add32 8034	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
5	1, 2, 3, 4	mp3an 1319	1 ⊢ ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)

Syntax hints:   = wceq 1335   ∈ wcel 2128  (class class class)co 5824  ℂcc 7730   + caddc 7735

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2139  ax-addcom 7832  ax-addass 7834

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-rex 2441  df-v 2714  df-un 3106  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-iota 5135  df-fv 5178  df-ov 5827

This theorem is referenced by: (None)