| 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 9501 | . . . . . . . 8 ⊢ ℕ ⊆ ℤ | |
| 2 | zcn 9489 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 3 | 2 | abscld 11764 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℝ) |
| 4 | arch 9404 | . . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ ℝ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) | |
| 5 | 3, 4 | syl 14 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥) |
| 6 | ssrexv 3291 | . . . . . . . 8 ⊢ (ℕ ⊆ ℤ → (∃𝑥 ∈ ℕ (abs‘𝑁) < 𝑥 → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥)) | |
| 7 | 1, 5, 6 | mpsyl 65 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥) |
| 8 | zabscl 11669 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℤ) | |
| 9 | zltnle 9530 | . . . . . . . . . 10 ⊢ (((abs‘𝑁) ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) | |
| 10 | 8, 9 | sylan 283 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → ((abs‘𝑁) < 𝑥 ↔ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 11 | 10 | rexbidva 2528 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (∃𝑥 ∈ ℤ (abs‘𝑁) < 𝑥 ↔ ∃𝑥 ∈ ℤ ¬ 𝑥 ≤ (abs‘𝑁))) |
| 12 | rexnalim 2520 | . . . . . . . 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 2590 | . . . . . . 7 ⊢ (∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)) → (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) | |
| 17 | dvdsleabs 12429 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) | |
| 18 | 17 | 3expb 1230 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 19 | 18 | expcom 116 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (𝑥 ∈ ℤ → (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁)))) |
| 20 | 19 | ralrimiv 2603 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ (𝑥 ∥ 𝑁 → 𝑥 ≤ (abs‘𝑁))) |
| 21 | 16, 20 | syl11 31 | . . . . . 6 ⊢ (∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 → ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 22 | 21 | expdimp 259 | . . . . 5 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → (𝑁 ≠ 0 → ∀𝑥 ∈ ℤ 𝑥 ≤ (abs‘𝑁))) |
| 23 | 15, 22 | mtod 669 | . . . 4 ⊢ ((∀𝑥 ∈ ℤ 𝑥 ∥ 𝑁 ∧ 𝑁 ∈ ℤ) → ¬ 𝑁 ≠ 0) |
| 24 | 0z 9495 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 25 | zdceq 9560 | . . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑁 = 0) | |
| 26 | 24, 25 | mpan2 425 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → DECID 𝑁 = 0) |
| 27 | nnedc 2406 | . . . . . 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 12390 | . . . 4 ⊢ (𝑥 ∈ ℤ → 𝑥 ∥ 0) | |
| 33 | breq2 4093 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∥ 𝑁 ↔ 𝑥 ∥ 0)) | |
| 34 | 32, 33 | imbitrrid 156 | . . 3 ⊢ (𝑁 = 0 → (𝑥 ∈ ℤ → 𝑥 ∥ 𝑁)) |
| 35 | 34 | ralrimiv 2603 | . 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 841 = wceq 1397 ∈ wcel 2201 ≠ wne 2401 ∀wral 2509 ∃wrex 2510 ⊆ wss 3199 class class class wbr 4089 ‘cfv 5328 ℝcr 8036 0cc0 8037 < clt 8219 ≤ cle 8220 ℕcn 9148 ℤcz 9484 abscabs 11580 ∥ cdvds 12371 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 ax-arch 8156 ax-caucvg 8157 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-po 4395 df-iso 4396 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-n0 9408 df-z 9485 df-uz 9761 df-q 9859 df-rp 9894 df-seqfrec 10716 df-exp 10807 df-cj 11425 df-re 11426 df-im 11427 df-rsqrt 11581 df-abs 11582 df-dvds 12372 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |