![]() |
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‘(𝐹 ∘𝑓 − 𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 473 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → 𝐹 ∈ dom ∫1) | |
2 | simpr 477 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → 𝐺 ∈ dom ∫1) | |
3 | neg1rr 11125 | . . . . . 6 ⊢ -1 ∈ ℝ | |
4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → -1 ∈ ℝ) |
5 | 2, 4 | i1fmulc 23470 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((ℝ × {-1}) ∘𝑓 · 𝐺) ∈ dom ∫1) |
6 | 1, 5 | itg1add 23468 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺))) = ((∫1‘𝐹) + (∫1‘((ℝ × {-1}) ∘𝑓 · 𝐺)))) |
7 | 2, 4 | itg1mulc 23471 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘((ℝ × {-1}) ∘𝑓 · 𝐺)) = (-1 · (∫1‘𝐺))) |
8 | itg1cl 23452 | . . . . . . . 8 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℝ) | |
9 | 8 | recnd 10068 | . . . . . . 7 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℂ) |
10 | 2, 9 | syl 17 | . . . . . 6 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘𝐺) ∈ ℂ) |
11 | 10 | mulm1d 10482 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (-1 · (∫1‘𝐺)) = -(∫1‘𝐺)) |
12 | 7, 11 | eqtrd 2656 | . . . 4 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘((ℝ × {-1}) ∘𝑓 · 𝐺)) = -(∫1‘𝐺)) |
13 | 12 | oveq2d 6666 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((∫1‘𝐹) + (∫1‘((ℝ × {-1}) ∘𝑓 · 𝐺))) = ((∫1‘𝐹) + -(∫1‘𝐺))) |
14 | 6, 13 | eqtrd 2656 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺))) = ((∫1‘𝐹) + -(∫1‘𝐺))) |
15 | i1ff 23443 | . . . . 5 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
16 | ax-resscn 9993 | . . . . 5 ⊢ ℝ ⊆ ℂ | |
17 | fss 6056 | . . . . 5 ⊢ ((𝐹:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:ℝ⟶ℂ) | |
18 | 15, 16, 17 | sylancl 694 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℂ) |
19 | i1ff 23443 | . . . . 5 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ) | |
20 | fss 6056 | . . . . 5 ⊢ ((𝐺:ℝ⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐺:ℝ⟶ℂ) | |
21 | 19, 16, 20 | sylancl 694 | . . . 4 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℂ) |
22 | reex 10027 | . . . . 5 ⊢ ℝ ∈ V | |
23 | ofnegsub 11018 | . . . . 5 ⊢ ((ℝ ∈ V ∧ 𝐹:ℝ⟶ℂ ∧ 𝐺:ℝ⟶ℂ) → (𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺)) = (𝐹 ∘𝑓 − 𝐺)) | |
24 | 22, 23 | mp3an1 1411 | . . . 4 ⊢ ((𝐹:ℝ⟶ℂ ∧ 𝐺:ℝ⟶ℂ) → (𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺)) = (𝐹 ∘𝑓 − 𝐺)) |
25 | 18, 21, 24 | syl2an 494 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺)) = (𝐹 ∘𝑓 − 𝐺)) |
26 | 25 | fveq2d 6195 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘𝑓 + ((ℝ × {-1}) ∘𝑓 · 𝐺))) = (∫1‘(𝐹 ∘𝑓 − 𝐺))) |
27 | itg1cl 23452 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
28 | 27 | recnd 10068 | . . 3 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℂ) |
29 | negsub 10329 | . . 3 ⊢ (((∫1‘𝐹) ∈ ℂ ∧ (∫1‘𝐺) ∈ ℂ) → ((∫1‘𝐹) + -(∫1‘𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) | |
30 | 28, 9, 29 | syl2an 494 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → ((∫1‘𝐹) + -(∫1‘𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
31 | 14, 26, 30 | 3eqtr3d 2664 | 1 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝐺 ∈ dom ∫1) → (∫1‘(𝐹 ∘𝑓 − 𝐺)) = ((∫1‘𝐹) − (∫1‘𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ⊆ wss 3574 {csn 4177 × cxp 5112 dom cdm 5114 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ∘𝑓 cof 6895 ℂcc 9934 ℝcr 9935 1c1 9937 + caddc 9939 · cmul 9941 − cmin 10266 -cneg 10267 ∫1citg1 23384 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-disj 4621 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-xadd 11947 df-ioo 12179 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-fl 12593 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-xmet 19739 df-met 19740 df-ovol 23233 df-vol 23234 df-mbf 23388 df-itg1 23389 |
This theorem is referenced by: itg1lea 23479 itgitg1 23575 itg2addnclem 33461 |
Copyright terms: Public domain | W3C validator |