| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pserdvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for pserdv 26603. (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 6083 | . . . . . . . . . 10 ⊢ (◡abs “ (0[,)𝑅)) ⊆ dom abs | |
| 3 | absf 15396 | . . . . . . . . . . 11 ⊢ abs:ℂ⟶ℝ | |
| 4 | 3 | fdmi 6717 | . . . . . . . . . 10 ⊢ dom abs = ℂ |
| 5 | 2, 4 | sseqtri 3984 | . . . . . . . . 9 ⊢ (◡abs “ (0[,)𝑅)) ⊆ ℂ |
| 6 | 1, 5 | eqsstri 3982 | . . . . . . . 8 ⊢ 𝑆 ⊆ ℂ |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 7 | sselda 3936 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ℂ) |
| 9 | 8 | abscld 15497 | . . . . 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 26599 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀 ∧ 𝑀 < 𝑅)) |
| 16 | 15 | simp1d 1159 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ+) |
| 17 | 16 | rpred 13066 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 18 | 9, 17 | readdcld 11244 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ) |
| 19 | 0red 11217 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ∈ ℝ) | |
| 20 | 8 | absge0d 15505 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ≤ (abs‘𝑎)) |
| 21 | 9, 16 | ltaddrpd 13099 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < ((abs‘𝑎) + 𝑀)) |
| 22 | 19, 9, 18, 20, 21 | lelttrd 11374 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 < ((abs‘𝑎) + 𝑀)) |
| 23 | 18, 22 | elrpd 13063 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ+) |
| 24 | 23 | rphalfcld 13078 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+) |
| 25 | 15 | simp2d 1160 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < 𝑀) |
| 26 | avglt1 12488 | . . . 4 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) | |
| 27 | 9, 17, 26 | syl2anc 595 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) |
| 28 | 25, 27 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2)) |
| 29 | 18 | rehalfcld 12497 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ) |
| 30 | 29 | rexrd 11265 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ*) |
| 31 | 17 | rexrd 11265 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ*) |
| 32 | iccssxr 13463 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 33 | 10, 12, 13 | radcnvcl 26591 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ (0[,]+∞)) |
| 34 | 32, 33 | sselid 3934 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 35 | 34 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑅 ∈ ℝ*) |
| 36 | avglt2 12489 | . . . . 5 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) | |
| 37 | 9, 17, 36 | syl2anc 595 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) |
| 38 | 25, 37 | mpbid 235 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑀) |
| 39 | 15 | simp3d 1161 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 < 𝑅) |
| 40 | 30, 31, 35, 38, 39 | xrlttrd 13190 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑅) |
| 41 | 24, 28, 40 | 3jca 1145 | 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 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 {crab 3415 ⊆ wss 3904 ifcif 4486 class class class wbr 5108 ↦ cmpt 5191 ◡ccnv 5659 dom cdm 5660 “ cima 5663 ⟶wf 6532 ‘cfv 6536 (class class class)co 7412 supcsup 9398 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 +∞cpnf 11246 ℝ*cxr 11248 < clt 11249 / cdiv 11877 2c2 12301 ℕ0cn0 12510 ℝ+crp 13022 [,)cico 13380 [,]cicc 13381 seqcseq 14044 ↑cexp 14104 abscabs 15292 ⇝ cli 15542 Σcsu 15744 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-inf2 9608 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9400 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-ico 13384 df-icc 13385 df-fz 13542 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-clim 15546 |
| This theorem is used by: pserdvlem2 26602 pserdv 26603 |
| Copyright terms: Public domain | W3C validator |