Metamath Proof Explorer


Theorem mulrot3i

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

Ref Expression
Hypotheses mulrot3i.1
|- A e. CC
mulrot3i.2
|- B e. CC
mulrot3i.3
|- C e. CC
Assertion mulrot3i
|- ( ( A x. B ) x. C ) = ( ( C x. A ) x. B )

Proof

Step Hyp Ref Expression
1 mulrot3i.1
 |-  A e. CC
2 mulrot3i.2
 |-  B e. CC
3 mulrot3i.3
 |-  C e. CC
4 1 2 mulcli
 |-  ( A x. B ) e. CC
5 4 3 mulcomi
 |-  ( ( A x. B ) x. C ) = ( C x. ( A x. B ) )
6 3 1 2 mulassi
 |-  ( ( C x. A ) x. B ) = ( C x. ( A x. B ) )
7 6 eqcomi
 |-  ( C x. ( A x. B ) ) = ( ( C x. A ) x. B )
8 5 7 eqtri
 |-  ( ( A x. B ) x. C ) = ( ( C x. A ) x. B )