Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  prmgaplcm Structured version   Visualization version   GIF version

Theorem prmgaplcm 15758
 Description: Alternate proof of prmgap 15757: in contrast to prmgap 15757, where the gap starts at n! , the factorial of n, the gap starts at the least common multiple of all positive integers less than or equal to n. (Contributed by AV, 13-Aug-2020.) (Revised by AV, 27-Aug-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
prmgaplcm 𝑛 ∈ ℕ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ)
Distinct variable group:   𝑛,𝑝,𝑞,𝑧

Proof of Theorem prmgaplcm
Dummy variables 𝑖 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 22 . . 3 (𝑛 ∈ ℕ → 𝑛 ∈ ℕ)
2 fzssz 12340 . . . . . . . 8 (1...𝑥) ⊆ ℤ
32a1i 11 . . . . . . 7 (𝑥 ∈ ℕ → (1...𝑥) ⊆ ℤ)
4 fzfi 12766 . . . . . . . 8 (1...𝑥) ∈ Fin
54a1i 11 . . . . . . 7 (𝑥 ∈ ℕ → (1...𝑥) ∈ Fin)
6 0nelfz1 12357 . . . . . . . 8 0 ∉ (1...𝑥)
76a1i 11 . . . . . . 7 (𝑥 ∈ ℕ → 0 ∉ (1...𝑥))
8 lcmfn0cl 15333 . . . . . . 7 (((1...𝑥) ⊆ ℤ ∧ (1...𝑥) ∈ Fin ∧ 0 ∉ (1...𝑥)) → (lcm‘(1...𝑥)) ∈ ℕ)
93, 5, 7, 8syl3anc 1325 . . . . . 6 (𝑥 ∈ ℕ → (lcm‘(1...𝑥)) ∈ ℕ)
109adantl 482 . . . . 5 ((𝑛 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (lcm‘(1...𝑥)) ∈ ℕ)
11 eqid 2621 . . . . 5 (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))) = (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))
1210, 11fmptd 6383 . . . 4 (𝑛 ∈ ℕ → (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))):ℕ⟶ℕ)
13 nnex 11023 . . . . . 6 ℕ ∈ V
1413, 13pm3.2i 471 . . . . 5 (ℕ ∈ V ∧ ℕ ∈ V)
15 elmapg 7867 . . . . 5 ((ℕ ∈ V ∧ ℕ ∈ V) → ((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))) ∈ (ℕ ↑𝑚 ℕ) ↔ (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))):ℕ⟶ℕ))
1614, 15mp1i 13 . . . 4 (𝑛 ∈ ℕ → ((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))) ∈ (ℕ ↑𝑚 ℕ) ↔ (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))):ℕ⟶ℕ))
1712, 16mpbird 247 . . 3 (𝑛 ∈ ℕ → (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))) ∈ (ℕ ↑𝑚 ℕ))
18 prmgaplcmlem2 15750 . . . . 5 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 1 < (((lcm‘(1...𝑛)) + 𝑖) gcd 𝑖))
19 eqidd 2622 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))) = (𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥))))
20 oveq2 6655 . . . . . . . . . 10 (𝑥 = 𝑛 → (1...𝑥) = (1...𝑛))
2120fveq2d 6193 . . . . . . . . 9 (𝑥 = 𝑛 → (lcm‘(1...𝑥)) = (lcm‘(1...𝑛)))
2221adantl 482 . . . . . . . 8 (((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) ∧ 𝑥 = 𝑛) → (lcm‘(1...𝑥)) = (lcm‘(1...𝑛)))
23 simpl 473 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 𝑛 ∈ ℕ)
24 fzssz 12340 . . . . . . . . . 10 (1...𝑛) ⊆ ℤ
25 fzfi 12766 . . . . . . . . . 10 (1...𝑛) ∈ Fin
2624, 25pm3.2i 471 . . . . . . . . 9 ((1...𝑛) ⊆ ℤ ∧ (1...𝑛) ∈ Fin)
27 lcmfcl 15335 . . . . . . . . 9 (((1...𝑛) ⊆ ℤ ∧ (1...𝑛) ∈ Fin) → (lcm‘(1...𝑛)) ∈ ℕ0)
2826, 27mp1i 13 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (lcm‘(1...𝑛)) ∈ ℕ0)
2919, 22, 23, 28fvmptd 6286 . . . . . . 7 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → ((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))‘𝑛) = (lcm‘(1...𝑛)))
3029oveq1d 6662 . . . . . 6 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → (((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))‘𝑛) + 𝑖) = ((lcm‘(1...𝑛)) + 𝑖))
3130oveq1d 6662 . . . . 5 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → ((((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))‘𝑛) + 𝑖) gcd 𝑖) = (((lcm‘(1...𝑛)) + 𝑖) gcd 𝑖))
3218, 31breqtrrd 4679 . . . 4 ((𝑛 ∈ ℕ ∧ 𝑖 ∈ (2...𝑛)) → 1 < ((((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))‘𝑛) + 𝑖) gcd 𝑖))
3332ralrimiva 2965 . . 3 (𝑛 ∈ ℕ → ∀𝑖 ∈ (2...𝑛)1 < ((((𝑥 ∈ ℕ ↦ (lcm‘(1...𝑥)))‘𝑛) + 𝑖) gcd 𝑖))
341, 17, 33prmgaplem8 15756 . 2 (𝑛 ∈ ℕ → ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ))
3534rgen 2921 1 𝑛 ∈ ℕ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑛 ≤ (𝑞𝑝) ∧ ∀𝑧 ∈ ((𝑝 + 1)..^𝑞)𝑧 ∉ ℙ)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 384   = wceq 1482   ∈ wcel 1989   ∉ wnel 2896  ∀wral 2911  ∃wrex 2912  Vcvv 3198   ⊆ wss 3572   class class class wbr 4651   ↦ cmpt 4727  ⟶wf 5882  ‘cfv 5886  (class class class)co 6647   ↑𝑚 cmap 7854  Fincfn 7952  0cc0 9933  1c1 9934   + caddc 9936   < clt 10071   ≤ cle 10072   − cmin 10263  ℕcn 11017  2c2 11067  ℕ0cn0 11289  ℤcz 11374  ...cfz 12323  ..^cfzo 12461   gcd cgcd 15210  lcmclcmf 15296  ℙcprime 15379 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-rep 4769  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946  ax-inf2 8535  ax-cnex 9989  ax-resscn 9990  ax-1cn 9991  ax-icn 9992  ax-addcl 9993  ax-addrcl 9994  ax-mulcl 9995  ax-mulrcl 9996  ax-mulcom 9997  ax-addass 9998  ax-mulass 9999  ax-distr 10000  ax-i2m1 10001  ax-1ne0 10002  ax-1rid 10003  ax-rnegex 10004  ax-rrecex 10005  ax-cnre 10006  ax-pre-lttri 10007  ax-pre-lttrn 10008  ax-pre-ltadd 10009  ax-pre-mulgt0 10010  ax-pre-sup 10011 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1485  df-fal 1488  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-nel 2897  df-ral 2916  df-rex 2917  df-reu 2918  df-rmo 2919  df-rab 2920  df-v 3200  df-sbc 3434  df-csb 3532  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-pss 3588  df-nul 3914  df-if 4085  df-pw 4158  df-sn 4176  df-pr 4178  df-tp 4180  df-op 4182  df-uni 4435  df-int 4474  df-iun 4520  df-br 4652  df-opab 4711  df-mpt 4728  df-tr 4751  df-id 5022  df-eprel 5027  df-po 5033  df-so 5034  df-fr 5071  df-se 5072  df-we 5073  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-res 5124  df-ima 5125  df-pred 5678  df-ord 5724  df-on 5725  df-lim 5726  df-suc 5727  df-iota 5849  df-fun 5888  df-fn 5889  df-f 5890  df-f1 5891  df-fo 5892  df-f1o 5893  df-fv 5894  df-isom 5895  df-riota 6608  df-ov 6650  df-oprab 6651  df-mpt2 6652  df-om 7063  df-1st 7165  df-2nd 7166  df-wrecs 7404  df-recs 7465  df-rdg 7503  df-1o 7557  df-2o 7558  df-oadd 7561  df-er 7739  df-map 7856  df-en 7953  df-dom 7954  df-sdom 7955  df-fin 7956  df-sup 8345  df-inf 8346  df-oi 8412  df-card 8762  df-pnf 10073  df-mnf 10074  df-xr 10075  df-ltxr 10076  df-le 10077  df-sub 10265  df-neg 10266  df-div 10682  df-nn 11018  df-2 11076  df-3 11077  df-n0 11290  df-z 11375  df-uz 11685  df-rp 11830  df-fz 12324  df-fzo 12462  df-seq 12797  df-exp 12856  df-fac 13056  df-hash 13113  df-cj 13833  df-re 13834  df-im 13835  df-sqrt 13969  df-abs 13970  df-clim 14213  df-prod 14630  df-dvds 14978  df-gcd 15211  df-lcmf 15298  df-prm 15380 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator