Metamath Proof Explorer


Theorem divmulasscom

Description: An associative/commutative law for division and multiplication. (Contributed by AV, 10-Jul-2021)

Ref Expression
Assertion divmulasscom ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ B D ⁢ C = B ⁢ A ⁢ C D

Proof

Step Hyp Ref Expression
1 divmulass ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ B D ⁢ C = A ⁢ B ⁢ C D
2 mulcom ⊢ A ∈ ℂ ∧ B ∈ ℂ → A ⁢ B = B ⁢ A
3 2 3adant3 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ → A ⁢ B = B ⁢ A
4 3 adantr ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ B = B ⁢ A
5 4 oveq1d ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ B ⁢ C D = B ⁢ A ⁢ C D
6 simpl2 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → B ∈ ℂ
7 simpl1 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ∈ ℂ
8 simp3 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ → C ∈ ℂ
9 8 anim1i ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0
10 3anass ⊢ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 ↔ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0
11 9 10 sylibr ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0
12 divcl ⊢ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → C D ∈ ℂ
13 11 12 syl ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → C D ∈ ℂ
14 6 7 13 mulassd ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → B ⁢ A ⁢ C D = B ⁢ A ⁢ C D
15 8 adantr ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → C ∈ ℂ
16 simpr ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → D ∈ ℂ ∧ D ≠ 0
17 divass ⊢ A ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ C D = A ⁢ C D
18 7 15 16 17 syl3anc ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ C D = A ⁢ C D
19 18 eqcomd ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ C D = A ⁢ C D
20 19 oveq2d ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → B ⁢ A ⁢ C D = B ⁢ A ⁢ C D
21 14 20 eqtrd ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → B ⁢ A ⁢ C D = B ⁢ A ⁢ C D
22 1 5 21 3eqtrd ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 0 → A ⁢ B D ⁢ C = B ⁢ A ⁢ C D