Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > itgspliticc | Structured version Visualization version GIF version |
Description: The ∫ integral splits on closed intervals with matching endpoints. (Contributed by Mario Carneiro, 13-Aug-2014.) |
Ref | Expression |
---|---|
itgspliticc.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
itgspliticc.2 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
itgspliticc.3 | ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐶)) |
itgspliticc.4 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐶)) → 𝐷 ∈ 𝑉) |
itgspliticc.5 | ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐷) ∈ 𝐿1) |
itgspliticc.6 | ⊢ (𝜑 → (𝑥 ∈ (𝐵[,]𝐶) ↦ 𝐷) ∈ 𝐿1) |
Ref | Expression |
---|---|
itgspliticc | ⊢ (𝜑 → ∫(𝐴[,]𝐶)𝐷 d𝑥 = (∫(𝐴[,]𝐵)𝐷 d𝑥 + ∫(𝐵[,]𝐶)𝐷 d𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | itgspliticc.1 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | 1 | rexrd 10089 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
3 | itgspliticc.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐶)) | |
4 | itgspliticc.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
5 | elicc2 12238 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ∈ (𝐴[,]𝐶) ↔ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶))) | |
6 | 1, 4, 5 | syl2anc 693 | . . . . . . . . 9 ⊢ (𝜑 → (𝐵 ∈ (𝐴[,]𝐶) ↔ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶))) |
7 | 3, 6 | mpbid 222 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶)) |
8 | 7 | simp1d 1073 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) |
9 | 8 | rexrd 10089 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
10 | 4 | rexrd 10089 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ℝ*) |
11 | df-icc 12182 | . . . . . . 7 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
12 | xrmaxle 12014 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑧 ∈ ℝ*) → (if(𝐴 ≤ 𝐵, 𝐵, 𝐴) ≤ 𝑧 ↔ (𝐴 ≤ 𝑧 ∧ 𝐵 ≤ 𝑧))) | |
13 | xrlemin 12015 | . . . . . . 7 ⊢ ((𝑧 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝑧 ≤ if(𝐵 ≤ 𝐶, 𝐵, 𝐶) ↔ (𝑧 ≤ 𝐵 ∧ 𝑧 ≤ 𝐶))) | |
14 | 11, 12, 13 | ixxin 12192 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶))) |
15 | 2, 9, 9, 10, 14 | syl22anc 1327 | . . . . 5 ⊢ (𝜑 → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶))) |
16 | 7 | simp2d 1074 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
17 | 16 | iftrued 4094 | . . . . . 6 ⊢ (𝜑 → if(𝐴 ≤ 𝐵, 𝐵, 𝐴) = 𝐵) |
18 | 7 | simp3d 1075 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ≤ 𝐶) |
19 | 18 | iftrued 4094 | . . . . . 6 ⊢ (𝜑 → if(𝐵 ≤ 𝐶, 𝐵, 𝐶) = 𝐵) |
20 | 17, 19 | oveq12d 6668 | . . . . 5 ⊢ (𝜑 → (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶)) = (𝐵[,]𝐵)) |
21 | iccid 12220 | . . . . . 6 ⊢ (𝐵 ∈ ℝ* → (𝐵[,]𝐵) = {𝐵}) | |
22 | 9, 21 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐵[,]𝐵) = {𝐵}) |
23 | 15, 20, 22 | 3eqtrd 2660 | . . . 4 ⊢ (𝜑 → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = {𝐵}) |
24 | 23 | fveq2d 6195 | . . 3 ⊢ (𝜑 → (vol*‘((𝐴[,]𝐵) ∩ (𝐵[,]𝐶))) = (vol*‘{𝐵})) |
25 | ovolsn 23263 | . . . 4 ⊢ (𝐵 ∈ ℝ → (vol*‘{𝐵}) = 0) | |
26 | 8, 25 | syl 17 | . . 3 ⊢ (𝜑 → (vol*‘{𝐵}) = 0) |
27 | 24, 26 | eqtrd 2656 | . 2 ⊢ (𝜑 → (vol*‘((𝐴[,]𝐵) ∩ (𝐵[,]𝐶))) = 0) |
28 | iccsplit 12305 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ (𝐴[,]𝐶)) → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))) | |
29 | 1, 4, 3, 28 | syl3anc 1326 | . 2 ⊢ (𝜑 → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))) |
30 | itgspliticc.4 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐶)) → 𝐷 ∈ 𝑉) | |
31 | itgspliticc.5 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐷) ∈ 𝐿1) | |
32 | itgspliticc.6 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝐵[,]𝐶) ↦ 𝐷) ∈ 𝐿1) | |
33 | 27, 29, 30, 31, 32 | itgsplit 23602 | 1 ⊢ (𝜑 → ∫(𝐴[,]𝐶)𝐷 d𝑥 = (∫(𝐴[,]𝐵)𝐷 d𝑥 + ∫(𝐵[,]𝐶)𝐷 d𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∪ cun 3572 ∩ cin 3573 ifcif 4086 {csn 4177 class class class wbr 4653 ↦ cmpt 4729 ‘cfv 5888 (class class class)co 6650 ℝcr 9935 0cc0 9936 + caddc 9939 ℝ*cxr 10073 ≤ cle 10075 [,]cicc 12178 vol*covol 23231 𝐿1cibl 23386 ∫citg 23387 |
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-ofr 6898 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-fi 8317 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-4 11081 df-n0 11293 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-ioo 12179 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-fl 12593 df-mod 12669 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-rest 16083 df-topgen 16104 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-top 20699 df-topon 20716 df-bases 20750 df-cmp 21190 df-ovol 23233 df-vol 23234 df-mbf 23388 df-itg1 23389 df-itg2 23390 df-ibl 23391 df-itg 23392 |
This theorem is referenced by: itgspltprt 40195 fourierdlem107 40430 |
Copyright terms: Public domain | W3C validator |