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 | ⊢ 𝐴 ∈ ℂ | |
| addrot3i.2 | ⊢ 𝐵 ∈ ℂ | ||
| addrot3i.3 | ⊢ 𝐶 ∈ ℂ | ||
| Assertion | addrot3i | ⊢ ( ( 𝐴 + 𝐵 ) + 𝐶 ) = ( ( 𝐶 + 𝐴 ) + 𝐵 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addrot3i.1 | ⊢ 𝐴 ∈ ℂ | |
| 2 | addrot3i.2 | ⊢ 𝐵 ∈ ℂ | |
| 3 | addrot3i.3 | ⊢ 𝐶 ∈ ℂ | |
| 4 | 1 2 | addcli | ⊢ ( 𝐴 + 𝐵 ) ∈ ℂ |
| 5 | 4 3 | addcomi | ⊢ ( ( 𝐴 + 𝐵 ) + 𝐶 ) = ( 𝐶 + ( 𝐴 + 𝐵 ) ) |
| 6 | 3 1 2 | addassi | ⊢ ( ( 𝐶 + 𝐴 ) + 𝐵 ) = ( 𝐶 + ( 𝐴 + 𝐵 ) ) |
| 7 | 6 | eqcomi | ⊢ ( 𝐶 + ( 𝐴 + 𝐵 ) ) = ( ( 𝐶 + 𝐴 ) + 𝐵 ) |
| 8 | 5 7 | eqtri | ⊢ ( ( 𝐴 + 𝐵 ) + 𝐶 ) = ( ( 𝐶 + 𝐴 ) + 𝐵 ) |