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 ∈ ℂ
mulrot3i.2 ⊢ B ∈ ℂ
mulrot3i.3 ⊢ C ∈ ℂ
Assertion mulrot3i ⊢ A ⁢ B ⁢ C = C ⁢ A ⁢ B

Proof

Step Hyp Ref Expression
1 mulrot3i.1 ⊢ A ∈ ℂ
2 mulrot3i.2 ⊢ B ∈ ℂ
3 mulrot3i.3 ⊢ C ∈ ℂ
4 1 2 mulcli ⊢ A ⁢ B ∈ ℂ
5 4 3 mulcomi ⊢ A ⁢ B ⁢ C = C ⁢ A ⁢ B
6 3 1 2 mulassi ⊢ 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