Metamath Proof Explorer


Theorem add32i

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

Ref Expression
Hypotheses add.1 ⊢ A ∈ ℂ
add.2 ⊢ B ∈ ℂ
add.3 ⊢ C ∈ ℂ
Assertion add32i ⊢ A + B + C = A + C + B

Proof

Step Hyp Ref Expression
1 add.1 ⊢ A ∈ ℂ
2 add.2 ⊢ B ∈ ℂ
3 add.3 ⊢ C ∈ ℂ
4 add32 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ → A + B + C = A + C + B
5 1 2 3 4 mp3an ⊢ A + B + C = A + C + B