| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itgcl | Structured version Visualization version GIF version | ||
| Description: The integral of an integrable function is a complex number. This is Metamath 100 proof #86. (Contributed by Mario Carneiro, 29-Jun-2014.) |
| Ref | Expression |
|---|---|
| itgmpt.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
| itgcl.2 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) |
| Ref | Expression |
|---|---|
| itgcl | ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2731 | . . 3 ⊢ (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))) | |
| 2 | 1 | dfitg 25695 | . 2 ⊢ ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) |
| 3 | fzfid 13877 | . . 3 ⊢ (𝜑 → (0...3) ∈ Fin) | |
| 4 | ax-icn 11062 | . . . . 5 ⊢ i ∈ ℂ | |
| 5 | elfznn0 13517 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ0) | |
| 6 | 5 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → 𝑘 ∈ ℕ0) |
| 7 | expcl 13983 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (i↑𝑘) ∈ ℂ) | |
| 8 | 4, 6, 7 | sylancr 587 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (i↑𝑘) ∈ ℂ) |
| 9 | elfzelz 13421 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ) | |
| 10 | eqidd 2732 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) | |
| 11 | eqidd 2732 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘)))) | |
| 12 | itgcl.2 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 13 | itgmpt.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 14 | 10, 11, 12, 13 | iblitg 25694 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 15 | 9, 14 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 16 | 15 | recnd 11137 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ) |
| 17 | 8, 16 | mulcld 11129 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 18 | 3, 17 | fsumcl 15637 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 19 | 2, 18 | eqeltrid 2835 | 1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2111 ifcif 4475 class class class wbr 5091 ↦ cmpt 5172 ‘cfv 6481 (class class class)co 7346 ℂcc 11001 ℝcr 11002 0cc0 11003 ici 11005 · cmul 11008 ≤ cle 11144 / cdiv 11771 3c3 12178 ℕ0cn0 12378 ℤcz 12465 ...cfz 13404 ↑cexp 13965 ℜcre 15001 Σcsu 15590 ∫2citg2 25542 𝐿1cibl 25543 ∫citg 25544 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-inf2 9531 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 ax-pre-sup 11081 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-inf 9327 df-oi 9396 df-card 9829 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-div 11772 df-nn 12123 df-2 12185 df-3 12186 df-4 12187 df-n0 12379 df-z 12466 df-uz 12730 df-rp 12888 df-fz 13405 df-fzo 13552 df-fl 13693 df-mod 13771 df-seq 13906 df-exp 13966 df-hash 14235 df-cj 15003 df-re 15004 df-im 15005 df-sqrt 15139 df-abs 15140 df-clim 15392 df-sum 15591 df-ibl 25548 df-itg 25549 |
| This theorem is referenced by: itgneg 25730 itgaddlem2 25750 itgadd 25751 itgsub 25752 itgfsum 25753 itgmulc2lem2 25759 itgmulc2 25760 itgabs 25761 itgsplitioo 25764 ditgcl 25784 ditgswap 25785 ftc1lem1 25967 ftc1lem2 25968 ftc1a 25969 ftc1lem4 25971 ftc2 25976 itgparts 25979 itgsubstlem 25980 itgpowd 25982 itgulm 26342 itgaddnclem2 37718 itgaddnc 37719 itgsubnc 37721 itgmulc2nclem2 37726 itgmulc2nc 37727 itgabsnc 37728 ftc1cnnclem 37730 ftc1anc 37740 ftc2nc 37741 lcmineqlem10 42070 itgsinexplem1 45991 itgsinexp 45992 itgspltprt 46016 fourierdlem30 46174 fourierdlem47 46190 fourierdlem73 46216 fourierdlem83 46226 fourierdlem87 46230 fourierdlem95 46238 fourierdlem103 46246 fourierdlem104 46247 fourierdlem107 46250 fourierdlem112 46255 sqwvfoura 46265 etransclem23 46294 |
| Copyright terms: Public domain | W3C validator |