| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ditgcl | Structured version Visualization version GIF version | ||
| Description: Closure of a directed integral. (Contributed by Mario Carneiro, 13-Aug-2014.) |
| Ref | Expression |
|---|---|
| ditgcl.x | ⊢ (𝜑 → 𝑋 ∈ ℝ) |
| ditgcl.y | ⊢ (𝜑 → 𝑌 ∈ ℝ) |
| ditgcl.a | ⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌)) |
| ditgcl.b | ⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌)) |
| ditgcl.c | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(,)𝑌)) → 𝐶 ∈ 𝑉) |
| ditgcl.i | ⊢ (𝜑 → (𝑥 ∈ (𝑋(,)𝑌) ↦ 𝐶) ∈ 𝐿1) |
| Ref | Expression |
|---|---|
| ditgcl | ⊢ (𝜑 → ⨜[𝐴 → 𝐵]𝐶 d𝑥 ∈ ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ditgcl.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝑋[,]𝑌)) | |
| 2 | ditgcl.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ ℝ) | |
| 3 | ditgcl.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ ℝ) | |
| 4 | elicc2 13409 | . . . . 5 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌))) | |
| 5 | 2, 3, 4 | syl2anc 593 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ (𝑋[,]𝑌) ↔ (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌))) |
| 6 | 1, 5 | mpbid 234 | . . 3 ⊢ (𝜑 → (𝐴 ∈ ℝ ∧ 𝑋 ≤ 𝐴 ∧ 𝐴 ≤ 𝑌)) |
| 7 | 6 | simp1d 1154 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 8 | ditgcl.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (𝑋[,]𝑌)) | |
| 9 | elicc2 13409 | . . . . 5 ⊢ ((𝑋 ∈ ℝ ∧ 𝑌 ∈ ℝ) → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌))) | |
| 10 | 2, 3, 9 | syl2anc 593 | . . . 4 ⊢ (𝜑 → (𝐵 ∈ (𝑋[,]𝑌) ↔ (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌))) |
| 11 | 8, 10 | mpbid 234 | . . 3 ⊢ (𝜑 → (𝐵 ∈ ℝ ∧ 𝑋 ≤ 𝐵 ∧ 𝐵 ≤ 𝑌)) |
| 12 | 11 | simp1d 1154 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| 13 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
| 14 | 13 | ditgpos 25906 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]𝐶 d𝑥 = ∫(𝐴(,)𝐵)𝐶 d𝑥) |
| 15 | 2 | rexrd 11226 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ*) |
| 16 | 6 | simp2d 1155 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≤ 𝐴) |
| 17 | iooss1 13378 | . . . . . . . . 9 ⊢ ((𝑋 ∈ ℝ* ∧ 𝑋 ≤ 𝐴) → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵)) | |
| 18 | 15, 16, 17 | syl2anc 593 | . . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝐵)) |
| 19 | 3 | rexrd 11226 | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ ℝ*) |
| 20 | 11 | simp3d 1156 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≤ 𝑌) |
| 21 | iooss2 13379 | . . . . . . . . 9 ⊢ ((𝑌 ∈ ℝ* ∧ 𝐵 ≤ 𝑌) → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌)) | |
| 22 | 19, 20, 21 | syl2anc 593 | . . . . . . . 8 ⊢ (𝜑 → (𝑋(,)𝐵) ⊆ (𝑋(,)𝑌)) |
| 23 | 18, 22 | sstrd 3944 | . . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝑋(,)𝑌)) |
| 24 | 23 | sselda 3934 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ∈ (𝑋(,)𝑌)) |
| 25 | ditgcl.c | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(,)𝑌)) → 𝐶 ∈ 𝑉) | |
| 26 | 24, 25 | syldan 600 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ 𝑉) |
| 27 | ioombl 25615 | . . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol | |
| 28 | 27 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ dom vol) |
| 29 | ditgcl.i | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑋(,)𝑌) ↦ 𝐶) ∈ 𝐿1) | |
| 30 | 23, 28, 25, 29 | iblss 25855 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ 𝐶) ∈ 𝐿1) |
| 31 | 26, 30 | itgcl 25834 | . . . 4 ⊢ (𝜑 → ∫(𝐴(,)𝐵)𝐶 d𝑥 ∈ ℂ) |
| 32 | 31 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ∫(𝐴(,)𝐵)𝐶 d𝑥 ∈ ℂ) |
| 33 | 14, 32 | eqeltrd 2861 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≤ 𝐵) → ⨜[𝐴 → 𝐵]𝐶 d𝑥 ∈ ℂ) |
| 34 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴) | |
| 35 | 12 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ) |
| 36 | 7 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ) |
| 37 | 34, 35, 36 | ditgneg 25907 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ⨜[𝐴 → 𝐵]𝐶 d𝑥 = -∫(𝐵(,)𝐴)𝐶 d𝑥) |
| 38 | 11 | simp2d 1155 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ≤ 𝐵) |
| 39 | iooss1 13378 | . . . . . . . . . 10 ⊢ ((𝑋 ∈ ℝ* ∧ 𝑋 ≤ 𝐵) → (𝐵(,)𝐴) ⊆ (𝑋(,)𝐴)) | |
| 40 | 15, 38, 39 | syl2anc 593 | . . . . . . . . 9 ⊢ (𝜑 → (𝐵(,)𝐴) ⊆ (𝑋(,)𝐴)) |
| 41 | 6 | simp3d 1156 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≤ 𝑌) |
| 42 | iooss2 13379 | . . . . . . . . . 10 ⊢ ((𝑌 ∈ ℝ* ∧ 𝐴 ≤ 𝑌) → (𝑋(,)𝐴) ⊆ (𝑋(,)𝑌)) | |
| 43 | 19, 41, 42 | syl2anc 593 | . . . . . . . . 9 ⊢ (𝜑 → (𝑋(,)𝐴) ⊆ (𝑋(,)𝑌)) |
| 44 | 40, 43 | sstrd 3944 | . . . . . . . 8 ⊢ (𝜑 → (𝐵(,)𝐴) ⊆ (𝑋(,)𝑌)) |
| 45 | 44 | sselda 3934 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵(,)𝐴)) → 𝑥 ∈ (𝑋(,)𝑌)) |
| 46 | 45, 25 | syldan 600 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵(,)𝐴)) → 𝐶 ∈ 𝑉) |
| 47 | ioombl 25615 | . . . . . . . 8 ⊢ (𝐵(,)𝐴) ∈ dom vol | |
| 48 | 47 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝐵(,)𝐴) ∈ dom vol) |
| 49 | 44, 48, 25, 29 | iblss 25855 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐵(,)𝐴) ↦ 𝐶) ∈ 𝐿1) |
| 50 | 46, 49 | itgcl 25834 | . . . . 5 ⊢ (𝜑 → ∫(𝐵(,)𝐴)𝐶 d𝑥 ∈ ℂ) |
| 51 | 50 | negcld 11523 | . . . 4 ⊢ (𝜑 → -∫(𝐵(,)𝐴)𝐶 d𝑥 ∈ ℂ) |
| 52 | 51 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → -∫(𝐵(,)𝐴)𝐶 d𝑥 ∈ ℂ) |
| 53 | 37, 52 | eqeltrd 2861 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ⨜[𝐴 → 𝐵]𝐶 d𝑥 ∈ ℂ) |
| 54 | 7, 12, 33, 53 | lecasei 11283 | 1 ⊢ (𝜑 → ⨜[𝐴 → 𝐵]𝐶 d𝑥 ∈ ℂ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 ∈ wcel 2141 ⊆ wss 3902 class class class wbr 5097 ↦ cmpt 5178 dom cdm 5643 (class class class)co 7391 ℂcc 11065 ℝcr 11066 ℝ*cxr 11209 ≤ cle 11211 -cneg 11409 (,)cioo 13343 [,]cicc 13346 volcvol 25513 𝐿1cibl 25667 ∫citg 25668 ⨜cdit 25896 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-inf2 9590 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 ax-addf 11146 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-disj 5065 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-isom 6525 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-of 7655 df-ofr 7656 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-er 8672 df-map 8804 df-pm 8805 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-inf 9383 df-oi 9452 df-dju 9853 df-card 9891 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-n0 12476 df-z 12563 df-uz 12834 df-q 12944 df-rp 12988 df-xadd 13109 df-ioo 13347 df-ico 13349 df-icc 13350 df-fz 13507 df-fzo 13654 df-fl 13796 df-mod 13874 df-seq 14009 df-exp 14069 df-hash 14338 df-cj 15117 df-re 15118 df-im 15119 df-sqrt 15253 df-abs 15254 df-clim 15506 df-rlim 15507 df-sum 15705 df-xmet 21405 df-met 21406 df-ovol 25514 df-vol 25515 df-mbf 25669 df-itg1 25670 df-itg2 25671 df-ibl 25672 df-itg 25673 df-0p 25720 df-ditg 25897 |
| This theorem is referenced by: ditgsplit 25911 itgsubstlem 26098 |
| Copyright terms: Public domain | W3C validator |