![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ppiwordi | Structured version Visualization version GIF version |
Description: The prime-counting function π is weakly increasing. (Contributed by Mario Carneiro, 19-Sep-2014.) |
Ref | Expression |
---|---|
ppiwordi | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (π‘𝐴) ≤ (π‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2 1132 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ) | |
2 | ppifi 25031 | . . . . 5 ⊢ (𝐵 ∈ ℝ → ((0[,]𝐵) ∩ ℙ) ∈ Fin) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((0[,]𝐵) ∩ ℙ) ∈ Fin) |
4 | 0red 10233 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 0 ∈ ℝ) | |
5 | 0le0 11302 | . . . . . . 7 ⊢ 0 ≤ 0 | |
6 | 5 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 0 ≤ 0) |
7 | simp3 1133 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
8 | iccss 12434 | . . . . . 6 ⊢ (((0 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 ≤ 0 ∧ 𝐴 ≤ 𝐵)) → (0[,]𝐴) ⊆ (0[,]𝐵)) | |
9 | 4, 1, 6, 7, 8 | syl22anc 1478 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (0[,]𝐴) ⊆ (0[,]𝐵)) |
10 | ssrin 3981 | . . . . 5 ⊢ ((0[,]𝐴) ⊆ (0[,]𝐵) → ((0[,]𝐴) ∩ ℙ) ⊆ ((0[,]𝐵) ∩ ℙ)) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((0[,]𝐴) ∩ ℙ) ⊆ ((0[,]𝐵) ∩ ℙ)) |
12 | ssdomg 8167 | . . . 4 ⊢ (((0[,]𝐵) ∩ ℙ) ∈ Fin → (((0[,]𝐴) ∩ ℙ) ⊆ ((0[,]𝐵) ∩ ℙ) → ((0[,]𝐴) ∩ ℙ) ≼ ((0[,]𝐵) ∩ ℙ))) | |
13 | 3, 11, 12 | sylc 65 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((0[,]𝐴) ∩ ℙ) ≼ ((0[,]𝐵) ∩ ℙ)) |
14 | ppifi 25031 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((0[,]𝐴) ∩ ℙ) ∈ Fin) | |
15 | 14 | 3ad2ant1 1128 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((0[,]𝐴) ∩ ℙ) ∈ Fin) |
16 | hashdom 13360 | . . . 4 ⊢ ((((0[,]𝐴) ∩ ℙ) ∈ Fin ∧ ((0[,]𝐵) ∩ ℙ) ∈ Fin) → ((♯‘((0[,]𝐴) ∩ ℙ)) ≤ (♯‘((0[,]𝐵) ∩ ℙ)) ↔ ((0[,]𝐴) ∩ ℙ) ≼ ((0[,]𝐵) ∩ ℙ))) | |
17 | 15, 3, 16 | syl2anc 696 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((♯‘((0[,]𝐴) ∩ ℙ)) ≤ (♯‘((0[,]𝐵) ∩ ℙ)) ↔ ((0[,]𝐴) ∩ ℙ) ≼ ((0[,]𝐵) ∩ ℙ))) |
18 | 13, 17 | mpbird 247 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (♯‘((0[,]𝐴) ∩ ℙ)) ≤ (♯‘((0[,]𝐵) ∩ ℙ))) |
19 | ppival 25052 | . . 3 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) = (♯‘((0[,]𝐴) ∩ ℙ))) | |
20 | 19 | 3ad2ant1 1128 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (π‘𝐴) = (♯‘((0[,]𝐴) ∩ ℙ))) |
21 | ppival 25052 | . . 3 ⊢ (𝐵 ∈ ℝ → (π‘𝐵) = (♯‘((0[,]𝐵) ∩ ℙ))) | |
22 | 1, 21 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (π‘𝐵) = (♯‘((0[,]𝐵) ∩ ℙ))) |
23 | 18, 20, 22 | 3brtr4d 4836 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (π‘𝐴) ≤ (π‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ w3a 1072 = wceq 1632 ∈ wcel 2139 ∩ cin 3714 ⊆ wss 3715 class class class wbr 4804 ‘cfv 6049 (class class class)co 6813 ≼ cdom 8119 Fincfn 8121 ℝcr 10127 0cc0 10128 ≤ cle 10267 [,]cicc 12371 ♯chash 13311 ℙcprime 15587 πcppi 25019 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-cnex 10184 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 ax-pre-sup 10206 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-int 4628 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-om 7231 df-1st 7333 df-2nd 7334 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-1o 7729 df-2o 7730 df-oadd 7733 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-fin 8125 df-sup 8513 df-inf 8514 df-card 8955 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-div 10877 df-nn 11213 df-2 11271 df-3 11272 df-n0 11485 df-xnn0 11556 df-z 11570 df-uz 11880 df-rp 12026 df-icc 12375 df-fz 12520 df-fl 12787 df-seq 12996 df-exp 13055 df-hash 13312 df-cj 14038 df-re 14039 df-im 14040 df-sqrt 14174 df-abs 14175 df-dvds 15183 df-prm 15588 df-ppi 25025 |
This theorem is referenced by: ppinncl 25099 ppieq0 25101 ppiub 25128 chebbnd1lem1 25357 chebbnd1lem3 25359 |
Copyright terms: Public domain | W3C validator |