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 ⊢ 𝐴 ∈ ℂ
mulrot3i.2 ⊢ 𝐵 ∈ ℂ
mulrot3i.3 ⊢ 𝐶 ∈ ℂ
Assertion mulrot3i ( ( 𝐴 · 𝐵 ) · 𝐶 ) = ( ( 𝐶 · 𝐴 ) · 𝐵 )

Proof

Step Hyp Ref Expression
1 mulrot3i.1 ⊢ 𝐴 ∈ ℂ
2 mulrot3i.2 ⊢ 𝐵 ∈ ℂ
3 mulrot3i.3 ⊢ 𝐶 ∈ ℂ
4 1 2 mulcli ⊢ ( 𝐴 · 𝐵 ) ∈ ℂ
5 4 3 mulcomi ⊢ ( ( 𝐴 · 𝐵 ) · 𝐶 ) = ( 𝐶 · ( 𝐴 · 𝐵 ) )
6 3 1 2 mulassi ⊢ ( ( 𝐶 · 𝐴 ) · 𝐵 ) = ( 𝐶 · ( 𝐴 · 𝐵 ) )
7 6 eqcomi ⊢ ( 𝐶 · ( 𝐴 · 𝐵 ) ) = ( ( 𝐶 · 𝐴 ) · 𝐵 )
8 5 7 eqtri ⊢ ( ( 𝐴 · 𝐵 ) · 𝐶 ) = ( ( 𝐶 · 𝐴 ) · 𝐵 )