![]() |
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 9337 | . . . . . . . 8 ⊢ ℕ ⊆ ℤ | |
2 | zcn 9325 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
3 | 2 | abscld 11328 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℝ) |
4 | arch 9240 | . . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ ℝ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) | |
5 | 3, 4 | syl 14 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) |
6 | ssrexv 3245 | . . . . . . . 8 ⊢ (ℕ ⊆ ℤ → (∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥 → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥)) | |
7 | 1, 5, 6 | mpsyl 65 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥) |
8 | zabscl 11233 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℤ) | |
9 | zltnle 9366 | . . . . . . . . . 10 ⊢ (((abs‘𝑁) ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) | |
10 | 8, 9 | sylan 283 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) |
11 | 10 | rexbidva 2491 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁))) |
12 | rexnalim 2483 | . . . . . . . 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 2553 | . . . . . . 7 ⊢ (∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)) → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) | |
17 | dvdsleabs 11990 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) | |
18 | 17 | 3expb 1206 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
19 | 18 | expcom 116 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∈ ℤ → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)))) |
20 | 19 | ralrimiv 2566 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
21 | 16, 20 | syl11 31 | . . . . . 6 ⊢ (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
22 | 21 | expdimp 259 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (𝑁 ≠ 0 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
23 | 15, 22 | mtod 664 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ 𝑁 ≠ 0) |
24 | 0z 9331 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
25 | zdceq 9395 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑁 = 0) | |
26 | 24, 25 | mpan2 425 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → DECID 𝑁 = 0) |
27 | nnedc 2369 | . . . . . 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 11952 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∥ 0) | |
33 | breq2 4034 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∥ 𝑁 ↔ 𝑥 ∥ 0)) | |
34 | 32, 33 | imbitrrid 156 | . . 3 ⊢ (𝑁 = 0 → (𝑥 ∈ ℤ → 𝑥 ∥ 𝑁)) |
35 | 34 | ralrimiv 2566 | . 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 835 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 ∀wral 2472 ∃wrex 2473 ⊆ wss 3154 class class class wbr 4030 ‘cfv 5255 ℝcr 7873 0cc0 7874 < clt 8056 ≤ cle 8057 ℕcn 8984 ℤcz 9320 abscabs 11144 ∥ cdvds 11933 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 ax-caucvg 7994 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-n0 9244 df-z 9321 df-uz 9596 df-q 9688 df-rp 9723 df-seqfrec 10522 df-exp 10613 df-cj 10989 df-re 10990 df-im 10991 df-rsqrt 11145 df-abs 11146 df-dvds 11934 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |