| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pserdvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for pserdv 26813. (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 6217 | . . . . . . . . . 10 ⊢ (◡abs “ (0[,)𝑅)) ⊆ dom abs | |
| 3 | absf 15548 | . . . . . . . . . . 11 ⊢ abs:ℂ⟶ℝ | |
| 4 | 3 | fdmi 6751 | . . . . . . . . . 10 ⊢ dom abs = ℂ |
| 5 | 2, 4 | sseqtri 3961 | . . . . . . . . 9 ⊢ (◡abs “ (0[,)𝑅)) ⊆ ℂ |
| 6 | 1, 5 | eqsstri 3959 | . . . . . . . 8 ⊢ 𝑆 ⊆ ℂ |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 7 | sselda 3913 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ℂ) |
| 9 | 8 | abscld 15650 | . . . . 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 26809 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀 ∧ 𝑀 < 𝑅)) |
| 16 | 15 | simp1d 1160 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ+) |
| 17 | 16 | rpred 13204 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 18 | 9, 17 | readdcld 11377 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ) |
| 19 | 0red 11350 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ∈ ℝ) | |
| 20 | 8 | absge0d 15658 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ≤ (abs‘𝑎)) |
| 21 | 9, 16 | ltaddrpd 13237 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < ((abs‘𝑎) + 𝑀)) |
| 22 | 19, 9, 18, 20, 21 | lelttrd 11507 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 < ((abs‘𝑎) + 𝑀)) |
| 23 | 18, 22 | elrpd 13201 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ+) |
| 24 | 23 | rphalfcld 13216 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+) |
| 25 | 15 | simp2d 1161 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < 𝑀) |
| 26 | avglt1 12624 | . . . 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 12633 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ) |
| 30 | 29 | rexrd 11398 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ*) |
| 31 | 17 | rexrd 11398 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ*) |
| 32 | iccssxr 13601 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 33 | 10, 12, 13 | radcnvcl 26801 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ (0[,]+∞)) |
| 34 | 32, 33 | sselid 3911 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑅 ∈ ℝ*) |
| 36 | avglt2 12625 | . . . . 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 13328 | . 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 2147 {crab 3416 ⊆ wss 3900 ifcif 4485 class class class wbr 5108 ↦ cmpt 5192 ◡ccnv 5657 dom cdm 5658 “ cima 5661 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 supcsup 9469 ℂcc 11237 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 · cmul 11244 +∞cpnf 11379 ℝ*cxr 11381 < clt 11382 / cdiv 12013 2c2 12437 ℕ0cn0 12646 ℝ+crp 13160 [,)cico 13518 [,]cicc 13519 seqcseq 14184 ↑cexp 14244 abscabs 15444 ⇝ cli 15695 Σcsu 15897 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-ico 13522 df-icc 13523 df-fz 13680 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 |
| This theorem is used by: pserdvlem2 26812 pserdv 26813 |
| Copyright terms: Public domain | W3C validator |