| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pserdvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for pserdv 26645. (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 6086 | . . . . . . . . . 10 ⊢ (◡abs “ (0[,)𝑅)) ⊆ dom abs | |
| 3 | absf 15415 | . . . . . . . . . . 11 ⊢ abs:ℂ⟶ℝ | |
| 4 | 3 | fdmi 6721 | . . . . . . . . . 10 ⊢ dom abs = ℂ |
| 5 | 2, 4 | sseqtri 3986 | . . . . . . . . 9 ⊢ (◡abs “ (0[,)𝑅)) ⊆ ℂ |
| 6 | 1, 5 | eqsstri 3984 | . . . . . . . 8 ⊢ 𝑆 ⊆ ℂ |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 7 | sselda 3938 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ℂ) |
| 9 | 8 | abscld 15516 | . . . . 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 26641 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀 ∧ 𝑀 < 𝑅)) |
| 16 | 15 | simp1d 1160 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ+) |
| 17 | 16 | rpred 13078 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 18 | 9, 17 | readdcld 11255 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ) |
| 19 | 0red 11228 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ∈ ℝ) | |
| 20 | 8 | absge0d 15524 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ≤ (abs‘𝑎)) |
| 21 | 9, 16 | ltaddrpd 13111 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < ((abs‘𝑎) + 𝑀)) |
| 22 | 19, 9, 18, 20, 21 | lelttrd 11385 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 < ((abs‘𝑎) + 𝑀)) |
| 23 | 18, 22 | elrpd 13075 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ+) |
| 24 | 23 | rphalfcld 13090 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+) |
| 25 | 15 | simp2d 1161 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < 𝑀) |
| 26 | avglt1 12499 | . . . 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 12508 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ) |
| 30 | 29 | rexrd 11276 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ*) |
| 31 | 17 | rexrd 11276 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ*) |
| 32 | iccssxr 13475 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 33 | 10, 12, 13 | radcnvcl 26633 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ (0[,]+∞)) |
| 34 | 32, 33 | sselid 3936 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑅 ∈ ℝ*) |
| 36 | avglt2 12500 | . . . . 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 13202 | . 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 2146 {crab 3418 ⊆ wss 3906 ifcif 4489 class class class wbr 5111 ↦ cmpt 5194 ◡ccnv 5662 dom cdm 5663 “ cima 5666 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 supcsup 9407 ℂcc 11115 ℝcr 11116 0cc0 11117 1c1 11118 + caddc 11120 · cmul 11122 +∞cpnf 11257 ℝ*cxr 11259 < clt 11260 / cdiv 11888 2c2 12312 ℕ0cn0 12521 ℝ+crp 13034 [,)cico 13392 [,]cicc 13393 seqcseq 14057 ↑cexp 14117 abscabs 15311 ⇝ cli 15561 Σcsu 15763 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 ax-pre-sup 11195 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-sup 9409 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-div 11889 df-nn 12251 df-2 12320 df-3 12321 df-n0 12522 df-z 12609 df-uz 12881 df-rp 13035 df-ico 13396 df-icc 13397 df-fz 13554 df-seq 14058 df-exp 14118 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 |
| This theorem is used by: pserdvlem2 26644 pserdv 26645 |
| Copyright terms: Public domain | W3C validator |