Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > muldvds1 | GIF version |
Description: If a product divides an integer, so does one of its factors. (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
muldvds1 | ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∥ 𝑁 → 𝐾 ∥ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zmulcl 9235 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ) | |
2 | 1 | anim1i 338 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
3 | 2 | 3impa 1183 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∈ ℤ ∧ 𝑁 ∈ ℤ)) |
4 | 3simpb 984 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
5 | zmulcl 9235 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑥 · 𝑀) ∈ ℤ) | |
6 | 5 | ancoms 266 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝑀) ∈ ℤ) |
7 | 6 | 3ad2antl2 1149 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝑀) ∈ ℤ) |
8 | zcn 9187 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
9 | zcn 9187 | . . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
10 | zcn 9187 | . . . . . . . 8 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
11 | mulass 7875 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝐾 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑥 · 𝐾) · 𝑀) = (𝑥 · (𝐾 · 𝑀))) | |
12 | mul32 8019 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝐾 ∈ ℂ ∧ 𝑀 ∈ ℂ) → ((𝑥 · 𝐾) · 𝑀) = ((𝑥 · 𝑀) · 𝐾)) | |
13 | 11, 12 | eqtr3d 2199 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝐾 ∈ ℂ ∧ 𝑀 ∈ ℂ) → (𝑥 · (𝐾 · 𝑀)) = ((𝑥 · 𝑀) · 𝐾)) |
14 | 8, 9, 10, 13 | syl3an 1269 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = ((𝑥 · 𝑀) · 𝐾)) |
15 | 14 | 3coml 1199 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = ((𝑥 · 𝑀) · 𝐾)) |
16 | 15 | 3expa 1192 | . . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = ((𝑥 · 𝑀) · 𝐾)) |
17 | 16 | 3adantl3 1144 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → (𝑥 · (𝐾 · 𝑀)) = ((𝑥 · 𝑀) · 𝐾)) |
18 | 17 | eqeq1d 2173 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · (𝐾 · 𝑀)) = 𝑁 ↔ ((𝑥 · 𝑀) · 𝐾) = 𝑁)) |
19 | 18 | biimpd 143 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ ℤ) → ((𝑥 · (𝐾 · 𝑀)) = 𝑁 → ((𝑥 · 𝑀) · 𝐾) = 𝑁)) |
20 | 3, 4, 7, 19 | dvds1lem 11728 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) ∥ 𝑁 → 𝐾 ∥ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 967 = wceq 1342 ∈ wcel 2135 class class class wbr 3976 (class class class)co 5836 ℂcc 7742 · cmul 7749 ℤcz 9182 ∥ cdvds 11713 |
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 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-mulrcl 7843 ax-addcom 7844 ax-mulcom 7845 ax-addass 7846 ax-mulass 7847 ax-distr 7848 ax-i2m1 7849 ax-1rid 7851 ax-0id 7852 ax-rnegex 7853 ax-cnre 7855 |
This theorem depends on definitions: df-bi 116 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-br 3977 df-opab 4038 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-iota 5147 df-fun 5184 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-sub 8062 df-neg 8063 df-inn 8849 df-n0 9106 df-z 9183 df-dvds 11714 |
This theorem is referenced by: pw2dvdseulemle 12078 |
Copyright terms: Public domain | W3C validator |