Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > divmulasscomap | GIF version |
Description: An associative/commutative law for division and multiplication. (Contributed by Jim Kingdon, 24-Jan-2022.) |
Ref | Expression |
---|---|
divmulasscomap | ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · (𝐵 / 𝐷)) · 𝐶) = (𝐵 · ((𝐴 · 𝐶) / 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | divmulassap 8455 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · (𝐵 / 𝐷)) · 𝐶) = ((𝐴 · 𝐵) · (𝐶 / 𝐷))) | |
2 | mulcom 7749 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) | |
3 | 2 | 3adant3 1001 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) |
4 | 3 | adantr 274 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) |
5 | 4 | oveq1d 5789 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · 𝐵) · (𝐶 / 𝐷)) = ((𝐵 · 𝐴) · (𝐶 / 𝐷))) |
6 | simpl2 985 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → 𝐵 ∈ ℂ) | |
7 | simpl1 984 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → 𝐴 ∈ ℂ) | |
8 | simp3 983 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
9 | 8 | anim1i 338 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐶 ∈ ℂ ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) |
10 | 3anass 966 | . . . . . 6 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 # 0) ↔ (𝐶 ∈ ℂ ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) | |
11 | 9, 10 | sylibr 133 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 # 0)) |
12 | divclap 8438 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 # 0) → (𝐶 / 𝐷) ∈ ℂ) | |
13 | 11, 12 | syl 14 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐶 / 𝐷) ∈ ℂ) |
14 | 6, 7, 13 | mulassd 7789 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐵 · 𝐴) · (𝐶 / 𝐷)) = (𝐵 · (𝐴 · (𝐶 / 𝐷)))) |
15 | 8 | adantr 274 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → 𝐶 ∈ ℂ) |
16 | simpr 109 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐷 ∈ ℂ ∧ 𝐷 # 0)) | |
17 | divassap 8450 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · 𝐶) / 𝐷) = (𝐴 · (𝐶 / 𝐷))) | |
18 | 7, 15, 16, 17 | syl3anc 1216 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · 𝐶) / 𝐷) = (𝐴 · (𝐶 / 𝐷))) |
19 | 18 | eqcomd 2145 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐴 · (𝐶 / 𝐷)) = ((𝐴 · 𝐶) / 𝐷)) |
20 | 19 | oveq2d 5790 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → (𝐵 · (𝐴 · (𝐶 / 𝐷))) = (𝐵 · ((𝐴 · 𝐶) / 𝐷))) |
21 | 14, 20 | eqtrd 2172 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐵 · 𝐴) · (𝐶 / 𝐷)) = (𝐵 · ((𝐴 · 𝐶) / 𝐷))) |
22 | 1, 5, 21 | 3eqtrd 2176 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · (𝐵 / 𝐷)) · 𝐶) = (𝐵 · ((𝐴 · 𝐶) / 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 962 = wceq 1331 ∈ wcel 1480 class class class wbr 3929 (class class class)co 5774 ℂcc 7618 0cc0 7620 · cmul 7625 # cap 8343 / cdiv 8432 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-id 4215 df-po 4218 df-iso 4219 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 df-div 8433 |
This theorem is referenced by: cncongr2 11785 |
Copyright terms: Public domain | W3C validator |