Theorem mul4r 11406

Description: Rearrangement of 4 factors: swap the right factors in the factors of a product of two products. (Contributed by AV, 4-Mar-2023.)

Assertion

Ref	Expression
mul4r	⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐷) · (𝐶 · 𝐵)))

Proof of Theorem mul4r

Step	Hyp	Ref	Expression
1		mulcom 11213	. . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 · 𝐷) = (𝐷 · 𝐶))
2	1	adantl 487	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐶 · 𝐷) = (𝐷 · 𝐶))
3	2	oveq2d 7432	. 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐵) · (𝐷 · 𝐶)))
4		mul4 11405	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐶 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐷 · 𝐶)) = ((𝐴 · 𝐷) · (𝐵 · 𝐶)))
5	4	ancom2s 663	. 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐷 · 𝐶)) = ((𝐴 · 𝐷) · (𝐵 · 𝐶)))
6		simplr 781	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → 𝐵 ∈ ℂ)
7		simprl 783	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → 𝐶 ∈ ℂ)
8	6, 7	mulcomd 11257	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝐵 · 𝐶) = (𝐶 · 𝐵))
9	8	oveq2d 7432	. 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐷) · (𝐵 · 𝐶)) = ((𝐴 · 𝐷) · (𝐶 · 𝐵)))
10	3, 5, 9	3eqtrd 2801	1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) · (𝐶 · 𝐷)) = ((𝐴 · 𝐷) · (𝐶 · 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  (class class class)co 7416  ℂcc 11125   · cmul 11132

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-mulcl 11189  ax-mulcom 11191  ax-mulass 11193

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-iota 6493  df-fv 6545  df-ov 7419

This theorem is used by:  bhmafibid1cn  15555  bhmafibid2cn  15556  2itscplem2  49696