| 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 13611 | . . . . . . 7 ⊢ (0[,]1) ⊆ ℝ | |
| 2 | ax-resscn 11238 | . . . . . . 7 ⊢ ℝ ⊆ ℂ | |
| 3 | 1, 2 | sstri 3940 | . . . . . 6 ⊢ (0[,]1) ⊆ ℂ |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝜑 → (0[,]1) ⊆ ℂ) |
| 5 | 1re 11289 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 6 | elicc01 13578 | . . . . . . . . . 10 ⊢ (𝑧 ∈ (0[,]1) ↔ (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) | |
| 7 | 6 | bilani 510 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) |
| 8 | 7 | simp1d 1160 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ ℝ) |
| 9 | resubcl 11603 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (1 − 𝑧) ∈ ℝ) | |
| 10 | 5, 8, 9 | sylancr 599 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℝ) |
| 11 | 10 | leidd 11863 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ≤ (1 − 𝑧)) |
| 12 | 1red 11290 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 1 ∈ ℝ) | |
| 13 | 7 | simp3d 1162 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ≤ 1) |
| 14 | 8, 12, 13 | abssubge0d 15581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) = (1 − 𝑧)) |
| 15 | 7 | simp2d 1161 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 0 ≤ 𝑧) |
| 16 | 8, 15 | absidd 15570 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘𝑧) = 𝑧) |
| 17 | 16 | oveq2d 7428 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − (abs‘𝑧)) = (1 − 𝑧)) |
| 18 | 17 | oveq2d 7428 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 · (1 − 𝑧))) |
| 19 | 10 | recnd 11318 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℂ) |
| 20 | 19 | mullidd 11308 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − 𝑧)) = (1 − 𝑧)) |
| 21 | 18, 20 | eqtrd 2796 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 − 𝑧)) |
| 22 | 11, 14, 21 | 3brtr4d 5137 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))) |
| 23 | 4, 22 | ssrabdv 4021 | . . . 4 ⊢ (𝜑 → (0[,]1) ⊆ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}) |
| 24 | 23 | resmptd 6034 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛)))) |
| 25 | abelth2.3 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 26 | 24, 25 | eqtr4di 2814 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = 𝐹) |
| 27 | abelth2.1 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) | |
| 28 | abelth2.2 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ ) | |
| 29 | 1red 11290 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 30 | 0le1 11820 | . . . . 5 ⊢ 0 ≤ 1 | |
| 31 | 30 | a1i 11 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 32 | eqid 2761 | . . . 4 ⊢ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} | |
| 33 | eqid 2761 | . . . 4 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) = (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 34 | 27, 28, 29, 31, 32, 33 | abelth 26750 | . . 3 ⊢ (𝜑 → (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ∈ ({𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}–cn→ℂ)) |
| 35 | rescncf 25198 | . . 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→ℂ))) | |
| 36 | 23, 34, 35 | sylc 66 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) ∈ ((0[,]1)–cn→ℂ)) |
| 37 | 26, 36 | eqeltrrd 2862 | 1 ⊢ (𝜑 → 𝐹 ∈ ((0[,]1)–cn→ℂ)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {crab 3413 ⊆ wss 3899 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 ↾ cres 5653 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 ℂcc 11179 ℝcr 11180 0cc0 11181 1c1 11182 + caddc 11184 · cmul 11186 ≤ cle 11325 − cmin 11522 ℕ0cn0 12587 [,]cicc 13460 seqcseq 14124 ↑cexp 14184 abscabs 15381 ⇝ cli 15631 Σcsu 15833 –cn→ccncf 25177 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 ax-addf 11260 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-map 8833 df-pm 8834 df-ixp 8910 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-fsupp 9338 df-fi 9387 df-sup 9418 df-inf 9419 df-oi 9488 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-5 12389 df-6 12390 df-7 12391 df-8 12392 df-9 12393 df-n0 12588 df-z 12675 df-dec 12796 df-uz 12947 df-q 13057 df-rp 13102 df-xneg 13222 df-xadd 13223 df-xmul 13224 df-ico 13463 df-icc 13464 df-fz 13621 df-fzo 13769 df-fl 13912 df-seq 14125 df-exp 14185 df-hash 14455 df-shft 15200 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-limsup 15618 df-clim 15635 df-rlim 15636 df-sum 15834 df-struct 17305 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-ress 17389 df-plusg 17421 df-mulr 17422 df-starv 17423 df-sca 17424 df-vsca 17425 df-ip 17426 df-tset 17427 df-ple 17428 df-ds 17430 df-unif 17431 df-hom 17432 df-cco 17433 df-rest 17573 df-topn 17574 df-0g 17592 df-gsum 17593 df-topgen 17594 df-pt 17595 df-prds 17598 df-xrs 17654 df-qtop 17659 df-imas 17660 df-xps 17662 df-mre 17736 df-mrc 17737 df-acs 17739 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-submnd 18959 df-mulg 19258 df-cntz 19511 df-cmn 19976 df-psmet 21650 df-xmet 21651 df-met 21652 df-bl 21653 df-mopn 21654 df-cnfld 21659 df-top 23192 df-topon 23209 df-topsp 23231 df-bases 23244 df-cld 23317 df-ntr 23318 df-cn 23525 df-cnp 23526 df-t1 23612 df-haus 23613 df-tx 23861 df-hmeo 24054 df-xms 24619 df-ms 24620 df-tms 24621 df-cncf 25179 df-ulm 26686 |
| This theorem is used by: leibpi 27252 |
| Copyright terms: Public domain | W3C validator |