| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0dvds | Structured version Visualization version GIF version | ||
| Description: Only 0 is divisible by 0. Theorem 1.1(h) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| 0dvds | ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ 𝑁 = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0z 12707 | . . . 4 ⊢ 0 ∈ ℤ | |
| 2 | divides 16429 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) |
| 4 | zcn 12701 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ) | |
| 5 | 4 | mul01d 11512 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑛 · 0) = 0) |
| 6 | eqtr2 2781 | . . . . . 6 ⊢ (((𝑛 · 0) = 𝑁 ∧ (𝑛 · 0) = 0) → 𝑁 = 0) | |
| 7 | 5, 6 | sylan2 605 | . . . . 5 ⊢ (((𝑛 · 0) = 𝑁 ∧ 𝑛 ∈ ℤ) → 𝑁 = 0) |
| 8 | 7 | ancoms 464 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 · 0) = 𝑁) → 𝑁 = 0) |
| 9 | 8 | rexlimiva 3155 | . . 3 ⊢ (∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁 → 𝑁 = 0) |
| 10 | 3, 9 | biimtrdi 256 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 → 𝑁 = 0)) |
| 11 | dvds0 16446 | . . . 4 ⊢ (0 ∈ ℤ → 0 ∥ 0) | |
| 12 | 1, 11 | ax-mp 5 | . . 3 ⊢ 0 ∥ 0 |
| 13 | breq2 5106 | . . 3 ⊢ (𝑁 = 0 → (0 ∥ 𝑁 ↔ 0 ∥ 0)) | |
| 14 | 12, 13 | mpbiri 261 | . 2 ⊢ (𝑁 = 0 → 0 ∥ 𝑁) |
| 15 | 10, 14 | impbid1 228 | 1 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ 𝑁 = 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 class class class wbr 5102 (class class class)co 7420 0cc0 11203 · cmul 11208 ℤcz 12696 ∥ cdvds 16427 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-ltxr 11351 df-neg 11547 df-z 12697 df-dvds 16428 |
| This theorem is used by: fsumdvds 16483 dvdsabseq 16488 dfgcd2 16724 dvdssq 16747 rpdvds 16840 pcdvdstr 17059 pc2dvds 17062 mndodcongi 19762 oddvdsnn0 19763 oddvds 19766 odmulgeq 19776 odf1 19781 odf1o1 19791 gexdvds 19803 gexnnod 19807 torsubg 20073 ablsimpgfindlem1 20328 ablsimpgfindlem2 20329 znf1o 21862 dvdsexpnn0 43479 jm2.19 44093 nzss 45394 |
| Copyright terms: Public domain | W3C validator |