Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ppip1le | Structured version Visualization version GIF version |
Description: The prime-counting function π cannot locally increase faster than the identity function. (Contributed by Mario Carneiro, 21-Sep-2014.) |
Ref | Expression |
---|---|
ppip1le | ⊢ (𝐴 ∈ ℝ → (π‘(𝐴 + 1)) ≤ ((π‘𝐴) + 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | flcl 13164 | . . 3 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℤ) | |
2 | zre 11984 | . . . . . . . . 9 ⊢ ((⌊‘𝐴) ∈ ℤ → (⌊‘𝐴) ∈ ℝ) | |
3 | peano2re 10812 | . . . . . . . . 9 ⊢ ((⌊‘𝐴) ∈ ℝ → ((⌊‘𝐴) + 1) ∈ ℝ) | |
4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ ((⌊‘𝐴) ∈ ℤ → ((⌊‘𝐴) + 1) ∈ ℝ) |
5 | 4 | adantr 483 | . . . . . . 7 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ((⌊‘𝐴) + 1) ∈ ℙ) → ((⌊‘𝐴) + 1) ∈ ℝ) |
6 | ppicl 25707 | . . . . . . 7 ⊢ (((⌊‘𝐴) + 1) ∈ ℝ → (π‘((⌊‘𝐴) + 1)) ∈ ℕ0) | |
7 | 5, 6 | syl 17 | . . . . . 6 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) ∈ ℕ0) |
8 | 7 | nn0red 11955 | . . . . 5 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) ∈ ℝ) |
9 | ppiprm 25727 | . . . . 5 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) = ((π‘(⌊‘𝐴)) + 1)) | |
10 | 8, 9 | eqled 10742 | . . . 4 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) ≤ ((π‘(⌊‘𝐴)) + 1)) |
11 | ppinprm 25728 | . . . . 5 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ¬ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) = (π‘(⌊‘𝐴))) | |
12 | ppicl 25707 | . . . . . . . . 9 ⊢ ((⌊‘𝐴) ∈ ℝ → (π‘(⌊‘𝐴)) ∈ ℕ0) | |
13 | 2, 12 | syl 17 | . . . . . . . 8 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) ∈ ℕ0) |
14 | 13 | nn0red 11955 | . . . . . . 7 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) ∈ ℝ) |
15 | 14 | adantr 483 | . . . . . 6 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ¬ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘(⌊‘𝐴)) ∈ ℝ) |
16 | 15 | lep1d 11570 | . . . . 5 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ¬ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘(⌊‘𝐴)) ≤ ((π‘(⌊‘𝐴)) + 1)) |
17 | 11, 16 | eqbrtrd 5087 | . . . 4 ⊢ (((⌊‘𝐴) ∈ ℤ ∧ ¬ ((⌊‘𝐴) + 1) ∈ ℙ) → (π‘((⌊‘𝐴) + 1)) ≤ ((π‘(⌊‘𝐴)) + 1)) |
18 | 10, 17 | pm2.61dan 811 | . . 3 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘((⌊‘𝐴) + 1)) ≤ ((π‘(⌊‘𝐴)) + 1)) |
19 | 1, 18 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ → (π‘((⌊‘𝐴) + 1)) ≤ ((π‘(⌊‘𝐴)) + 1)) |
20 | 1z 12011 | . . . . 5 ⊢ 1 ∈ ℤ | |
21 | fladdz 13194 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ∈ ℤ) → (⌊‘(𝐴 + 1)) = ((⌊‘𝐴) + 1)) | |
22 | 20, 21 | mpan2 689 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + 1)) = ((⌊‘𝐴) + 1)) |
23 | 22 | fveq2d 6673 | . . 3 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘(𝐴 + 1))) = (π‘((⌊‘𝐴) + 1))) |
24 | peano2re 10812 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) ∈ ℝ) | |
25 | ppifl 25736 | . . . 4 ⊢ ((𝐴 + 1) ∈ ℝ → (π‘(⌊‘(𝐴 + 1))) = (π‘(𝐴 + 1))) | |
26 | 24, 25 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘(𝐴 + 1))) = (π‘(𝐴 + 1))) |
27 | 23, 26 | eqtr3d 2858 | . 2 ⊢ (𝐴 ∈ ℝ → (π‘((⌊‘𝐴) + 1)) = (π‘(𝐴 + 1))) |
28 | ppifl 25736 | . . 3 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴)) | |
29 | 28 | oveq1d 7170 | . 2 ⊢ (𝐴 ∈ ℝ → ((π‘(⌊‘𝐴)) + 1) = ((π‘𝐴) + 1)) |
30 | 19, 27, 29 | 3brtr3d 5096 | 1 ⊢ (𝐴 ∈ ℝ → (π‘(𝐴 + 1)) ≤ ((π‘𝐴) + 1)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 class class class wbr 5065 ‘cfv 6354 (class class class)co 7155 ℝcr 10535 1c1 10537 + caddc 10539 ≤ cle 10675 ℕ0cn0 11896 ℤcz 11980 ⌊cfl 13159 ℙcprime 16014 πcppi 25670 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-2o 8102 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-sup 8905 df-inf 8906 df-dju 9329 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-2 11699 df-3 11700 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-icc 12744 df-fz 12892 df-fl 13161 df-seq 13369 df-exp 13429 df-hash 13690 df-cj 14457 df-re 14458 df-im 14459 df-sqrt 14593 df-abs 14594 df-dvds 15607 df-prm 16015 df-ppi 25676 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |