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 12453 | . . . . . . . 8 ⊢ ℕ ⊆ ℤ | |
2 | zcn 12437 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
3 | 2 | abscld 15255 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℝ) |
4 | arch 12343 | . . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ ℝ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) | |
5 | 3, 4 | syl 17 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) |
6 | ssrexv 4009 | . . . . . . . 8 ⊢ (ℕ ⊆ ℤ → (∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥 → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥)) | |
7 | 1, 5, 6 | mpsyl 68 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥) |
8 | zre 12436 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ) | |
9 | ltnle 11167 | . . . . . . . . . 10 ⊢ (((abs‘𝑁) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) | |
10 | 3, 8, 9 | syl2an 596 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) |
11 | 10 | rexbidva 3171 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁))) |
12 | rexnal 3101 | . . . . . . . 8 ⊢ (∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁) ↔ ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) | |
13 | 11, 12 | bitrdi 286 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
14 | 7, 13 | mpbid 231 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
15 | 14 | adantl 482 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁)) |
16 | ralim 3087 | . . . . . . 7 ⊢ (∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)) → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) | |
17 | dvdsleabs 16127 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) | |
18 | 17 | 3expb 1120 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
19 | 18 | expcom 414 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∈ ℤ → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)))) |
20 | 19 | ralrimiv 3140 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
21 | 16, 20 | syl11 33 | . . . . . 6 ⊢ (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
22 | 21 | expdimp 453 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (𝑁 ≠ 0 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
23 | 15, 22 | mtod 197 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ 𝑁 ≠ 0) |
24 | nne 2945 | . . . 4 ⊢ (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0) | |
25 | 23, 24 | sylib 217 | . . 3 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → 𝑁 = 0) |
26 | 25 | expcom 414 | . 2 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → 𝑁 = 0)) |
27 | dvds0 16088 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∥ 0) | |
28 | breq2 5107 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∥ 𝑁 ↔ 𝑥 ∥ 0)) | |
29 | 27, 28 | syl5ibr 245 | . . 3 ⊢ (𝑁 = 0 → (𝑥 ∈ ℤ → 𝑥 ∥ 𝑁)) |
30 | 29 | ralrimiv 3140 | . 2 ⊢ (𝑁 = 0 → ∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁) |
31 | 26, 30 | impbid1 224 | 1 ⊢ (𝑁 ∈ ℤ → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ↔ 𝑁 = 0)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ⊆ wss 3908 class class class wbr 5103 ‘cfv 6491 ℝcr 10983 0cc0 10984 < clt 11122 ≤ cle 11123 ℕcn 12086 ℤcz 12432 abscabs 15052 ∥ cdvds 16070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7662 ax-cnex 11040 ax-resscn 11041 ax-1cn 11042 ax-icn 11043 ax-addcl 11044 ax-addrcl 11045 ax-mulcl 11046 ax-mulrcl 11047 ax-mulcom 11048 ax-addass 11049 ax-mulass 11050 ax-distr 11051 ax-i2m1 11052 ax-1ne0 11053 ax-1rid 11054 ax-rnegex 11055 ax-rrecex 11056 ax-cnre 11057 ax-pre-lttri 11058 ax-pre-lttrn 11059 ax-pre-ltadd 11060 ax-pre-mulgt0 11061 ax-pre-sup 11062 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5528 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5585 df-we 5587 df-xp 5636 df-rel 5637 df-cnv 5638 df-co 5639 df-dm 5640 df-rn 5641 df-res 5642 df-ima 5643 df-pred 6249 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6443 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7305 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7793 df-2nd 7912 df-frecs 8179 df-wrecs 8210 df-recs 8284 df-rdg 8323 df-er 8581 df-en 8817 df-dom 8818 df-sdom 8819 df-sup 9311 df-pnf 11124 df-mnf 11125 df-xr 11126 df-ltxr 11127 df-le 11128 df-sub 11320 df-neg 11321 df-div 11746 df-nn 12087 df-2 12149 df-3 12150 df-n0 12347 df-z 12433 df-uz 12696 df-rp 12844 df-seq 13835 df-exp 13896 df-cj 14917 df-re 14918 df-im 14919 df-sqrt 15053 df-abs 15054 df-dvds 16071 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |