| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > alzdvds | Structured version Visualization version GIF version | ||
| Description: Only 0 is divisible by all integers. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| alzdvds | ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ↔ 𝑁 = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnssz 12612 | . . . . . . . 8 ⊢ ℕ ⊆ ℤ | |
| 2 | zcn 12595 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 3 | 2 | abscld 15489 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℝ) |
| 4 | arch 12500 | . . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ ℝ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) | |
| 5 | 3, 4 | syl 18 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) |
| 6 | ssrexv 4015 | . . . . . . . 8 ⊢ (ℕ ⊆ ℤ → (∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥 → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥)) | |
| 7 | 1, 5, 6 | mpsyl 69 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥) |
| 8 | zre 12594 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
| 9 | ltnle 11288 | . . . . . . . . . 10 ⊢ (((abs‘𝑁) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) | |
| 10 | 3, 8, 9 | syl2an 607 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 11 | 10 | rexbidva 3193 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 12 | rexnal 3123 | . . . . . . . 8 ⊢ (∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁) ↔ ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) | |
| 13 | 11, 12 | bitrdi 290 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 14 | 7, 13 | mpbid 235 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
| 15 | 14 | adantl 486 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
| 16 | ralim 3111 | . . . . . . 7 ⊢ (∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)) → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) | |
| 17 | dvdsleabs 16368 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) | |
| 18 | 17 | 3expb 1136 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 19 | 18 | expcom 418 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∈ ℤ → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)))) |
| 20 | 19 | ralrimiv 3162 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 21 | 16, 20 | syl11 34 | . . . . . 6 ⊢ (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 22 | 21 | expdimp 457 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (𝑁 ≠ 0 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 23 | 15, 22 | mtod 201 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ 𝑁 ≠ 0) |
| 24 | nne 2968 | . . . 4 ⊢ (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0) | |
| 25 | 23, 24 | sylib 221 | . . 3 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → 𝑁 = 0) |
| 26 | 25 | expcom 418 | . 2 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → 𝑁 = 0)) |
| 27 | dvds0 16328 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∥ 0) | |
| 28 | breq2 5117 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∥ 𝑁 ↔ 𝑥 ∥ 0)) | |
| 29 | 27, 28 | imbitrrid 249 | . . 3 ⊢ (𝑁 = 0 → (𝑥 ∈ ℤ → 𝑥 ∥ 𝑁)) |
| 30 | 29 | ralrimiv 3162 | . 2 ⊢ (𝑁 = 0 → ∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁) |
| 31 | 26, 30 | impbid1 228 | 1 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ↔ 𝑁 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ⊆ wss 3913 class class class wbr 5113 ‘cfv 6537 ℝcr 11098 0cc0 11099 < clt 11242 ≤ cle 11243 ℕcn 12232 ℤcz 12590 abscabs 15284 ∥ cdvds 16309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9401 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-seq 14037 df-exp 14097 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-dvds 16310 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |