Theorem mul32i 11333

Description: Commutative/associative law that swaps the last two factors in a triple product. (Contributed by NM, 11-May-1999.)

Hypotheses

Ref	Expression
mul.1	⊢ 𝐴 ∈ ℂ
mul.2	⊢ 𝐵 ∈ ℂ
mul.3	⊢ 𝐶 ∈ ℂ

Assertion

Ref	Expression
mul32i	⊢ ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)

Proof of Theorem mul32i

Step	Hyp	Ref	Expression
1		mul.1	. 2 ⊢ 𝐴 ∈ ℂ
2		mul.2	. 2 ⊢ 𝐵 ∈ ℂ
3		mul.3	. 2 ⊢ 𝐶 ∈ ℂ
4		mul32 11303	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵))
5	1, 2, 3, 4	mp3an 1464	1 ⊢ ((𝐴 · 𝐵) · 𝐶) = ((𝐴 · 𝐶) · 𝐵)

Syntax hints:   = wceq 1542   ∈ wcel 2114  (class class class)co 7360  ℂcc 11027   · cmul 11034

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-mulcom 11093  ax-mulass 11095

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6448  df-fv 6500  df-ov 7363

This theorem is referenced by:  8th4div3  12388  faclbnd4lem1  14246  bpoly4  16015  dec5nprm  17028  dec2nprm  17029  karatsuba  17045  quart1lem  26832  log2ublem2  26924  log2ub  26926  normlem3  31198  bcseqi  31206  dpmul100  32971  dpmul1000  32973