| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntrlog2bndlem6a | Structured version Visualization version GIF version | ||
| Description: Lemma for pntrlog2bndlem6 27910. (Contributed by Mario Carneiro, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| pntsval.1 | ⊢ 𝑆 = (𝑎 ∈ ℝ ↦ Σ𝑖 ∈ (1...(⌊‘𝑎))((Λ‘𝑖) · ((log‘𝑖) + (ψ‘(𝑎 / 𝑖))))) |
| pntrlog2bnd.r | ⊢ 𝑅 = (𝑎 ∈ ℝ+ ↦ ((ψ‘𝑎) − 𝑎)) |
| pntrlog2bnd.t | ⊢ 𝑇 = (𝑎 ∈ ℝ ↦ if(𝑎 ∈ ℝ+, (𝑎 · (log‘𝑎)), 0)) |
| pntrlog2bndlem5.1 | ⊢ (𝜑 → 𝐵 ∈ ℝ+) |
| pntrlog2bndlem5.2 | ⊢ (𝜑 → ∀𝑦 ∈ ℝ+ (abs‘((𝑅‘𝑦) / 𝑦)) ≤ 𝐵) |
| pntrlog2bndlem6.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| pntrlog2bndlem6.2 | ⊢ (𝜑 → 1 ≤ 𝐴) |
| Ref | Expression |
|---|---|
| pntrlog2bndlem6a | ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (1...(⌊‘𝑥)) = ((1...(⌊‘(𝑥 / 𝐴))) ∪ (((⌊‘(𝑥 / 𝐴)) + 1)...(⌊‘𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elioore 13506 | . . . . . . . 8 ⊢ (𝑥 ∈ (1(,)+∞) → 𝑥 ∈ ℝ) | |
| 2 | 1 | adantl 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℝ) |
| 3 | 1rp 13124 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 4 | 3 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ∈ ℝ+) |
| 5 | 4 | rpred 13164 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ∈ ℝ) |
| 6 | eliooord 13536 | . . . . . . . . . 10 ⊢ (𝑥 ∈ (1(,)+∞) → (1 < 𝑥 ∧ 𝑥 < +∞)) | |
| 7 | 6 | adantl 487 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (1 < 𝑥 ∧ 𝑥 < +∞)) |
| 8 | 7 | simpld 500 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 < 𝑥) |
| 9 | 5, 2, 8 | ltled 11458 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ≤ 𝑥) |
| 10 | 2, 4, 9 | rpgecld 13203 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℝ+) |
| 11 | pntrlog2bndlem6.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 12 | 3 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ+) |
| 13 | pntrlog2bndlem6.2 | . . . . . . . 8 ⊢ (𝜑 → 1 ≤ 𝐴) | |
| 14 | 11, 12, 13 | rpgecld 13203 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| 15 | 14 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝐴 ∈ ℝ+) |
| 16 | 10, 15 | rpdivcld 13181 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ∈ ℝ+) |
| 17 | 16 | rprege0d 13171 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((𝑥 / 𝐴) ∈ ℝ ∧ 0 ≤ (𝑥 / 𝐴))) |
| 18 | flge0nn0 13960 | . . . 4 ⊢ (((𝑥 / 𝐴) ∈ ℝ ∧ 0 ≤ (𝑥 / 𝐴)) → (⌊‘(𝑥 / 𝐴)) ∈ ℕ0) | |
| 19 | nn0p1nn 12645 | . . . 4 ⊢ ((⌊‘(𝑥 / 𝐴)) ∈ ℕ0 → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ ℕ) | |
| 20 | 17, 18, 19 | 3syl 19 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ ℕ) |
| 21 | nnuz 13004 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 22 | 20, 21 | eleqtrdi 2871 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ (ℤ≥‘1)) |
| 23 | 16 | rpred 13164 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ∈ ℝ) |
| 24 | 10 | rpge0d 13168 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 0 ≤ 𝑥) |
| 25 | 13 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ≤ 𝐴) |
| 26 | 4, 15, 2, 24, 25 | lediv2ad 13186 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ≤ (𝑥 / 1)) |
| 27 | 2 | recnd 11337 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℂ) |
| 28 | 27 | div1d 12085 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 1) = 𝑥) |
| 29 | 26, 28 | breqtrd 5131 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ≤ 𝑥) |
| 30 | flword2 13953 | . . 3 ⊢ (((𝑥 / 𝐴) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑥 / 𝐴) ≤ 𝑥) → (⌊‘𝑥) ∈ (ℤ≥‘(⌊‘(𝑥 / 𝐴)))) | |
| 31 | 23, 2, 29, 30 | syl3anc 1398 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (⌊‘𝑥) ∈ (ℤ≥‘(⌊‘(𝑥 / 𝐴)))) |
| 32 | fzsplit2 13683 | . 2 ⊢ ((((⌊‘(𝑥 / 𝐴)) + 1) ∈ (ℤ≥‘1) ∧ (⌊‘𝑥) ∈ (ℤ≥‘(⌊‘(𝑥 / 𝐴)))) → (1...(⌊‘𝑥)) = ((1...(⌊‘(𝑥 / 𝐴))) ∪ (((⌊‘(𝑥 / 𝐴)) + 1)...(⌊‘𝑥)))) | |
| 33 | 22, 31, 32 | syl2anc 596 | 1 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (1...(⌊‘𝑥)) = ((1...(⌊‘(𝑥 / 𝐴))) ∪ (((⌊‘(𝑥 / 𝐴)) + 1)...(⌊‘𝑥)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∪ cun 3897 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 +∞cpnf 11340 < clt 11343 ≤ cle 11344 − cmin 11541 / cdiv 11973 ℕcn 12335 ℕ0cn0 12606 ℤ≥cuz 12965 ℝ+crp 13120 (,)cioo 13476 ...cfz 13639 ⌊cfl 13930 abscabs 15401 Σcsu 15853 logclog 26882 Λcvma 27419 ψcchp 27420 |
| 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-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 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-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-ioo 13480 df-fz 13640 df-fl 13932 |
| This theorem is used by: pntrlog2bndlem6 27910 |
| Copyright terms: Public domain | W3C validator |