| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prmgap | Structured version Visualization version GIF version | ||
| Description: The prime gap theorem: for each positive integer there are (at least) two successive primes with a difference ("gap") at least as big as the given integer. (Contributed by AV, 13-Aug-2020.) |
| Ref | Expression |
|---|---|
| prmgap | ⊢ ∀𝑛 ∈ ℕ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞 − 𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . 3 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ) | |
| 2 | facmapnn 14429 | . . . 4 ⊢ (𝑥 ∈ ℕ ↦ (!‘𝑥)) ∈ (ℕ ↑m ℕ) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑛 ∈ ℕ → (𝑥 ∈ ℕ ↦ (!‘𝑥)) ∈ (ℕ ↑m ℕ)) |
| 4 | prmgaplem2 17228 | . . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 1 < (((!‘𝑛) + 𝑖) gcd 𝑖)) | |
| 5 | eqidd 2762 | . . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (𝑥 ∈ ℕ ↦ (!‘𝑥)) = (𝑥 ∈ ℕ ↦ (!‘𝑥))) | |
| 6 | fveq2 6885 | . . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (!‘𝑥) = (!‘𝑛)) | |
| 7 | 6 | adantl 487 | . . . . . . . 8 ⊢ (((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) ∧ 𝑥 = 𝑛) → (!‘𝑥) = (!‘𝑛)) |
| 8 | simpl 488 | . . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 𝑛 ∈ ℕ) | |
| 9 | fvexd 6900 | . . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (!‘𝑛) ∈ V) | |
| 10 | 5, 7, 8, 9 | fvmptd 7001 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → ((𝑥 ∈ ℕ ↦ (!‘𝑥))‘𝑛) = (!‘𝑛)) |
| 11 | 10 | oveq1d 7435 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (((𝑥 ∈ ℕ ↦ (!‘𝑥))‘𝑛) + 𝑖) = ((!‘𝑛) + 𝑖)) |
| 12 | 11 | oveq1d 7435 | . . . . 5 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → ((((𝑥 ∈ ℕ ↦ (!‘𝑥))‘𝑛) + 𝑖) gcd 𝑖) = (((!‘𝑛) + 𝑖) gcd 𝑖)) |
| 13 | 4, 12 | breqtrrd 5133 | . . . 4 ⊢ ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 1 < ((((𝑥 ∈ ℕ ↦ (!‘𝑥))‘𝑛) + 𝑖) gcd 𝑖)) |
| 14 | 13 | ralrimiva 3155 | . . 3 ⊢ (𝑛 ∈ ℕ → ∀𝑖 ∈ (2...𝑛)1 < ((((𝑥 ∈ ℕ ↦ (!‘𝑥))‘𝑛) + 𝑖) gcd 𝑖)) |
| 15 | 1, 3, 14 | prmgaplem8 17236 | . 2 ⊢ (𝑛 ∈ ℕ → ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞 − 𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ)) |
| 16 | 15 | rgen 3079 | 1 ⊢ ∀𝑛 ∈ ℕ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞 − 𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∉ wnel 3062 ∀wral 3077 ∃wrex 3087 Vcvv 3451 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6538 (class class class)co 7420 ↑m cmap 8847 1c1 11201 + caddc 11203 < clt 11343 ≤ cle 11344 − cmin 11541 ℕcn 12335 2c2 12397 ...cfz 13639 ..^cfzo 13788 !cfa 14417 gcd cgcd 16664 ℙcprime 16846 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-seq 14145 df-exp 14205 df-fac 14418 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-dvds 16423 df-gcd 16665 df-prm 16847 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |