Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pserdvlem1 | Structured version Visualization version GIF version |
Description: Lemma for pserdv 25493. (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 5978 | . . . . . . . . . 10 ⊢ (◡abs “ (0[,)𝑅)) ⊆ dom abs | |
3 | absf 14977 | . . . . . . . . . . 11 ⊢ abs:ℂ⟶ℝ | |
4 | 3 | fdmi 6596 | . . . . . . . . . 10 ⊢ dom abs = ℂ |
5 | 2, 4 | sseqtri 3953 | . . . . . . . . 9 ⊢ (◡abs “ (0[,)𝑅)) ⊆ ℂ |
6 | 1, 5 | eqsstri 3951 | . . . . . . . 8 ⊢ 𝑆 ⊆ ℂ |
7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
8 | 7 | sselda 3917 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ℂ) |
9 | 8 | abscld 15076 | . . . . 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 25489 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀 ∧ 𝑀 < 𝑅)) |
16 | 15 | simp1d 1140 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ+) |
17 | 16 | rpred 12701 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ) |
18 | 9, 17 | readdcld 10935 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ) |
19 | 0red 10909 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ∈ ℝ) | |
20 | 8 | absge0d 15084 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 ≤ (abs‘𝑎)) |
21 | 9, 16 | ltaddrpd 12734 | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < ((abs‘𝑎) + 𝑀)) |
22 | 19, 9, 18, 20, 21 | lelttrd 11063 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 0 < ((abs‘𝑎) + 𝑀)) |
23 | 18, 22 | elrpd 12698 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) + 𝑀) ∈ ℝ+) |
24 | 23 | rphalfcld 12713 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+) |
25 | 15 | simp2d 1141 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < 𝑀) |
26 | avglt1 12141 | . . . 4 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) | |
27 | 9, 17, 26 | syl2anc 583 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2))) |
28 | 25, 27 | mpbid 231 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2)) |
29 | 18 | rehalfcld 12150 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ) |
30 | 29 | rexrd 10956 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) ∈ ℝ*) |
31 | 17 | rexrd 10956 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 ∈ ℝ*) |
32 | iccssxr 13091 | . . . . 5 ⊢ (0[,]+∞) ⊆ ℝ* | |
33 | 10, 12, 13 | radcnvcl 25481 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ (0[,]+∞)) |
34 | 32, 33 | sselid 3915 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ ℝ*) |
35 | 34 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑅 ∈ ℝ*) |
36 | avglt2 12142 | . . . . 5 ⊢ (((abs‘𝑎) ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) | |
37 | 9, 17, 36 | syl2anc 583 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((abs‘𝑎) < 𝑀 ↔ (((abs‘𝑎) + 𝑀) / 2) < 𝑀)) |
38 | 25, 37 | mpbid 231 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑀) |
39 | 15 | simp3d 1142 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑀 < 𝑅) |
40 | 30, 31, 35, 38, 39 | xrlttrd 12822 | . 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((abs‘𝑎) + 𝑀) / 2) < 𝑅) |
41 | 24, 28, 40 | 3jca 1126 | 1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+ ∧ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2) ∧ (((abs‘𝑎) + 𝑀) / 2) < 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 {crab 3067 ⊆ wss 3883 ifcif 4456 class class class wbr 5070 ↦ cmpt 5153 ◡ccnv 5579 dom cdm 5580 “ cima 5583 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 supcsup 9129 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 · cmul 10807 +∞cpnf 10937 ℝ*cxr 10939 < clt 10940 / cdiv 11562 2c2 11958 ℕ0cn0 12163 ℝ+crp 12659 [,)cico 13010 [,]cicc 13011 seqcseq 13649 ↑cexp 13710 abscabs 14873 ⇝ cli 15121 Σcsu 15325 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-ico 13014 df-icc 13015 df-fz 13169 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 |
This theorem is referenced by: pserdvlem2 25492 pserdv 25493 |
Copyright terms: Public domain | W3C validator |