| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infpnlem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for infpn 16824. For any positive integer 𝑁, there exists a prime number 𝑗 greater than 𝑁. (Contributed by NM, 5-May-2005.) |
| Ref | Expression |
|---|---|
| infpnlem.1 | ⊢ 𝐾 = ((!‘𝑁) + 1) |
| Ref | Expression |
|---|---|
| infpnlem2 | ⊢ (𝑁 ∈ ℕ → ∃𝑗 ∈ ℕ (𝑁 < 𝑗 ∧ ∀𝑘 ∈ ℕ ((𝑗 / 𝑘) ∈ ℕ → (𝑘 = 1 ∨ 𝑘 = 𝑗)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | infpnlem.1 | . . . . 5 ⊢ 𝐾 = ((!‘𝑁) + 1) | |
| 2 | nnnn0 12391 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 3 | 2 | faccld 14191 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) ∈ ℕ) |
| 4 | 3 | peano2nnd 12145 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) + 1) ∈ ℕ) |
| 5 | 1, 4 | eqeltrid 2832 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝐾 ∈ ℕ) |
| 6 | 3 | nnge1d 12176 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ≤ (!‘𝑁)) |
| 7 | 1nn 12139 | . . . . . . 7 ⊢ 1 ∈ ℕ | |
| 8 | nnleltp1 12531 | . . . . . . 7 ⊢ ((1 ∈ ℕ ∧ (!‘𝑁) ∈ ℕ) → (1 ≤ (!‘𝑁) ↔ 1 < ((!‘𝑁) + 1))) | |
| 9 | 7, 3, 8 | sylancr 587 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (1 ≤ (!‘𝑁) ↔ 1 < ((!‘𝑁) + 1))) |
| 10 | 6, 9 | mpbid 232 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 < ((!‘𝑁) + 1)) |
| 11 | 10, 1 | breqtrrdi 5134 | . . . 4 ⊢ (𝑁 ∈ ℕ → 1 < 𝐾) |
| 12 | nncn 12136 | . . . . . . 7 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℂ) | |
| 13 | nnne0 12162 | . . . . . . 7 ⊢ (𝐾 ∈ ℕ → 𝐾 ≠ 0) | |
| 14 | 12, 13 | jca 511 | . . . . . 6 ⊢ (𝐾 ∈ ℕ → (𝐾 ∈ ℂ ∧ 𝐾 ≠ 0)) |
| 15 | divid 11810 | . . . . . 6 ⊢ ((𝐾 ∈ ℂ ∧ 𝐾 ≠ 0) → (𝐾 / 𝐾) = 1) | |
| 16 | 5, 14, 15 | 3syl 18 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝐾 / 𝐾) = 1) |
| 17 | 16, 7 | eqeltrdi 2836 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝐾 / 𝐾) ∈ ℕ) |
| 18 | breq2 5096 | . . . . . 6 ⊢ (𝑗 = 𝐾 → (1 < 𝑗 ↔ 1 < 𝐾)) | |
| 19 | oveq2 7357 | . . . . . . 7 ⊢ (𝑗 = 𝐾 → (𝐾 / 𝑗) = (𝐾 / 𝐾)) | |
| 20 | 19 | eleq1d 2813 | . . . . . 6 ⊢ (𝑗 = 𝐾 → ((𝐾 / 𝑗) ∈ ℕ ↔ (𝐾 / 𝐾) ∈ ℕ)) |
| 21 | 18, 20 | anbi12d 632 | . . . . 5 ⊢ (𝑗 = 𝐾 → ((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ↔ (1 < 𝐾 ∧ (𝐾 / 𝐾) ∈ ℕ))) |
| 22 | 21 | rspcev 3577 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ (1 < 𝐾 ∧ (𝐾 / 𝐾) ∈ ℕ)) → ∃𝑗 ∈ ℕ (1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ)) |
| 23 | 5, 11, 17, 22 | syl12anc 836 | . . 3 ⊢ (𝑁 ∈ ℕ → ∃𝑗 ∈ ℕ (1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ)) |
| 24 | breq2 5096 | . . . . 5 ⊢ (𝑗 = 𝑘 → (1 < 𝑗 ↔ 1 < 𝑘)) | |
| 25 | oveq2 7357 | . . . . . 6 ⊢ (𝑗 = 𝑘 → (𝐾 / 𝑗) = (𝐾 / 𝑘)) | |
| 26 | 25 | eleq1d 2813 | . . . . 5 ⊢ (𝑗 = 𝑘 → ((𝐾 / 𝑗) ∈ ℕ ↔ (𝐾 / 𝑘) ∈ ℕ)) |
| 27 | 24, 26 | anbi12d 632 | . . . 4 ⊢ (𝑗 = 𝑘 → ((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ↔ (1 < 𝑘 ∧ (𝐾 / 𝑘) ∈ ℕ))) |
| 28 | 27 | nnwos 12816 | . . 3 ⊢ (∃𝑗 ∈ ℕ (1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) → ∃𝑗 ∈ ℕ ((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ∧ ∀𝑘 ∈ ℕ ((1 < 𝑘 ∧ (𝐾 / 𝑘) ∈ ℕ) → 𝑗 ≤ 𝑘))) |
| 29 | 23, 28 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ → ∃𝑗 ∈ ℕ ((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ∧ ∀𝑘 ∈ ℕ ((1 < 𝑘 ∧ (𝐾 / 𝑘) ∈ ℕ) → 𝑗 ≤ 𝑘))) |
| 30 | 1 | infpnlem1 16822 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑗 ∈ ℕ) → (((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ∧ ∀𝑘 ∈ ℕ ((1 < 𝑘 ∧ (𝐾 / 𝑘) ∈ ℕ) → 𝑗 ≤ 𝑘)) → (𝑁 < 𝑗 ∧ ∀𝑘 ∈ ℕ ((𝑗 / 𝑘) ∈ ℕ → (𝑘 = 1 ∨ 𝑘 = 𝑗))))) |
| 31 | 30 | reximdva 3142 | . 2 ⊢ (𝑁 ∈ ℕ → (∃𝑗 ∈ ℕ ((1 < 𝑗 ∧ (𝐾 / 𝑗) ∈ ℕ) ∧ ∀𝑘 ∈ ℕ ((1 < 𝑘 ∧ (𝐾 / 𝑘) ∈ ℕ) → 𝑗 ≤ 𝑘)) → ∃𝑗 ∈ ℕ (𝑁 < 𝑗 ∧ ∀𝑘 ∈ ℕ ((𝑗 / 𝑘) ∈ ℕ → (𝑘 = 1 ∨ 𝑘 = 𝑗))))) |
| 32 | 29, 31 | mpd 15 | 1 ⊢ (𝑁 ∈ ℕ → ∃𝑗 ∈ ℕ (𝑁 < 𝑗 ∧ ∀𝑘 ∈ ℕ ((𝑗 / 𝑘) ∈ ℕ → (𝑘 = 1 ∨ 𝑘 = 𝑗)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 class class class wbr 5092 ‘cfv 6482 (class class class)co 7349 ℂcc 11007 0cc0 11009 1c1 11010 + caddc 11012 < clt 11149 ≤ cle 11150 / cdiv 11777 ℕcn 12128 !cfa 14180 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-n0 12385 df-z 12472 df-uz 12736 df-seq 13909 df-fac 14181 |
| This theorem is referenced by: infpn 16824 |
| Copyright terms: Public domain | W3C validator |