| 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 2735 | . . 3 ⊢ (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))) | |
| 2 | 1 | dfitg 25722 | . 2 ⊢ ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) |
| 3 | fzfid 13991 | . . 3 ⊢ (𝜑 → (0...3) ∈ Fin) | |
| 4 | ax-icn 11188 | . . . . 5 ⊢ i ∈ ℂ | |
| 5 | elfznn0 13637 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℕ0) | |
| 6 | 5 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → 𝑘 ∈ ℕ0) |
| 7 | expcl 14097 | . . . . 5 ⊢ ((i ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (i↑𝑘) ∈ ℂ) | |
| 8 | 4, 6, 7 | sylancr 587 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (i↑𝑘) ∈ ℂ) |
| 9 | elfzelz 13541 | . . . . . 6 ⊢ (𝑘 ∈ (0...3) → 𝑘 ∈ ℤ) | |
| 10 | eqidd 2736 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) | |
| 11 | eqidd 2736 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘)))) | |
| 12 | itgcl.2 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 13 | itgmpt.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 14 | 10, 11, 12, 13 | iblitg 25721 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 15 | 9, 14 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℝ) |
| 16 | 15 | recnd 11263 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) ∈ ℂ) |
| 17 | 8, 16 | mulcld 11255 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...3)) → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 18 | 3, 17 | fsumcl 15749 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)))) ∈ ℂ) |
| 19 | 2, 18 | eqeltrid 2838 | 1 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 ∈ ℂ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 ifcif 4500 class class class wbr 5119 ↦ cmpt 5201 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 ℝcr 11128 0cc0 11129 ici 11131 · cmul 11134 ≤ cle 11270 / cdiv 11894 3c3 12296 ℕ0cn0 12501 ℤcz 12588 ...cfz 13524 ↑cexp 14079 ℜcre 15116 Σcsu 15702 ∫2citg2 25569 𝐿1cibl 25570 ∫citg 25571 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-inf 9455 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-fl 13809 df-mod 13887 df-seq 14020 df-exp 14080 df-hash 14349 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-sum 15703 df-ibl 25575 df-itg 25576 |
| This theorem is referenced by: itgneg 25757 itgaddlem2 25777 itgadd 25778 itgsub 25779 itgfsum 25780 itgmulc2lem2 25786 itgmulc2 25787 itgabs 25788 itgsplitioo 25791 ditgcl 25811 ditgswap 25812 ftc1lem1 25994 ftc1lem2 25995 ftc1a 25996 ftc1lem4 25998 ftc2 26003 itgparts 26006 itgsubstlem 26007 itgpowd 26009 itgulm 26369 itgaddnclem2 37703 itgaddnc 37704 itgsubnc 37706 itgmulc2nclem2 37711 itgmulc2nc 37712 itgabsnc 37713 ftc1cnnclem 37715 ftc1anc 37725 ftc2nc 37726 lcmineqlem10 42051 itgsinexplem1 45983 itgsinexp 45984 itgspltprt 46008 fourierdlem30 46166 fourierdlem47 46182 fourierdlem73 46208 fourierdlem83 46218 fourierdlem87 46222 fourierdlem95 46230 fourierdlem103 46238 fourierdlem104 46239 fourierdlem107 46242 fourierdlem112 46247 sqwvfoura 46257 etransclem23 46286 |
| Copyright terms: Public domain | W3C validator |