![]() |
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 2798 | . . 3 ⊢ (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))) | |
2 | 1 | dfitg 24373 | . 2 ⊢ ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) |
3 | fzfid 13336 | . . 3 ⊢ (𝜑 → (0...3) ∈ Fin) | |
4 | ax-icn 10585 | . . . . 5 ⊢ i ∈ ℂ | |
5 | elfznn0 12995 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ0) | |
6 | 5 | adantl 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → 𝑘 ∈ ℕ0) |
7 | expcl 13443 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (i↑𝑘) ∈ ℂ) | |
8 | 4, 6, 7 | sylancr 590 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (i↑𝑘) ∈ ℂ) |
9 | elfzelz 12902 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ) | |
10 | eqidd 2799 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) | |
11 | eqidd 2799 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘)))) | |
12 | itgcl.2 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
13 | itgmpt.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
14 | 10, 11, 12, 13 | iblitg 24372 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
15 | 9, 14 | sylan2 595 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
16 | 15 | recnd 10658 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ) |
17 | 8, 16 | mulcld 10650 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
18 | 3, 17 | fsumcl 15082 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
19 | 2, 18 | eqeltrid 2894 | 1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 ifcif 4425 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 ℝcr 10525 0cc0 10526 ici 10528 · cmul 10531 ≤ cle 10665 / cdiv 11286 3c3 11681 ℕ0cn0 11885 ℤcz 11969 ...cfz 12885 ↑cexp 13425 ℜcre 14448 Σcsu 15034 ∫2citg2 24220 𝐿1cibl 24221 ∫citg 24222 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-inf2 9088 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-oi 8958 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-fl 13157 df-mod 13233 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-sum 15035 df-ibl 24226 df-itg 24227 |
This theorem is referenced by: itgneg 24407 itgaddlem2 24427 itgadd 24428 itgsub 24429 itgfsum 24430 itgmulc2lem2 24436 itgmulc2 24437 itgabs 24438 itgsplitioo 24441 ditgcl 24461 ditgswap 24462 ftc1lem1 24638 ftc1lem2 24639 ftc1a 24640 ftc1lem4 24642 ftc2 24647 itgparts 24650 itgsubstlem 24651 itgpowd 24653 itgulm 25003 itgaddnclem2 35116 itgaddnc 35117 itgsubnc 35119 itgmulc2nclem2 35124 itgmulc2nc 35125 itgabsnc 35126 ftc1cnnclem 35128 ftc1anc 35138 ftc2nc 35139 lcmineqlem10 39326 itgsinexplem1 42596 itgsinexp 42597 itgspltprt 42621 fourierdlem30 42779 fourierdlem47 42795 fourierdlem73 42821 fourierdlem83 42831 fourierdlem87 42835 fourierdlem95 42843 fourierdlem103 42851 fourierdlem104 42852 fourierdlem107 42855 fourierdlem112 42860 sqwvfoura 42870 etransclem23 42899 |
Copyright terms: Public domain | W3C validator |