| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abelth2 | Structured version Visualization version GIF version | ||
| Description: Abel's theorem, restricted to the [0, 1] interval. (Contributed by Mario Carneiro, 2-Apr-2015.) |
| Ref | Expression |
|---|---|
| abelth2.1 | ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
| abelth2.2 | ⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ ) |
| abelth2.3 | ⊢ 𝐹 = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) |
| Ref | Expression |
|---|---|
| abelth2 | ⊢ (𝜑 → 𝐹 ∈ ((0[,]1)–cn→ℂ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unitssre 13443 | . . . . . . 7 ⊢ (0[,]1) ⊆ ℝ | |
| 2 | ax-resscn 11086 | . . . . . . 7 ⊢ ℝ ⊆ ℂ | |
| 3 | 1, 2 | sstri 3932 | . . . . . 6 ⊢ (0[,]1) ⊆ ℂ |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝜑 → (0[,]1) ⊆ ℂ) |
| 5 | 1re 11135 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 6 | simpr 484 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ (0[,]1)) | |
| 7 | elicc01 13410 | . . . . . . . . . 10 ⊢ (𝑧 ∈ (0[,]1) ↔ (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) | |
| 8 | 6, 7 | sylib 218 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) |
| 9 | 8 | simp1d 1143 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ ℝ) |
| 10 | resubcl 11449 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (1 − 𝑧) ∈ ℝ) | |
| 11 | 5, 9, 10 | sylancr 588 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℝ) |
| 12 | 11 | leidd 11707 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ≤ (1 − 𝑧)) |
| 13 | 1red 11136 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 1 ∈ ℝ) | |
| 14 | 8 | simp3d 1145 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ≤ 1) |
| 15 | 9, 13, 14 | abssubge0d 15387 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) = (1 − 𝑧)) |
| 16 | 8 | simp2d 1144 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 0 ≤ 𝑧) |
| 17 | 9, 16 | absidd 15376 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘𝑧) = 𝑧) |
| 18 | 17 | oveq2d 7376 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − (abs‘𝑧)) = (1 − 𝑧)) |
| 19 | 18 | oveq2d 7376 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 · (1 − 𝑧))) |
| 20 | 11 | recnd 11164 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℂ) |
| 21 | 20 | mullidd 11154 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − 𝑧)) = (1 − 𝑧)) |
| 22 | 19, 21 | eqtrd 2772 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 − 𝑧)) |
| 23 | 12, 15, 22 | 3brtr4d 5118 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))) |
| 24 | 4, 23 | ssrabdv 4014 | . . . 4 ⊢ (𝜑 → (0[,]1) ⊆ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}) |
| 25 | 24 | resmptd 5999 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛)))) |
| 26 | abelth2.3 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 27 | 25, 26 | eqtr4di 2790 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = 𝐹) |
| 28 | abelth2.1 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) | |
| 29 | abelth2.2 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ ) | |
| 30 | 1red 11136 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 31 | 0le1 11664 | . . . . 5 ⊢ 0 ≤ 1 | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 33 | eqid 2737 | . . . 4 ⊢ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} | |
| 34 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) = (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 35 | 28, 29, 30, 32, 33, 34 | abelth 26419 | . . 3 ⊢ (𝜑 → (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ∈ ({𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}–cn→ℂ)) |
| 36 | rescncf 24874 | . . 3 ⊢ ((0[,]1) ⊆ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ∈ ({𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}–cn→ℂ) → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) ∈ ((0[,]1)–cn→ℂ))) | |
| 37 | 24, 35, 36 | sylc 65 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) ∈ ((0[,]1)–cn→ℂ)) |
| 38 | 27, 37 | eqeltrrd 2838 | 1 ⊢ (𝜑 → 𝐹 ∈ ((0[,]1)–cn→ℂ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 {crab 3390 ⊆ wss 3890 class class class wbr 5086 ↦ cmpt 5167 dom cdm 5624 ↾ cres 5626 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 ℂcc 11027 ℝcr 11028 0cc0 11029 1c1 11030 + caddc 11032 · cmul 11034 ≤ cle 11171 − cmin 11368 ℕ0cn0 12428 [,]cicc 13292 seqcseq 13954 ↑cexp 14014 abscabs 15187 ⇝ cli 15437 Σcsu 15639 –cn→ccncf 24853 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 ax-addf 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-map 8768 df-pm 8769 df-ixp 8839 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-fi 9317 df-sup 9348 df-inf 9349 df-oi 9418 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-q 12890 df-rp 12934 df-xneg 13054 df-xadd 13055 df-xmul 13056 df-ico 13295 df-icc 13296 df-fz 13453 df-fzo 13600 df-fl 13742 df-seq 13955 df-exp 14015 df-hash 14284 df-shft 15020 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-limsup 15424 df-clim 15441 df-rlim 15442 df-sum 15640 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-starv 17226 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-unif 17234 df-hom 17235 df-cco 17236 df-rest 17376 df-topn 17377 df-0g 17395 df-gsum 17396 df-topgen 17397 df-pt 17398 df-prds 17401 df-xrs 17457 df-qtop 17462 df-imas 17463 df-xps 17465 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-mulg 19035 df-cntz 19283 df-cmn 19748 df-psmet 21336 df-xmet 21337 df-met 21338 df-bl 21339 df-mopn 21340 df-cnfld 21345 df-top 22869 df-topon 22886 df-topsp 22908 df-bases 22921 df-cld 22994 df-ntr 22995 df-cn 23202 df-cnp 23203 df-t1 23289 df-haus 23290 df-tx 23537 df-hmeo 23730 df-xms 24295 df-ms 24296 df-tms 24297 df-cncf 24855 df-ulm 26355 |
| This theorem is referenced by: leibpi 26919 |
| Copyright terms: Public domain | W3C validator |