| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > alzdvds | 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 9489 | . . . . . . . 8 ⊢ ℕ ⊆ ℤ | |
| 2 | zcn 9477 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 3 | 2 | abscld 11735 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℝ) |
| 4 | arch 9392 | . . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ ℝ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) | |
| 5 | 3, 4 | syl 14 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) |
| 6 | ssrexv 3290 | . . . . . . . 8 ⊢ (ℕ ⊆ ℤ → (∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥 → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥)) | |
| 7 | 1, 5, 6 | mpsyl 65 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥) |
| 8 | zabscl 11640 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℤ) | |
| 9 | zltnle 9518 | . . . . . . . . . 10 ⊢ (((abs‘𝑁) ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) | |
| 10 | 8, 9 | sylan 283 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 11 | 10 | rexbidva 2527 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 12 | rexnalim 2519 | . . . . . . . 8 ⊢ (∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁) → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) | |
| 13 | 11, 12 | biimtrdi 163 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 14 | 7, 13 | mpd 13 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
| 15 | 14 | adantl 277 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
| 16 | ralim 2589 | . . . . . . 7 ⊢ (∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)) → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) | |
| 17 | dvdsleabs 12399 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) | |
| 18 | 17 | 3expb 1228 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 19 | 18 | expcom 116 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∈ ℤ → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)))) |
| 20 | 19 | ralrimiv 2602 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 21 | 16, 20 | syl11 31 | . . . . . 6 ⊢ (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 22 | 21 | expdimp 259 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (𝑁 ≠ 0 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 23 | 15, 22 | mtod 667 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ 𝑁 ≠ 0) |
| 24 | 0z 9483 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 25 | zdceq 9548 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑁 = 0) | |
| 26 | 24, 25 | mpan2 425 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → DECID 𝑁 = 0) |
| 27 | nnedc 2405 | . . . . . 6 ⊢ (DECID 𝑁 = 0 → (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0)) | |
| 28 | 26, 27 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0)) |
| 29 | 28 | adantl 277 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0)) |
| 30 | 23, 29 | mpbid 147 | . . 3 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → 𝑁 = 0) |
| 31 | 30 | expcom 116 | . 2 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → 𝑁 = 0)) |
| 32 | dvds0 12360 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∥ 0) | |
| 33 | breq2 4090 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∥ 𝑁 ↔ 𝑥 ∥ 0)) | |
| 34 | 32, 33 | imbitrrid 156 | . . 3 ⊢ (𝑁 = 0 → (𝑥 ∈ ℤ → 𝑥 ∥ 𝑁)) |
| 35 | 34 | ralrimiv 2602 | . 2 ⊢ (𝑁 = 0 → ∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁) |
| 36 | 31, 35 | impbid1 142 | 1 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ↔ 𝑁 = 0)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 839 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ∀wral 2508 ∃wrex 2509 ⊆ wss 3198 class class class wbr 4086 ‘cfv 5324 ℝcr 8024 0cc0 8025 < clt 8207 ≤ cle 8208 ℕcn 9136 ℤcz 9472 abscabs 11551 ∥ cdvds 12341 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-mulrcl 8124 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-precex 8135 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 ax-pre-mulgt0 8142 ax-pre-mulext 8143 ax-arch 8144 ax-caucvg 8145 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-reap 8748 df-ap 8755 df-div 8846 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-n0 9396 df-z 9473 df-uz 9749 df-q 9847 df-rp 9882 df-seqfrec 10703 df-exp 10794 df-cj 11396 df-re 11397 df-im 11398 df-rsqrt 11552 df-abs 11553 df-dvds 12342 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |