| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zdiv | GIF version | ||
| Description: Two ways to express "𝑀 divides 𝑁. (Contributed by NM, 3-Oct-2008.) |
| Ref | Expression |
|---|---|
| zdiv | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnap0 9162 | . . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 # 0) | |
| 2 | 1 | adantr 276 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑀 # 0) |
| 3 | nncn 9141 | . . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℂ) | |
| 4 | zcn 9474 | . . 3 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 5 | zcn 9474 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ) | |
| 6 | divcanap3 8868 | . . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ ℂ ∧ 𝑀 ∈ ℂ ∧ 𝑀 # 0) → ((𝑀 · 𝑘) / 𝑀) = 𝑘) | |
| 7 | 6 | 3coml 1234 | . . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℂ ∧ 𝑀 # 0 ∧ 𝑘 ∈ ℂ) → ((𝑀 · 𝑘) / 𝑀) = 𝑘) |
| 8 | 7 | 3expa 1227 | . . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℂ) → ((𝑀 · 𝑘) / 𝑀) = 𝑘) |
| 9 | 5, 8 | sylan2 286 | . . . . . . . . . 10 ⊢ (((𝑀 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℤ) → ((𝑀 · 𝑘) / 𝑀) = 𝑘) |
| 10 | 9 | 3adantl2 1178 | . . . . . . . . 9 ⊢ (((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℤ) → ((𝑀 · 𝑘) / 𝑀) = 𝑘) |
| 11 | oveq1 6020 | . . . . . . . . 9 ⊢ ((𝑀 · 𝑘) = 𝑁 → ((𝑀 · 𝑘) / 𝑀) = (𝑁 / 𝑀)) | |
| 12 | 10, 11 | sylan9req 2283 | . . . . . . . 8 ⊢ ((((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℤ) ∧ (𝑀 · 𝑘) = 𝑁) → 𝑘 = (𝑁 / 𝑀)) |
| 13 | simplr 528 | . . . . . . . 8 ⊢ ((((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℤ) ∧ (𝑀 · 𝑘) = 𝑁) → 𝑘 ∈ ℤ) | |
| 14 | 12, 13 | eqeltrrd 2307 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) ∧ 𝑘 ∈ ℤ) ∧ (𝑀 · 𝑘) = 𝑁) → (𝑁 / 𝑀) ∈ ℤ) |
| 15 | 14 | exp31 364 | . . . . . 6 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) → (𝑘 ∈ ℤ → ((𝑀 · 𝑘) = 𝑁 → (𝑁 / 𝑀) ∈ ℤ))) |
| 16 | 15 | rexlimdv 2647 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 → (𝑁 / 𝑀) ∈ ℤ)) |
| 17 | divcanap2 8850 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ 𝑀 ∈ ℂ ∧ 𝑀 # 0) → (𝑀 · (𝑁 / 𝑀)) = 𝑁) | |
| 18 | 17 | 3com12 1231 | . . . . . 6 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) → (𝑀 · (𝑁 / 𝑀)) = 𝑁) |
| 19 | oveq2 6021 | . . . . . . . . 9 ⊢ (𝑘 = (𝑁 / 𝑀) → (𝑀 · 𝑘) = (𝑀 · (𝑁 / 𝑀))) | |
| 20 | 19 | eqeq1d 2238 | . . . . . . . 8 ⊢ (𝑘 = (𝑁 / 𝑀) → ((𝑀 · 𝑘) = 𝑁 ↔ (𝑀 · (𝑁 / 𝑀)) = 𝑁)) |
| 21 | 20 | rspcev 2908 | . . . . . . 7 ⊢ (((𝑁 / 𝑀) ∈ ℤ ∧ (𝑀 · (𝑁 / 𝑀)) = 𝑁) → ∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁) |
| 22 | 21 | expcom 116 | . . . . . 6 ⊢ ((𝑀 · (𝑁 / 𝑀)) = 𝑁 → ((𝑁 / 𝑀) ∈ ℤ → ∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁)) |
| 23 | 18, 22 | syl 14 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) → ((𝑁 / 𝑀) ∈ ℤ → ∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁)) |
| 24 | 16, 23 | impbid 129 | . . . 4 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ ∧ 𝑀 # 0) → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) |
| 25 | 24 | 3expia 1229 | . . 3 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 # 0 → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ))) |
| 26 | 3, 4, 25 | syl2an 289 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 # 0 → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ))) |
| 27 | 2, 26 | mpd 13 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (∃𝑘 ∈ ℤ (𝑀 · 𝑘) = 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 class class class wbr 4086 (class class class)co 6013 ℂcc 8020 0cc0 8022 · cmul 8027 # cap 8751 / cdiv 8842 ℕcn 9133 ℤcz 9469 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-id 4388 df-po 4391 df-iso 4392 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-iota 5284 df-fun 5326 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-z 9470 |
| This theorem is referenced by: addmodlteq 10650 |
| Copyright terms: Public domain | W3C validator |