| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prmdvdsfz | Structured version Visualization version GIF version | ||
| Description: Each integer greater than 1 and less than or equal to a fixed number is divisible by a prime less than or equal to this fixed number. (Contributed by AV, 15-Aug-2020.) |
| Ref | Expression |
|---|---|
| prmdvdsfz | ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ∃𝑝 ∈ ℙ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzuz 13519 | . . . 4 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ (ℤ≥‘2)) | |
| 2 | 1 | adantl 485 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → 𝐼 ∈ (ℤ≥‘2)) |
| 3 | exprmfct 16730 | . . 3 ⊢ (𝐼 ∈ (ℤ≥‘2) → ∃𝑝 ∈ ℙ 𝑝 ∥ 𝐼) | |
| 4 | 2, 3 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ∃𝑝 ∈ ℙ 𝑝 ∥ 𝐼) |
| 5 | prmz 16700 | . . . . . 6 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ) | |
| 6 | eluz2nn 12883 | . . . . . . . 8 ⊢ (𝐼 ∈ (ℤ≥‘2) → 𝐼 ∈ ℕ) | |
| 7 | 1, 6 | syl 17 | . . . . . . 7 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ ℕ) |
| 8 | 7 | adantl 485 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → 𝐼 ∈ ℕ) |
| 9 | dvdsle 16335 | . . . . . 6 ⊢ ((𝑝 ∈ ℤ ∧ 𝐼 ∈ ℕ) → (𝑝 ∥ 𝐼 → 𝑝 ≤ 𝐼)) | |
| 10 | 5, 8, 9 | syl2anr 606 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐼 → 𝑝 ≤ 𝐼)) |
| 11 | elfzle2 13527 | . . . . . . 7 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ≤ 𝑁) | |
| 12 | 11 | ad2antlr 737 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → 𝐼 ≤ 𝑁) |
| 13 | 5 | zred 12671 | . . . . . . . 8 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℝ) |
| 14 | 13 | adantl 485 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℝ) |
| 15 | elfzelz 13523 | . . . . . . . . 9 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ ℤ) | |
| 16 | 15 | zred 12671 | . . . . . . . 8 ⊢ (𝐼 ∈ (2...𝑁) → 𝐼 ∈ ℝ) |
| 17 | 16 | ad2antlr 737 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → 𝐼 ∈ ℝ) |
| 18 | nnre 12211 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
| 19 | 18 | ad2antrr 736 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → 𝑁 ∈ ℝ) |
| 20 | letr 11271 | . . . . . . 7 ⊢ ((𝑝 ∈ ℝ ∧ 𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑝 ≤ 𝐼 ∧ 𝐼 ≤ 𝑁) → 𝑝 ≤ 𝑁)) | |
| 21 | 14, 17, 19, 20 | syl3anc 1389 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → ((𝑝 ≤ 𝐼 ∧ 𝐼 ≤ 𝑁) → 𝑝 ≤ 𝑁)) |
| 22 | 12, 21 | mpan2d 704 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → (𝑝 ≤ 𝐼 → 𝑝 ≤ 𝑁)) |
| 23 | 10, 22 | syld 47 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐼 → 𝑝 ≤ 𝑁)) |
| 24 | 23 | ancrd 559 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐼 → (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼))) |
| 25 | 24 | reximdva 3174 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → (∃𝑝 ∈ ℙ 𝑝 ∥ 𝐼 → ∃𝑝 ∈ ℙ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼))) |
| 26 | 4, 25 | mpd 15 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (2...𝑁)) → ∃𝑝 ∈ ℙ (𝑝 ≤ 𝑁 ∧ 𝑝 ∥ 𝐼)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2141 ∃wrex 3085 class class class wbr 5097 ‘cfv 6516 (class class class)co 7391 ℝcr 11066 ≤ cle 11211 ℕcn 12204 2c2 12266 ℤcz 12562 ℤ≥cuz 12833 ...cfz 13506 ∥ cdvds 16277 ℙcprime 16696 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-3 12275 df-n0 12476 df-z 12563 df-uz 12834 df-rp 12988 df-fz 13507 df-seq 14009 df-exp 14069 df-cj 15117 df-re 15118 df-im 15119 df-sqrt 15253 df-abs 15254 df-dvds 16278 df-prm 16697 |
| This theorem is referenced by: prmdvdsprmop 17070 |
| Copyright terms: Public domain | W3C validator |