| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pserdvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for pserdv 26756. (Contributed by Mario Carneiro, 7-May-2015.) |
| Ref | Expression |
|---|---|
| pserf.g | ⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴‘𝑛) · (𝑥↑𝑛)))) |
| pserf.f | ⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺‘𝑦)‘𝑗)) |
| pserf.a | ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
| pserf.r | ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) |
| psercn.s | ⊢ 𝑆 = (◡abs “ (0[,)𝑅)) |
| psercn.m | ⊢ 𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1)) |
| Ref | Expression |
|---|---|
| pserdvlem1 | ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+ ∧ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2) ∧ (((abs‘𝑎) + 𝑀) / 2) < 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psercn.s | . . . . . . . . 9 ⊢ 𝑆 = (◡abs “ (0[,)𝑅)) | |
| 2 | cnvimass 6198 | . . . . . . . . . 10 ⊢ (◡abs “ (0[,)𝑅)) ⊆ dom abs | |
| 3 | absf 15505 | . . . . . . . . . . 11 ⊢ abs:ℂ⟶ℝ | |
| 4 | 3 | fdmi 6721 | . . . . . . . . . 10 ⊢ dom abs = ℂ |
| 5 | 2, 4 | sseqtri 3979 | . . . . . . . . 9 ⊢ (◡abs “ (0[,)𝑅)) ⊆ ℂ |
| 6 | 1, 5 | eqsstri 3977 | . . . . . . . 8 ⊢ 𝑆 ⊆ ℂ |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 7 | sselda 3931 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ℂ) |
| 9 | 8 | abscld 15606 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) ∈ ℝ) |
| 10 | pserf.g | . . . . . . . 8 ⊢ 𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴‘𝑛) · (𝑥↑𝑛)))) | |
| 11 | pserf.f | . . . . . . . 8 ⊢ 𝐹 = (𝑦 ∈ 𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺‘𝑦)‘𝑗)) | |
| 12 | pserf.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) | |
| 13 | pserf.r | . . . . . . . 8 ⊢ 𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺‘𝑟)) ∈ dom ⇝ }, ℝ*, < ) | |
| 14 | psercn.m | . . . . . . . 8 ⊢ 𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1)) | |
| 15 | 10, 11, 12, 13, 1, 14 | psercnlem1 26752 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀 ∧ 𝑀 < 𝑅)) |
| 16 | 15 | simp1d 1160 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ+) |
| 17 | 16 | rpred 13164 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 18 | 9, 17 | readdcld 11338 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ) |
| 19 | 0red 11311 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ∈ ℝ) | |
| 20 | 8 | absge0d 15614 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ≤ (abs‘𝑎)) |
| 21 | 9, 16 | ltaddrpd 13197 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < ((abs‘𝑎) + 𝑀)) |
| 22 | 19, 9, 18, 20, 21 | lelttrd 11468 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 < ((abs‘𝑎) + 𝑀)) |
| 23 | 18, 22 | elrpd 13161 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ+) |
| 24 | 23 | rphalfcld 13176 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+) |
| 25 | 15 | simp2d 1161 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < 𝑀) |
| 26 | avglt1 12584 | . . . 4 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) | |
| 27 | 9, 17, 26 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) |
| 28 | 25, 27 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2)) |
| 29 | 18 | rehalfcld 12593 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ) |
| 30 | 29 | rexrd 11359 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ*) |
| 31 | 17 | rexrd 11359 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ*) |
| 32 | iccssxr 13561 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 33 | 10, 12, 13 | radcnvcl 26744 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ (0[,]+∞)) |
| 34 | 32, 33 | sselid 3929 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑅 ∈ ℝ*) |
| 36 | avglt2 12585 | . . . . 5 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) | |
| 37 | 9, 17, 36 | syl2anc 596 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) |
| 38 | 25, 37 | mpbid 235 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑀) |
| 39 | 15 | simp3d 1162 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 < 𝑅) |
| 40 | 30, 31, 35, 38, 39 | xrlttrd 13288 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑅) |
| 41 | 24, 28, 40 | 3jca 1146 | 1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+ ∧ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2) ∧ (((abs‘𝑎) + 𝑀) / 2) < 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {crab 3413 ⊆ wss 3899 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 ◡ccnv 5650 dom cdm 5651 “ cima 5654 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 supcsup 9432 ℂcc 11198 ℝcr 11199 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 +∞cpnf 11340 ℝ*cxr 11342 < clt 11343 / cdiv 11973 2c2 12397 ℕ0cn0 12606 ℝ+crp 13120 [,)cico 13478 [,]cicc 13479 seqcseq 14144 ↑cexp 14204 abscabs 15401 ⇝ cli 15651 Σcsu 15853 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-inf2 9642 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-1o 8476 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 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-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-ico 13482 df-icc 13483 df-fz 13640 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-clim 15655 |
| This theorem is used by: pserdvlem2 26755 pserdv 26756 |
| Copyright terms: Public domain | W3C validator |