| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdscmul | Structured version Visualization version GIF version | ||
| Description: Multiplication by a constant maintains the divides relation. Theorem 1.1(d) in [ApostolNT] p. 14 (multiplication property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| dvdscmul | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝐾 · 𝑀) ∥ (𝐾 · 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3simpc 1151 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 2 | zmulcl 12567 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ) | |
| 3 | 2 | 3adant3 1133 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ) |
| 4 | zmulcl 12567 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑁) ∈ ℤ) | |
| 5 | 4 | 3adant2 1132 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑁) ∈ ℤ) |
| 6 | 3, 5 | jca 511 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∈ ℤ ∧ (𝐾 · 𝑁) ∈ ℤ)) |
| 7 | simpr 484 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → 𝑥 ∈ ℤ) | |
| 8 | zcn 12520 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 9 | zcn 12520 | . . . . . . . . 9 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
| 10 | zcn 12520 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 11 | mul12 11302 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝐾 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) | |
| 12 | 8, 9, 10, 11 | syl3an 1161 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 13 | 12 | 3coml 1128 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 14 | 13 | 3expa 1119 | . . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 15 | 14 | 3adantl3 1170 | . . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 16 | oveq2 7368 | . . . . 5 ⊢ ((𝑥 · 𝑀) = 𝑁 → (𝐾 · (𝑥 · 𝑀)) = (𝐾 · 𝑁)) | |
| 17 | 15, 16 | sylan9eq 2792 | . . . 4 ⊢ ((((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) ∧ (𝑥 · 𝑀) = 𝑁) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · 𝑁)) |
| 18 | 17 | ex 412 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · 𝑁))) |
| 19 | 1, 6, 7, 18 | dvds1lem 16227 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝐾 · 𝑀) ∥ (𝐾 · 𝑁))) |
| 20 | 19 | 3coml 1128 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝐾 · 𝑀) ∥ (𝐾 · 𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 (class class class)co 7360 ℂcc 11027 · cmul 11034 ℤcz 12515 ∥ cdvds 16212 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-ltxr 11175 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-dvds 16213 |
| This theorem is referenced by: dvdscmulr 16244 mulgcd 16508 dvdsmulgcd 16516 rpmulgcd2 16616 pcprendvds2 16803 pcpremul 16805 prmreclem1 16878 sylow3lem4 19596 ablfacrp2 20035 mpodvdsmulf1o 27171 dvdsmulf1o 27173 jm2.27a 43451 jm2.27c 43453 |
| Copyright terms: Public domain | W3C validator |