| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pntrlog2bndlem6a | Structured version Visualization version GIF version | ||
| Description: Lemma for pntrlog2bndlem6 27919. (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 13513 | . . . . . . . 8 ⊢ (𝑥 ∈ (1(,)+∞) → 𝑥 ∈ ℝ) | |
| 2 | 1 | adantl 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℝ) |
| 3 | 1rp 13131 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 4 | 3 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ∈ ℝ+) |
| 5 | 4 | rpred 13171 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ∈ ℝ) |
| 6 | eliooord 13543 | . . . . . . . . . 10 ⊢ (𝑥 ∈ (1(,)+∞) → (1 < 𝑥 ∧ 𝑥 < +∞)) | |
| 7 | 6 | adantl 487 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (1 < 𝑥 ∧ 𝑥 < +∞)) |
| 8 | 7 | simpld 500 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 < 𝑥) |
| 9 | 5, 2, 8 | ltled 11465 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ≤ 𝑥) |
| 10 | 2, 4, 9 | rpgecld 13210 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℝ+) |
| 11 | pntrlog2bndlem6.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 12 | 3 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ+) |
| 13 | pntrlog2bndlem6.2 | . . . . . . . 8 ⊢ (𝜑 → 1 ≤ 𝐴) | |
| 14 | 11, 12, 13 | rpgecld 13210 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
| 15 | 14 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝐴 ∈ ℝ+) |
| 16 | 10, 15 | rpdivcld 13188 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ∈ ℝ+) |
| 17 | 16 | rprege0d 13178 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((𝑥 / 𝐴) ∈ ℝ ∧ 0 ≤ (𝑥 / 𝐴))) |
| 18 | flge0nn0 13967 | . . . 4 ⊢ (((𝑥 / 𝐴) ∈ ℝ ∧ 0 ≤ (𝑥 / 𝐴)) → (⌊‘(𝑥 / 𝐴)) ∈ ℕ0) | |
| 19 | nn0p1nn 12652 | . . . 4 ⊢ ((⌊‘(𝑥 / 𝐴)) ∈ ℕ0 → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ ℕ) | |
| 20 | 17, 18, 19 | 3syl 19 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ ℕ) |
| 21 | nnuz 13011 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 22 | 20, 21 | eleqtrdi 2870 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → ((⌊‘(𝑥 / 𝐴)) + 1) ∈ (ℤ≥‘1)) |
| 23 | 16 | rpred 13171 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ∈ ℝ) |
| 24 | 10 | rpge0d 13175 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 0 ≤ 𝑥) |
| 25 | 13 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 1 ≤ 𝐴) |
| 26 | 4, 15, 2, 24, 25 | lediv2ad 13193 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ≤ (𝑥 / 1)) |
| 27 | 2 | recnd 11344 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → 𝑥 ∈ ℂ) |
| 28 | 27 | div1d 12092 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 1) = 𝑥) |
| 29 | 26, 28 | breqtrd 5130 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (𝑥 / 𝐴) ≤ 𝑥) |
| 30 | flword2 13960 | . . 3 ⊢ (((𝑥 / 𝐴) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑥 / 𝐴) ≤ 𝑥) → (⌊‘𝑥) ∈ (ℤ≥‘(⌊‘(𝑥 / 𝐴)))) | |
| 31 | 23, 2, 29, 30 | syl3anc 1398 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (1(,)+∞)) → (⌊‘𝑥) ∈ (ℤ≥‘(⌊‘(𝑥 / 𝐴)))) |
| 32 | fzsplit2 13690 | . 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 1569 ∈ wcel 2144 ∀wral 3076 ∪ cun 4148 ifcif 4481 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6543 (class class class)co 7424 ℝcr 11206 0cc0 11207 1c1 11208 + caddc 11210 · cmul 11212 +∞cpnf 11347 < clt 11350 ≤ cle 11351 − cmin 11548 / cdiv 11980 ℕcn 12342 ℕ0cn0 12613 ℤ≥cuz 12972 ℝ+crp 13127 (,)cioo 13483 ...cfz 13646 ⌊cfl 13937 abscabs 15410 Σcsu 15862 logclog 26891 Λcvma 27428 ψcchp 27429 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-ioo 13487 df-fz 13647 df-fl 13939 |
| This theorem is used by: pntrlog2bndlem6 27919 |
| Copyright terms: Public domain | W3C validator |