| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvdscmul | 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 999 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
| 2 | zmulcl 9441 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ) | |
| 3 | 2 | 3adant3 1020 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ) |
| 4 | zmulcl 9441 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑁) ∈ ℤ) | |
| 5 | 4 | 3adant2 1019 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 · 𝑁) ∈ ℤ) |
| 6 | 3, 5 | jca 306 | . . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∈ ℤ ∧ (𝐾 · 𝑁) ∈ ℤ)) |
| 7 | simpr 110 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → 𝑥 ∈ ℤ) | |
| 8 | zcn 9392 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 9 | zcn 9392 | . . . . . . . . 9 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
| 10 | zcn 9392 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 11 | mul12 8216 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝐾 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) | |
| 12 | 8, 9, 10, 11 | syl3an 1292 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 13 | 12 | 3coml 1213 | . . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 14 | 13 | 3expa 1206 | . . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 15 | 14 | 3adantl3 1158 | . . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · (𝑥 · 𝑀))) |
| 16 | oveq2 5964 | . . . . 5 ⊢ ((𝑥 · 𝑀) = 𝑁 → (𝐾 · (𝑥 · 𝑀)) = (𝐾 · 𝑁)) | |
| 17 | 15, 16 | sylan9eq 2259 | . . . 4 ⊢ ((((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) ∧ (𝑥 · 𝑀) = 𝑁) → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · 𝑁)) |
| 18 | 17 | ex 115 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · 𝑀) = 𝑁 → (𝑥 · (𝐾 · 𝑀)) = (𝐾 · 𝑁))) |
| 19 | 1, 6, 7, 18 | dvds1lem 12183 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝐾 · 𝑀) ∥ (𝐾 · 𝑁))) |
| 20 | 19 | 3coml 1213 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑀 ∥ 𝑁 → (𝐾 · 𝑀) ∥ (𝐾 · 𝑁))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 class class class wbr 4050 (class class class)co 5956 ℂcc 7938 · cmul 7945 ℤcz 9387 ∥ cdvds 12168 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 ax-setind 4592 ax-cnex 8031 ax-resscn 8032 ax-1cn 8033 ax-1re 8034 ax-icn 8035 ax-addcl 8036 ax-addrcl 8037 ax-mulcl 8038 ax-mulrcl 8039 ax-addcom 8040 ax-mulcom 8041 ax-addass 8042 ax-mulass 8043 ax-distr 8044 ax-i2m1 8045 ax-1rid 8047 ax-0id 8048 ax-rnegex 8049 ax-cnre 8051 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 df-uni 3856 df-int 3891 df-br 4051 df-opab 4113 df-id 4347 df-xp 4688 df-rel 4689 df-cnv 4690 df-co 4691 df-dm 4692 df-iota 5240 df-fun 5281 df-fv 5287 df-riota 5911 df-ov 5959 df-oprab 5960 df-mpo 5961 df-sub 8260 df-neg 8261 df-inn 9052 df-n0 9311 df-z 9388 df-dvds 12169 |
| This theorem is referenced by: dvdscmulr 12201 mulgcd 12407 dvdsmulgcd 12416 rpmulgcd2 12487 pcprendvds2 12684 pcpremul 12686 mpodvdsmulf1o 15532 |
| Copyright terms: Public domain | W3C validator |