Theorem mul4i 11546

Description: Rearrangement of 4 factors. (Contributed by NM, 16-Feb-1995.)

Hypotheses

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

Assertion

Ref	Expression
mul4i	⊢ ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷))

Proof of Theorem mul4i

Step	Hyp	Ref	Expression
1		mul.1	. 2 ⊢ 𝐴 ∈ ℂ
2		mul.2	. 2 ⊢ 𝐵 ∈ ℂ
3		mul.3	. 2 ⊢ 𝐶 ∈ ℂ
4		mul4.4	. 2 ⊢ 𝐷 ∈ ℂ
5		mul4 11517	. 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷)))
6	1, 2, 3, 4, 5	mp4an 706	1 ⊢ ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐶) · (𝐵 · 𝐷))

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-8 2149  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-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454

This theorem is used by:  faclbnd4lem1  14478  bposlem8  27675  normlem1  31769  dpmul  33575  dpmul4  33576