| 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 2763 | . . 3 ⊢ (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))) | |
| 2 | 1 | dfitg 25909 | . 2 ⊢ ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) |
| 3 | fzfid 14011 | . . 3 ⊢ (𝜑 → (0...3) ∈ Fin) | |
| 4 | ax-icn 11160 | . . . . 5 ⊢ i ∈ ℂ | |
| 5 | elfznn0 13650 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ0) | |
| 6 | 5 | adantl 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → 𝑘 ∈ ℕ0) |
| 7 | expcl 14117 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (i↑𝑘) ∈ ℂ) | |
| 8 | 4, 6, 7 | sylancr 598 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (i↑𝑘) ∈ ℂ) |
| 9 | elfzelz 13553 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ) | |
| 10 | eqidd 2764 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) | |
| 11 | eqidd 2764 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘)))) | |
| 12 | itgcl.2 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 13 | itgmpt.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 14 | 10, 11, 12, 13 | iblitg 25908 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 15 | 9, 14 | sylan2 604 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 16 | 15 | recnd 11238 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ) |
| 17 | 8, 16 | mulcld 11230 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 18 | 3, 17 | fsumcl 15786 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 19 | 2, 18 | eqeltrid 2867 | 1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2143 ifcif 4488 class class class wbr 5110 ↦ cmpt 5193 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 ℝcr 11100 0cc0 11101 ici 11103 · cmul 11106 ≤ cle 11245 / cdiv 11872 3c3 12297 ℕ0cn0 12505 ℤcz 12592 ...cfz 13536 ↑cexp 14099 ℜcre 15150 Σcsu 15739 ∫2citg2 25756 𝐿1cibl 25757 ∫citg 25758 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-inf 9404 df-oi 9473 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fzo 13685 df-fl 13827 df-mod 13905 df-seq 14040 df-exp 14100 df-hash 14369 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-sum 15740 df-ibl 25762 df-itg 25763 |
| This theorem is referenced by: itgneg 25944 itgaddlem2 25964 itgadd 25965 itgsub 25966 itgfsum 25967 itgmulc2lem2 25973 itgmulc2 25974 itgabs 25975 itgsplitioo 25978 ditgcl 25998 ditgswap 25999 ftc1lem1 26175 ftc1lem2 26176 ftc1a 26177 ftc1lem4 26179 ftc2 26184 itgparts 26187 itgsubstlem 26188 itgpowd 26190 itgulm 26549 itgaddnclem2 38308 itgaddnc 38309 itgsubnc 38311 itgmulc2nclem2 38316 itgmulc2nc 38317 itgabsnc 38318 ftc1cnnclem 38320 ftc1anc 38330 ftc2nc 38331 lcmineqlem10 42783 itgsinexplem1 46648 itgsinexp 46649 itgspltprt 46673 fourierdlem30 46831 fourierdlem47 46847 fourierdlem73 46873 fourierdlem83 46883 fourierdlem87 46887 fourierdlem95 46895 fourierdlem103 46903 fourierdlem104 46904 fourierdlem107 46907 fourierdlem112 46912 sqwvfoura 46922 etransclem23 46951 |
| Copyright terms: Public domain | W3C validator |