Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bpos | Structured version Visualization version GIF version |
Description: Bertrand's postulate: there is a prime between 𝑁 and 2𝑁 for every positive integer 𝑁. This proof follows Erdős's method, for the most part, but with some refinements due to Shigenori Tochiori to save us some calculations of large primes. See http://en.wikipedia.org/wiki/Proof_of_Bertrand%27s_postulate for an overview of the proof strategy. This is Metamath 100 proof #98. (Contributed by Mario Carneiro, 14-Mar-2014.) |
Ref | Expression |
---|---|
bpos | ⊢ (𝑁 ∈ ℕ → ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bpos1 26442 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ≤ ;64) → ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) | |
2 | eqid 2740 | . . . 4 ⊢ (𝑛 ∈ ℕ ↦ ((((√‘2) · ((𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥))‘(√‘𝑛))) + ((9 / 4) · ((𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥))‘(𝑛 / 2)))) + ((log‘2) / (√‘(2 · 𝑛))))) = (𝑛 ∈ ℕ ↦ ((((√‘2) · ((𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥))‘(√‘𝑛))) + ((9 / 4) · ((𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥))‘(𝑛 / 2)))) + ((log‘2) / (√‘(2 · 𝑛))))) | |
3 | eqid 2740 | . . . 4 ⊢ (𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥)) = (𝑥 ∈ ℝ+ ↦ ((log‘𝑥) / 𝑥)) | |
4 | simpll 764 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ ;64 < 𝑁) ∧ ¬ ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) → 𝑁 ∈ ℕ) | |
5 | simplr 766 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ ;64 < 𝑁) ∧ ¬ ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) → ;64 < 𝑁) | |
6 | simpr 485 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ ;64 < 𝑁) ∧ ¬ ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) → ¬ ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) | |
7 | 2, 3, 4, 5, 6 | bposlem9 26451 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ ;64 < 𝑁) ∧ ¬ ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) → ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) |
8 | 7 | pm2.18da 797 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ ;64 < 𝑁) → ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) |
9 | nnre 11991 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
10 | 6nn0 12265 | . . . . 5 ⊢ 6 ∈ ℕ0 | |
11 | 4nn0 12263 | . . . . 5 ⊢ 4 ∈ ℕ0 | |
12 | 10, 11 | deccl 12463 | . . . 4 ⊢ ;64 ∈ ℕ0 |
13 | 12 | nn0rei 12255 | . . 3 ⊢ ;64 ∈ ℝ |
14 | lelttric 11093 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ ;64 ∈ ℝ) → (𝑁 ≤ ;64 ∨ ;64 < 𝑁)) | |
15 | 9, 13, 14 | sylancl 586 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑁 ≤ ;64 ∨ ;64 < 𝑁)) |
16 | 1, 8, 15 | mpjaodan 956 | 1 ⊢ (𝑁 ∈ ℕ → ∃𝑝 ∈ ℙ (𝑁 < 𝑝 ∧ 𝑝 ≤ (2 · 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 844 ∈ wcel 2110 ∃wrex 3067 class class class wbr 5079 ↦ cmpt 5162 ‘cfv 6432 (class class class)co 7272 ℝcr 10881 + caddc 10885 · cmul 10887 < clt 11020 ≤ cle 11021 / cdiv 11643 ℕcn 11984 2c2 12039 4c4 12041 6c6 12043 9c9 12046 ;cdc 12448 ℝ+crp 12741 √csqrt 14955 ℙcprime 16387 logclog 25721 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7583 ax-inf2 9387 ax-cnex 10938 ax-resscn 10939 ax-1cn 10940 ax-icn 10941 ax-addcl 10942 ax-addrcl 10943 ax-mulcl 10944 ax-mulrcl 10945 ax-mulcom 10946 ax-addass 10947 ax-mulass 10948 ax-distr 10949 ax-i2m1 10950 ax-1ne0 10951 ax-1rid 10952 ax-rnegex 10953 ax-rrecex 10954 ax-cnre 10955 ax-pre-lttri 10956 ax-pre-lttrn 10957 ax-pre-ltadd 10958 ax-pre-mulgt0 10959 ax-pre-sup 10960 ax-addf 10961 ax-mulf 10962 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rmo 3074 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4846 df-int 4886 df-iun 4932 df-iin 4933 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-se 5546 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-isom 6441 df-riota 7229 df-ov 7275 df-oprab 7276 df-mpo 7277 df-of 7528 df-om 7708 df-1st 7825 df-2nd 7826 df-supp 7970 df-frecs 8089 df-wrecs 8120 df-recs 8194 df-rdg 8233 df-1o 8289 df-2o 8290 df-oadd 8293 df-er 8490 df-map 8609 df-pm 8610 df-ixp 8678 df-en 8726 df-dom 8727 df-sdom 8728 df-fin 8729 df-fsupp 9117 df-fi 9158 df-sup 9189 df-inf 9190 df-oi 9257 df-dju 9670 df-card 9708 df-pnf 11022 df-mnf 11023 df-xr 11024 df-ltxr 11025 df-le 11026 df-sub 11218 df-neg 11219 df-div 11644 df-nn 11985 df-2 12047 df-3 12048 df-4 12049 df-5 12050 df-6 12051 df-7 12052 df-8 12053 df-9 12054 df-n0 12245 df-xnn0 12317 df-z 12331 df-dec 12449 df-uz 12594 df-q 12700 df-rp 12742 df-xneg 12859 df-xadd 12860 df-xmul 12861 df-ioo 13094 df-ioc 13095 df-ico 13096 df-icc 13097 df-fz 13251 df-fzo 13394 df-fl 13523 df-mod 13601 df-seq 13733 df-exp 13794 df-fac 13999 df-bc 14028 df-hash 14056 df-shft 14789 df-cj 14821 df-re 14822 df-im 14823 df-sqrt 14957 df-abs 14958 df-limsup 15191 df-clim 15208 df-rlim 15209 df-sum 15409 df-ef 15788 df-e 15789 df-sin 15790 df-cos 15791 df-pi 15793 df-dvds 15975 df-gcd 16213 df-prm 16388 df-pc 16549 df-struct 16859 df-sets 16876 df-slot 16894 df-ndx 16906 df-base 16924 df-ress 16953 df-plusg 16986 df-mulr 16987 df-starv 16988 df-sca 16989 df-vsca 16990 df-ip 16991 df-tset 16992 df-ple 16993 df-ds 16995 df-unif 16996 df-hom 16997 df-cco 16998 df-rest 17144 df-topn 17145 df-0g 17163 df-gsum 17164 df-topgen 17165 df-pt 17166 df-prds 17169 df-xrs 17224 df-qtop 17229 df-imas 17230 df-xps 17232 df-mre 17306 df-mrc 17307 df-acs 17309 df-mgm 18337 df-sgrp 18386 df-mnd 18397 df-submnd 18442 df-mulg 18712 df-cntz 18934 df-cmn 19399 df-psmet 20600 df-xmet 20601 df-met 20602 df-bl 20603 df-mopn 20604 df-fbas 20605 df-fg 20606 df-cnfld 20609 df-top 22054 df-topon 22071 df-topsp 22093 df-bases 22107 df-cld 22181 df-ntr 22182 df-cls 22183 df-nei 22260 df-lp 22298 df-perf 22299 df-cn 22389 df-cnp 22390 df-haus 22477 df-tx 22724 df-hmeo 22917 df-fil 23008 df-fm 23100 df-flim 23101 df-flf 23102 df-xms 23484 df-ms 23485 df-tms 23486 df-cncf 24052 df-limc 25041 df-dv 25042 df-log 25723 df-cxp 25724 df-cht 26257 df-ppi 26260 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |