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 e. CC |
|
| addrot3i.2 | |- B e. CC |
||
| addrot3i.3 | |- C e. CC |
||
| Assertion | addrot3i | |- ( ( A + B ) + C ) = ( ( C + A ) + B ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addrot3i.1 | |- A e. CC |
|
| 2 | addrot3i.2 | |- B e. CC |
|
| 3 | addrot3i.3 | |- C e. CC |
|
| 4 | 1 2 | addcli | |- ( A + B ) e. CC |
| 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 ) |