| 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 12731 | . . . 4 ⊢ 0 ∈ ℤ | |
| 2 | divides 16453 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) |
| 4 | zcn 12725 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ) | |
| 5 | 4 | mul01d 11536 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑛 · 0) = 0) |
| 6 | eqtr2 2784 | . . . . . 6 ⊢ (((𝑛 · 0) = 𝑁 ∧ (𝑛 · 0) = 0) → 𝑁 = 0) | |
| 7 | 5, 6 | sylan2 605 | . . . . 5 ⊢ (((𝑛 · 0) = 𝑁 ∧ 𝑛 ∈ ℤ) → 𝑁 = 0) |
| 8 | 7 | ancoms 464 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 · 0) = 𝑁) → 𝑁 = 0) |
| 9 | 8 | rexlimiva 3159 | . . 3 ⊢ (∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁 → 𝑁 = 0) |
| 10 | 3, 9 | biimtrdi 256 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 → 𝑁 = 0)) |
| 11 | dvds0 16470 | . . . 4 ⊢ (0 ∈ ℤ → 0 ∥ 0) | |
| 12 | 1, 11 | ax-mp 5 | . . 3 ⊢ 0 ∥ 0 |
| 13 | breq2 5110 | . . 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 2147 ∃wrex 3090 class class class wbr 5106 (class class class)co 7443 0cc0 11227 · cmul 11232 ℤcz 12720 ∥ cdvds 16451 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-ltxr 11375 df-neg 11571 df-z 12721 df-dvds 16452 |
| This theorem is used by: fsumdvds 16507 dvdsabseq 16512 dfgcd2 16748 dvdssq 16771 rpdvds 16864 pcdvdstr 17083 pc2dvds 17086 mndodcongi 19787 oddvdsnn0 19788 oddvds 19791 odmulgeq 19801 odf1 19806 odf1o1 19816 gexdvds 19828 gexnnod 19832 torsubg 20098 ablsimpgfindlem1 20353 ablsimpgfindlem2 20354 znf1o 21887 dvdsexpnn0 43579 jm2.19 44193 nzss 45493 |
| Copyright terms: Public domain | W3C validator |