| 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 12620 | . . . 4 ⊢ 0 ∈ ℤ | |
| 2 | divides 16337 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁)) |
| 4 | zcn 12614 | . . . . . . 7 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ) | |
| 5 | 4 | mul01d 11427 | . . . . . 6 ⊢ (𝑛 ∈ ℤ → (𝑛 · 0) = 0) |
| 6 | eqtr2 2787 | . . . . . 6 ⊢ (((𝑛 · 0) = 𝑁 ∧ (𝑛 · 0) = 0) → 𝑁 = 0) | |
| 7 | 5, 6 | sylan2 605 | . . . . 5 ⊢ (((𝑛 · 0) = 𝑁 ∧ 𝑛 ∈ ℤ) → 𝑁 = 0) |
| 8 | 7 | ancoms 464 | . . . 4 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 · 0) = 𝑁) → 𝑁 = 0) |
| 9 | 8 | rexlimiva 3161 | . . 3 ⊢ (∃𝑛 ∈ ℤ (𝑛 · 0) = 𝑁 → 𝑁 = 0) |
| 10 | 3, 9 | biimtrdi 256 | . 2 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 → 𝑁 = 0)) |
| 11 | dvds0 16354 | . . . 4 ⊢ (0 ∈ ℤ → 0 ∥ 0) | |
| 12 | 1, 11 | ax-mp 5 | . . 3 ⊢ 0 ∥ 0 |
| 13 | breq2 5118 | . . 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 2146 ∃wrex 3092 class class class wbr 5114 (class class class)co 7423 0cc0 11118 · cmul 11123 ℤcz 12609 ∥ cdvds 16335 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-po 5574 df-so 5575 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-ltxr 11266 df-neg 11462 df-z 12610 df-dvds 16336 |
| This theorem is used by: fsumdvds 16391 dvdsabseq 16396 dfgcd2 16629 dvdssq 16650 rpdvds 16743 pcdvdstr 16961 pc2dvds 16964 mndodcongi 19644 oddvdsnn0 19645 oddvds 19648 odmulgeq 19658 odf1 19663 odf1o1 19673 gexdvds 19685 gexnnod 19689 torsubg 19955 ablsimpgfindlem1 20210 ablsimpgfindlem2 20211 znf1o 21738 dvdsexpnn0 43136 jm2.19 43761 nzss 45068 |
| Copyright terms: Public domain | W3C validator |