| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1sub | Structured version Visualization version GIF version | ||
| Description: The integral of a difference of two simple functions. (Contributed by Mario Carneiro, 6-Aug-2014.) |
| Ref | Expression |
|---|---|
| itg1sub | ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘f − 𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → 𝐹 ∈ dom ∫1) | |
| 2 | simpr 484 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → 𝐺 ∈ dom ∫1) | |
| 3 | neg1rr 12145 | . . . . . 6 ⊢ -1 ∈ ℝ | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → -1 ∈ ℝ) |
| 5 | 2, 4 | i1fmulc 25677 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((ℝ × {-1}) ∘f · 𝐺) ∈ dom ∫1) |
| 6 | 1, 5 | itg1add 25675 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘f + ((ℝ × {-1}) ∘f · 𝐺))) = ((∫1‘𝐹) + (∫1‘((ℝ × {-1}) ∘f · 𝐺)))) |
| 7 | 2, 4 | itg1mulc 25678 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘((ℝ × {-1}) ∘f · 𝐺)) = (-1 · (∫1‘𝐺))) |
| 8 | itg1cl 25659 | . . . . . . . 8 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℝ) | |
| 9 | 8 | recnd 11174 | . . . . . . 7 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℂ) |
| 10 | 2, 9 | syl 17 | . . . . . 6 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘𝐺) ∈ ℂ) |
| 11 | 10 | mulm1d 11603 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (-1 · (∫1‘𝐺)) = -(∫1‘𝐺)) |
| 12 | 7, 11 | eqtrd 2772 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘((ℝ × {-1}) ∘f · 𝐺)) = -(∫1‘𝐺)) |
| 13 | 12 | oveq2d 7386 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((∫1‘𝐹) + (∫1‘((ℝ × {-1}) ∘f · 𝐺))) = ((∫1‘𝐹) + -(∫1‘𝐺))) |
| 14 | 6, 13 | eqtrd 2772 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘f + ((ℝ × {-1}) ∘f · 𝐺))) = ((∫1‘𝐹) + -(∫1‘𝐺))) |
| 15 | reex 11131 | . . . 4 ⊢ ℝ ∈ V | |
| 16 | i1ff 25650 | . . . . 5 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 17 | ax-resscn 11097 | . . . . 5 ⊢ ℝ ⊆ ℂ | |
| 18 | fss 6688 | . . . . 5 ⊢ ((𝐹:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:ℝ⟶ℂ) | |
| 19 | 16, 17, 18 | sylancl 587 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℂ) |
| 20 | i1ff 25650 | . . . . 5 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ) | |
| 21 | fss 6688 | . . . . 5 ⊢ ((𝐺:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐺:ℝ⟶ℂ) | |
| 22 | 20, 17, 21 | sylancl 587 | . . . 4 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℂ) |
| 23 | ofnegsub 12157 | . . . 4 ⊢ ((ℝ ∈ V ∧ 𝐹:ℝ⟶ℂ ∧ 𝐺:ℝ⟶ℂ) → (𝐹 ∘f + ((ℝ × {-1}) ∘f · 𝐺)) = (𝐹 ∘f − 𝐺)) | |
| 24 | 15, 19, 22, 23 | mp3an3an 1470 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (𝐹 ∘f + ((ℝ × {-1}) ∘f · 𝐺)) = (𝐹 ∘f − 𝐺)) |
| 25 | 24 | fveq2d 6848 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘f + ((ℝ × {-1}) ∘f · 𝐺))) = (∫1‘(𝐹 ∘f − 𝐺))) |
| 26 | itg1cl 25659 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 27 | 26 | recnd 11174 | . . 3 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℂ) |
| 28 | negsub 11443 | . . 3 ⊢ (((∫1‘𝐹) ∈ ℂ ∧ (∫1‘𝐺) ∈ ℂ) → ((∫1‘𝐹) + -(∫1‘𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) | |
| 29 | 27, 9, 28 | syl2an 597 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((∫1‘𝐹) + -(∫1‘𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
| 30 | 14, 25, 29 | 3eqtr3d 2780 | 1 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘f − 𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ⊆ wss 3903 {csn 4582 × cxp 5632 dom cdm 5634 ⟶wf 6498 ‘cfv 6502 (class class class)co 7370 ∘f cof 7632 ℂcc 11038 ℝcr 11039 1c1 11041 + caddc 11043 · cmul 11045 − cmin 11378 -cneg 11379 ∫1citg1 25589 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-inf2 9564 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-pre-sup 11118 ax-addf 11119 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-disj 5068 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-of 7634 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-map 8779 df-pm 8780 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-sup 9359 df-inf 9360 df-oi 9429 df-dju 9827 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-n0 12416 df-z 12503 df-uz 12766 df-q 12876 df-rp 12920 df-xadd 13041 df-ioo 13279 df-ico 13281 df-icc 13282 df-fz 13438 df-fzo 13585 df-fl 13726 df-seq 13939 df-exp 13999 df-hash 14268 df-cj 15036 df-re 15037 df-im 15038 df-sqrt 15172 df-abs 15173 df-clim 15425 df-sum 15624 df-xmet 21319 df-met 21320 df-ovol 25438 df-vol 25439 df-mbf 25593 df-itg1 25594 |
| This theorem is referenced by: itg1lea 25686 itgitg1 25783 itg2addnclem 37951 |
| Copyright terms: Public domain | W3C validator |