| 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 12685 | . . . 4 ⊢ 0 ∈ ℤ | |
| 2 | divides 16404 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) |
| 4 | zcn 12679 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ) | |
| 5 | 4 | mul01d 11490 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑛 · 0) = 0) |
| 6 | eqtr2 2782 | . . . . . 6 ⊢ (((𝑛 · 0) = 𝑁 ∧ (𝑛 · 0) = 0) → 𝑁 = 0) | |
| 7 | 5, 6 | sylan2 605 | . . . . 5 ⊢ (((𝑛 · 0) = 𝑁 ∧ 𝑛 ∈ ℤ) → 𝑁 = 0) |
| 8 | 7 | ancoms 464 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 · 0) = 𝑁) → 𝑁 = 0) |
| 9 | 8 | rexlimiva 3156 | . . 3 ⊢ (∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁 → 𝑁 = 0) |
| 10 | 3, 9 | biimtrdi 256 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 → 𝑁 = 0)) |
| 11 | dvds0 16421 | . . . 4 ⊢ (0 ∈ ℤ → 0 ∥ 0) | |
| 12 | 1, 11 | ax-mp 5 | . . 3 ⊢ 0 ∥ 0 |
| 13 | breq2 5107 | . . 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 1570 ∈ wcel 2145 ∃wrex 3087 class class class wbr 5103 (class class class)co 7412 0cc0 11181 · cmul 11186 ℤcz 12674 ∥ cdvds 16402 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-ltxr 11329 df-neg 11525 df-z 12675 df-dvds 16403 |
| This theorem is used by: fsumdvds 16458 dvdsabseq 16463 dfgcd2 16699 dvdssq 16722 rpdvds 16815 pcdvdstr 17034 pc2dvds 17037 mndodcongi 19737 oddvdsnn0 19738 oddvds 19741 odmulgeq 19751 odf1 19756 odf1o1 19766 gexdvds 19778 gexnnod 19782 torsubg 20048 ablsimpgfindlem1 20303 ablsimpgfindlem2 20304 znf1o 21837 dvdsexpnn0 43354 jm2.19 43953 nzss 45260 |
| Copyright terms: Public domain | W3C validator |