![]() |
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 11210 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
3 | itgspliticc.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐶)) | |
4 | itgspliticc.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
5 | elicc2 13335 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ∈ (𝐴[,]𝐶) ↔ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶))) | |
6 | 1, 4, 5 | syl2anc 585 | . . . . . . . . 9 ⊢ (𝜑 → (𝐵 ∈ (𝐴[,]𝐶) ↔ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶))) |
7 | 3, 6 | mpbid 231 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶)) |
8 | 7 | simp1d 1143 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) |
9 | 8 | rexrd 11210 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
10 | 4 | rexrd 11210 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ ℝ*) |
11 | df-icc 13277 | . . . . . . 7 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
12 | xrmaxle 13108 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑧 ∈ ℝ*) → (if(𝐴 ≤ 𝐵, 𝐵, 𝐴) ≤ 𝑧 ↔ (𝐴 ≤ 𝑧 ∧ 𝐵 ≤ 𝑧))) | |
13 | xrlemin 13109 | . . . . . . 7 ⊢ ((𝑧 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝑧 ≤ if(𝐵 ≤ 𝐶, 𝐵, 𝐶) ↔ (𝑧 ≤ 𝐵 ∧ 𝑧 ≤ 𝐶))) | |
14 | 11, 12, 13 | ixxin 13287 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*)) → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶))) |
15 | 2, 9, 9, 10, 14 | syl22anc 838 | . . . . 5 ⊢ (𝜑 → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶))) |
16 | 7 | simp2d 1144 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
17 | 16 | iftrued 4495 | . . . . . 6 ⊢ (𝜑 → if(𝐴 ≤ 𝐵, 𝐵, 𝐴) = 𝐵) |
18 | 7 | simp3d 1145 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ≤ 𝐶) |
19 | 18 | iftrued 4495 | . . . . . 6 ⊢ (𝜑 → if(𝐵 ≤ 𝐶, 𝐵, 𝐶) = 𝐵) |
20 | 17, 19 | oveq12d 7376 | . . . . 5 ⊢ (𝜑 → (if(𝐴 ≤ 𝐵, 𝐵, 𝐴)[,]if(𝐵 ≤ 𝐶, 𝐵, 𝐶)) = (𝐵[,]𝐵)) |
21 | iccid 13315 | . . . . . 6 ⊢ (𝐵 ∈ ℝ* → (𝐵[,]𝐵) = {𝐵}) | |
22 | 9, 21 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐵[,]𝐵) = {𝐵}) |
23 | 15, 20, 22 | 3eqtrd 2777 | . . . 4 ⊢ (𝜑 → ((𝐴[,]𝐵) ∩ (𝐵[,]𝐶)) = {𝐵}) |
24 | 23 | fveq2d 6847 | . . 3 ⊢ (𝜑 → (vol*‘((𝐴[,]𝐵) ∩ (𝐵[,]𝐶))) = (vol*‘{𝐵})) |
25 | ovolsn 24875 | . . . 4 ⊢ (𝐵 ∈ ℝ → (vol*‘{𝐵}) = 0) | |
26 | 8, 25 | syl 17 | . . 3 ⊢ (𝜑 → (vol*‘{𝐵}) = 0) |
27 | 24, 26 | eqtrd 2773 | . 2 ⊢ (𝜑 → (vol*‘((𝐴[,]𝐵) ∩ (𝐵[,]𝐶))) = 0) |
28 | iccsplit 13408 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ (𝐴[,]𝐶)) → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))) | |
29 | 1, 4, 3, 28 | syl3anc 1372 | . 2 ⊢ (𝜑 → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))) |
30 | itgspliticc.4 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐶)) → 𝐷 ∈ 𝑉) | |
31 | itgspliticc.5 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐷) ∈ 𝐿1) | |
32 | itgspliticc.6 | . 2 ⊢ (𝜑 → (𝑥 ∈ (𝐵[,]𝐶) ↦ 𝐷) ∈ 𝐿1) | |
33 | 27, 29, 30, 31, 32 | itgsplit 25216 | 1 ⊢ (𝜑 → ∫(𝐴[,]𝐶)𝐷 d𝑥 = (∫(𝐴[,]𝐵)𝐷 d𝑥 + ∫(𝐵[,]𝐶)𝐷 d𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∪ cun 3909 ∩ cin 3910 ifcif 4487 {csn 4587 class class class wbr 5106 ↦ cmpt 5189 ‘cfv 6497 (class class class)co 7358 ℝcr 11055 0cc0 11056 + caddc 11059 ℝ*cxr 11193 ≤ cle 11195 [,]cicc 13273 vol*covol 24842 𝐿1cibl 24997 ∫citg 24998 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5243 ax-sep 5257 ax-nul 5264 ax-pow 5321 ax-pr 5385 ax-un 7673 ax-inf2 9582 ax-cnex 11112 ax-resscn 11113 ax-1cn 11114 ax-icn 11115 ax-addcl 11116 ax-addrcl 11117 ax-mulcl 11118 ax-mulrcl 11119 ax-mulcom 11120 ax-addass 11121 ax-mulass 11122 ax-distr 11123 ax-i2m1 11124 ax-1ne0 11125 ax-1rid 11126 ax-rnegex 11127 ax-rrecex 11128 ax-cnre 11129 ax-pre-lttri 11130 ax-pre-lttrn 11131 ax-pre-ltadd 11132 ax-pre-mulgt0 11133 ax-pre-sup 11134 ax-addf 11135 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3930 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-int 4909 df-iun 4957 df-disj 5072 df-br 5107 df-opab 5169 df-mpt 5190 df-tr 5224 df-id 5532 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5589 df-se 5590 df-we 5591 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 6254 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6499 df-fn 6500 df-f 6501 df-f1 6502 df-fo 6503 df-f1o 6504 df-fv 6505 df-isom 6506 df-riota 7314 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7618 df-ofr 7619 df-om 7804 df-1st 7922 df-2nd 7923 df-frecs 8213 df-wrecs 8244 df-recs 8318 df-rdg 8357 df-1o 8413 df-2o 8414 df-er 8651 df-map 8770 df-pm 8771 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fi 9352 df-sup 9383 df-inf 9384 df-oi 9451 df-dju 9842 df-card 9880 df-pnf 11196 df-mnf 11197 df-xr 11198 df-ltxr 11199 df-le 11200 df-sub 11392 df-neg 11393 df-div 11818 df-nn 12159 df-2 12221 df-3 12222 df-4 12223 df-n0 12419 df-z 12505 df-uz 12769 df-q 12879 df-rp 12921 df-xneg 13038 df-xadd 13039 df-xmul 13040 df-ioo 13274 df-ico 13276 df-icc 13277 df-fz 13431 df-fzo 13574 df-fl 13703 df-mod 13781 df-seq 13913 df-exp 13974 df-hash 14237 df-cj 14990 df-re 14991 df-im 14992 df-sqrt 15126 df-abs 15127 df-clim 15376 df-sum 15577 df-rest 17309 df-topgen 17330 df-psmet 20804 df-xmet 20805 df-met 20806 df-bl 20807 df-mopn 20808 df-top 22259 df-topon 22276 df-bases 22312 df-cmp 22754 df-ovol 24844 df-vol 24845 df-mbf 24999 df-itg1 25000 df-itg2 25001 df-ibl 25002 df-itg 25003 |
This theorem is referenced by: itgspltprt 44306 fourierdlem107 44540 |
Copyright terms: Public domain | W3C validator |