| 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 13493 | . . . . . . 7 ⊢ (0[,]1) ⊆ ℝ | |
| 2 | ax-resscn 11120 | . . . . . . 7 ⊢ ℝ ⊆ ℂ | |
| 3 | 1, 2 | sstri 3940 | . . . . . 6 ⊢ (0[,]1) ⊆ ℂ |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝜑 → (0[,]1) ⊆ ℂ) |
| 5 | 1re 11171 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 6 | elicc01 13460 | . . . . . . . . . 10 ⊢ (𝑧 ∈ (0[,]1) ↔ (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) | |
| 7 | 6 | bilani 507 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (𝑧 ∈ ℝ ∧ 0 ≤ 𝑧 ∧ 𝑧 ≤ 1)) |
| 8 | 7 | simp1d 1151 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ∈ ℝ) |
| 9 | resubcl 11485 | . . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (1 − 𝑧) ∈ ℝ) | |
| 10 | 5, 8, 9 | sylancr 595 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℝ) |
| 11 | 10 | leidd 11743 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ≤ (1 − 𝑧)) |
| 12 | 1red 11172 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 1 ∈ ℝ) | |
| 13 | 7 | simp3d 1153 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 𝑧 ≤ 1) |
| 14 | 8, 12, 13 | abssubge0d 15437 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) = (1 − 𝑧)) |
| 15 | 7 | simp2d 1152 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → 0 ≤ 𝑧) |
| 16 | 8, 15 | absidd 15426 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘𝑧) = 𝑧) |
| 17 | 16 | oveq2d 7401 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − (abs‘𝑧)) = (1 − 𝑧)) |
| 18 | 17 | oveq2d 7401 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 · (1 − 𝑧))) |
| 19 | 10 | recnd 11200 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 − 𝑧) ∈ ℂ) |
| 20 | 19 | mullidd 11190 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − 𝑧)) = (1 − 𝑧)) |
| 21 | 18, 20 | eqtrd 2791 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (1 · (1 − (abs‘𝑧))) = (1 − 𝑧)) |
| 22 | 11, 14, 21 | 3brtr4d 5126 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (0[,]1)) → (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))) |
| 23 | 4, 22 | ssrabdv 4021 | . . . 4 ⊢ (𝜑 → (0[,]1) ⊆ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}) |
| 24 | 23 | resmptd 6019 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛)))) |
| 25 | abelth2.3 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 26 | 24, 25 | eqtr4di 2809 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) = 𝐹) |
| 27 | abelth2.1 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) | |
| 28 | abelth2.2 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ ) | |
| 29 | 1red 11172 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 30 | 0le1 11700 | . . . . 5 ⊢ 0 ≤ 1 | |
| 31 | 30 | a1i 11 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 32 | eqid 2756 | . . . 4 ⊢ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} | |
| 33 | eqid 2756 | . . . 4 ⊢ (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) = (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) | |
| 34 | 27, 28, 29, 31, 32, 33 | abelth 26474 | . . 3 ⊢ (𝜑 → (𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ∈ ({𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))}–cn→ℂ)) |
| 35 | rescncf 24932 | . . 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 65 | . 2 ⊢ (𝜑 → ((𝑥 ∈ {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (1 · (1 − (abs‘𝑧)))} ↦ Σ𝑛 ∈ ℕ0 ((𝐴‘𝑛) · (𝑥↑𝑛))) ↾ (0[,]1)) ∈ ((0[,]1)–cn→ℂ)) |
| 37 | 26, 36 | eqeltrrd 2857 | 1 ⊢ (𝜑 → 𝐹 ∈ ((0[,]1)–cn→ℂ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 {crab 3408 ⊆ wss 3899 class class class wbr 5094 ↦ cmpt 5175 dom cdm 5640 ↾ cres 5642 ⟶wf 6506 ‘cfv 6510 (class class class)co 7385 ℂcc 11061 ℝcr 11062 0cc0 11063 1c1 11064 + caddc 11066 · cmul 11068 ≤ cle 11207 − cmin 11404 ℕ0cn0 12471 [,]cicc 13342 seqcseq 14004 ↑cexp 14064 abscabs 15237 ⇝ cli 15487 Σcsu 15689 –cn→ccncf 24911 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-inf2 9586 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-pre-sup 11141 ax-addf 11142 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-iin 4946 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-se 5594 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-isom 6519 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-of 7649 df-om 7836 df-1st 7959 df-2nd 7960 df-supp 8129 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-2o 8426 df-er 8666 df-map 8798 df-pm 8799 df-ixp 8869 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-fsupp 9298 df-fi 9347 df-sup 9378 df-inf 9379 df-oi 9448 df-card 9887 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-div 11835 df-nn 12201 df-2 12270 df-3 12271 df-4 12272 df-5 12273 df-6 12274 df-7 12275 df-8 12276 df-9 12277 df-n0 12472 df-z 12559 df-dec 12679 df-uz 12830 df-q 12940 df-rp 12984 df-xneg 13104 df-xadd 13105 df-xmul 13106 df-ico 13345 df-icc 13346 df-fz 13503 df-fzo 13650 df-fl 13792 df-seq 14005 df-exp 14065 df-hash 14334 df-shft 15070 df-cj 15102 df-re 15103 df-im 15104 df-sqrt 15238 df-abs 15239 df-limsup 15474 df-clim 15491 df-rlim 15492 df-sum 15690 df-struct 17159 df-sets 17176 df-slot 17194 df-ndx 17206 df-base 17222 df-ress 17243 df-plusg 17275 df-mulr 17276 df-starv 17277 df-sca 17278 df-vsca 17279 df-ip 17280 df-tset 17281 df-ple 17282 df-ds 17284 df-unif 17285 df-hom 17286 df-cco 17287 df-rest 17427 df-topn 17428 df-0g 17446 df-gsum 17447 df-topgen 17448 df-pt 17449 df-prds 17452 df-xrs 17508 df-qtop 17513 df-imas 17514 df-xps 17516 df-mre 17590 df-mrc 17591 df-acs 17593 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-submnd 18794 df-mulg 19086 df-cntz 19333 df-cmn 19798 df-psmet 21389 df-xmet 21390 df-met 21391 df-bl 21392 df-mopn 21393 df-cnfld 21398 df-top 22927 df-topon 22944 df-topsp 22966 df-bases 22979 df-cld 23052 df-ntr 23053 df-cn 23260 df-cnp 23261 df-t1 23347 df-haus 23348 df-tx 23595 df-hmeo 23788 df-xms 24353 df-ms 24354 df-tms 24355 df-cncf 24913 df-ulm 26410 |
| This theorem is referenced by: leibpi 26977 |
| Copyright terms: Public domain | W3C validator |