Metamath Proof Explorer


Theorem addrot3i

Description: Cyclically permute three complex summands with left-associated output. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

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

Proof

Step Hyp Ref Expression
1 addrot3i.1 ⊢ A ∈ ℂ
2 addrot3i.2 ⊢ B ∈ ℂ
3 addrot3i.3 ⊢ C ∈ ℂ
4 1 2 addcli ⊢ A + B ∈ ℂ
5 4 3 addcomi ⊢ A + B + C = C + A + B
6 3 1 2 addassi ⊢ C + A + B = C + A + B
7 6 eqcomi ⊢ C + A + B = C + A + B
8 5 7 eqtri ⊢ A + B + C = C + A + B