| 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 13427 | . . . . . . 7 ⊢ (0[,]1) ⊆ ℝ | |
| 2 | ax-resscn 11095 | . . . . . . 7 ⊢ ℝ ⊆ ℂ | |
| 3 | 1, 2 | sstri 3945 | . . . . . 6 ⊢ (0[,]1) ⊆ ℂ |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝜑 → (0[,]1) ⊆ ℂ) |
| 5 | 1re 11144 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 6 | simpr 484 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ (0[,]1)) | |
| 7 | elicc01 13394 | . . . . . . . . . 10 ⊢ (𝑧 ∈ (0[,]1) ↔ (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) | |
| 8 | 6, 7 | sylib 218 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) |
| 9 | 8 | simp1d 1143 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ ℝ) |
| 10 | resubcl 11457 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (1 − 𝑧) ∈ ℝ) | |
| 11 | 5, 9, 10 | sylancr 588 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℝ) |
| 12 | 11 | leidd 11715 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ≤ (1 − 𝑧)) |
| 13 | 1red 11145 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 1 ∈ ℝ) | |
| 14 | 8 | simp3d 1145 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ≤ 1) |
| 15 | 9, 13, 14 | abssubge0d 15369 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) = (1 − 𝑧)) |
| 16 | 8 | simp2d 1144 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 0 ≤ 𝑧) |
| 17 | 9, 16 | absidd 15358 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘𝑧) = 𝑧) |
| 18 | 17 | oveq2d 7384 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − (abs‘𝑧)) = (1 − 𝑧)) |
| 19 | 18 | oveq2d 7384 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 · (1 − 𝑧))) |
| 20 | 11 | recnd 11172 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℂ) |
| 21 | 20 | mullidd 11162 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − 𝑧)) = (1 − 𝑧)) |
| 22 | 19, 21 | eqtrd 2772 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 − 𝑧)) |
| 23 | 12, 15, 22 | 3brtr4d 5132 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))) |
| 24 | 4, 23 | ssrabdv 4027 | . . . 4 ⊢ (𝜑 → (0[,]1) ⊆ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}) |
| 25 | 24 | resmptd 6007 | . . 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 11145 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 31 | 0le1 11672 | . . . . 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 24858 | . . 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 3401 ⊆ wss 3903 class class class wbr 5100 ↦ cmpt 5181 dom cdm 5632 ↾ cres 5634 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 ≤ cle 11179 − cmin 11376 ℕ0cn0 12413 [,]cicc 13276 seqcseq 13936 ↑cexp 13996 abscabs 15169 ⇝ cli 15419 Σcsu 15621 –cn→ccncf 24837 |
| 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 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-om 7819 df-1st 7943 df-2nd 7944 df-supp 8113 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-pm 8778 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9277 df-fi 9326 df-sup 9357 df-inf 9358 df-oi 9427 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-q 12874 df-rp 12918 df-xneg 13038 df-xadd 13039 df-xmul 13040 df-ico 13279 df-icc 13280 df-fz 13436 df-fzo 13583 df-fl 13724 df-seq 13937 df-exp 13997 df-hash 14266 df-shft 15002 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-limsup 15406 df-clim 15423 df-rlim 15424 df-sum 15622 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-starv 17204 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-unif 17212 df-hom 17213 df-cco 17214 df-rest 17354 df-topn 17355 df-0g 17373 df-gsum 17374 df-topgen 17375 df-pt 17376 df-prds 17379 df-xrs 17435 df-qtop 17440 df-imas 17441 df-xps 17443 df-mre 17517 df-mrc 17518 df-acs 17520 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-submnd 18721 df-mulg 19010 df-cntz 19258 df-cmn 19723 df-psmet 21313 df-xmet 21314 df-met 21315 df-bl 21316 df-mopn 21317 df-cnfld 21322 df-top 22850 df-topon 22867 df-topsp 22889 df-bases 22902 df-cld 22975 df-ntr 22976 df-cn 23183 df-cnp 23184 df-t1 23270 df-haus 23271 df-tx 23518 df-hmeo 23711 df-xms 24276 df-ms 24277 df-tms 24278 df-cncf 24839 df-ulm 26354 |
| This theorem is referenced by: leibpi 26920 |
| Copyright terms: Public domain | W3C validator |