Users' Mathboxes Mathbox for Owen Orger < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mulrot3i Structured version   Visualization version   GIF version

Theorem mulrot3i 44510
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.)
Hypotheses
Ref Expression
mulrot3i.1 𝐴 ∈ ℂ
mulrot3i.2 𝐵 ∈ ℂ
mulrot3i.3 𝐶 ∈ ℂ
Assertion
Ref Expression
mulrot3i ((𝐴 · 𝐵) · 𝐶) = ((𝐶 · 𝐴) · 𝐵)

Proof of Theorem mulrot3i
StepHypRef Expression
1 mulrot3i.1 . . . 4 𝐴 ∈ ℂ
2 mulrot3i.2 . . . 4 𝐵 ∈ ℂ
31, 2mulcli 11355 . . 3 (𝐴 · 𝐵) ∈ ℂ
4 mulrot3i.3 . . 3 𝐶 ∈ ℂ
53, 4mulcomi 11356 . 2 ((𝐴 · 𝐵) · 𝐶) = (𝐶 · (𝐴 · 𝐵))
64, 1, 2mulassi 11359 . . 3 ((𝐶 · 𝐴) · 𝐵) = (𝐶 · (𝐴 · 𝐵))
76eqcomi 2772 . 2 (𝐶 · (𝐴 · 𝐵)) = ((𝐶 · 𝐴) · 𝐵)
85, 7eqtri 2786 1 ((𝐴 · 𝐵) · 𝐶) = ((𝐶 · 𝐴) · 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  (class class class)co 7451  ℂcc 11237   · cmul 11244
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735  ax-mulcl 11301  ax-mulcom 11303  ax-mulass 11305
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1813  df-cleq 2755
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator