Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > itgmulc2lem1 | Structured version Visualization version GIF version |
Description: Lemma for itgmulc2 24361: positive real case. (Contributed by Mario Carneiro, 25-Aug-2014.) |
Ref | Expression |
---|---|
itgmulc2.1 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
itgmulc2.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
itgmulc2.3 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) |
itgmulc2.4 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
itgmulc2.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
itgmulc2.6 | ⊢ (𝜑 → 0 ≤ 𝐶) |
itgmulc2.7 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐵) |
Ref | Expression |
---|---|
itgmulc2lem1 | ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | itgmulc2.5 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) | |
2 | itgmulc2.7 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐵) | |
3 | elrege0 12830 | . . . . . . . 8 ⊢ (𝐵 ∈ (0[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) | |
4 | 1, 2, 3 | sylanbrc 583 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (0[,)+∞)) |
5 | 0e0icopnf 12834 | . . . . . . . 8 ⊢ 0 ∈ (0[,)+∞) | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞)) |
7 | 4, 6 | ifclda 4497 | . . . . . 6 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
8 | 7 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
9 | 8 | fmpttd 6871 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)):ℝ⟶(0[,)+∞)) |
10 | itgmulc2.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
11 | 1, 2 | iblpos 24320 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ))) |
12 | 10, 11 | mpbid 233 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ)) |
13 | 12 | simprd 496 | . . . 4 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ) |
14 | itgmulc2.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
15 | itgmulc2.6 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝐶) | |
16 | elrege0 12830 | . . . . 5 ⊢ (𝐶 ∈ (0[,)+∞) ↔ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) | |
17 | 14, 15, 16 | sylanbrc 583 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (0[,)+∞)) |
18 | 9, 13, 17 | itg2mulc 24275 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
19 | reex 10616 | . . . . . . 7 ⊢ ℝ ∈ V | |
20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ∈ V) |
21 | 14 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐶 ∈ ℝ) |
22 | fconstmpt 5607 | . . . . . . 7 ⊢ (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶) | |
23 | 22 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶)) |
24 | eqidd 2819 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) | |
25 | 20, 21, 8, 23, 24 | offval2 7415 | . . . . 5 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
26 | ovif2 7241 | . . . . . . 7 ⊢ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) | |
27 | itgmulc2.1 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
28 | 27 | mul01d 10827 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 · 0) = 0) |
29 | 28 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · 0) = 0) |
30 | 29 | ifeq2d 4482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
31 | 26, 30 | syl5eq 2865 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
32 | 31 | mpteq2dva 5152 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
33 | 25, 32 | eqtrd 2853 | . . . 4 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
34 | 33 | fveq2d 6667 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
35 | 18, 34 | eqtr3d 2855 | . 2 ⊢ (𝜑 → (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
36 | 1, 10, 2 | itgposval 24323 | . . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
37 | 36 | oveq2d 7161 | . 2 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
38 | 14 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
39 | 38, 1 | remulcld 10659 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℝ) |
40 | itgmulc2.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
41 | 27, 40, 10 | iblmulc2 24358 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1) |
42 | 15 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐶) |
43 | 38, 1, 42, 2 | mulge0d 11205 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (𝐶 · 𝐵)) |
44 | 39, 41, 43 | itgposval 24323 | . 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
45 | 35, 37, 44 | 3eqtr4d 2863 | 1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 Vcvv 3492 ifcif 4463 {csn 4557 class class class wbr 5057 ↦ cmpt 5137 × cxp 5546 ‘cfv 6348 (class class class)co 7145 ∘f cof 7396 ℂcc 10523 ℝcr 10524 0cc0 10525 · cmul 10530 +∞cpnf 10660 ≤ cle 10664 [,)cico 12728 MblFncmbf 24142 ∫2citg2 24144 𝐿1cibl 24145 ∫citg 24146 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cc 9845 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 ax-addf 10604 ax-mulf 10605 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-disj 5023 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-ofr 7399 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-omul 8096 df-er 8278 df-map 8397 df-pm 8398 df-ixp 8450 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-fi 8863 df-sup 8894 df-inf 8895 df-oi 8962 df-dju 9318 df-card 9356 df-acn 9359 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-q 12337 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-ioo 12730 df-ioc 12731 df-ico 12732 df-icc 12733 df-fz 12881 df-fzo 13022 df-fl 13150 df-mod 13226 df-seq 13358 df-exp 13418 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-rlim 14834 df-sum 15031 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-mulr 16567 df-starv 16568 df-sca 16569 df-vsca 16570 df-ip 16571 df-tset 16572 df-ple 16573 df-ds 16575 df-unif 16576 df-hom 16577 df-cco 16578 df-rest 16684 df-topn 16685 df-0g 16703 df-gsum 16704 df-topgen 16705 df-pt 16706 df-prds 16709 df-xrs 16763 df-qtop 16768 df-imas 16769 df-xps 16771 df-mre 16845 df-mrc 16846 df-acs 16848 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-submnd 17945 df-mulg 18163 df-cntz 18385 df-cmn 18837 df-psmet 20465 df-xmet 20466 df-met 20467 df-bl 20468 df-mopn 20469 df-cnfld 20474 df-top 21430 df-topon 21447 df-topsp 21469 df-bases 21482 df-cn 21763 df-cnp 21764 df-cmp 21923 df-tx 22098 df-hmeo 22291 df-xms 22857 df-ms 22858 df-tms 22859 df-cncf 23413 df-ovol 23992 df-vol 23993 df-mbf 24147 df-itg1 24148 df-itg2 24149 df-ibl 24150 df-itg 24151 df-0p 24198 |
This theorem is referenced by: itgmulc2lem2 24360 |
Copyright terms: Public domain | W3C validator |