| Mathbox for Brendan Leahy |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > itgmulc2nclem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for itgmulc2nc 38743; cf. itgmulc2lem1 26161. (Contributed by Brendan Leahy, 17-Nov-2017.) |
| Ref | Expression |
|---|---|
| itgmulc2nc.1 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| itgmulc2nc.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
| itgmulc2nc.3 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) |
| itgmulc2nc.m | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn) |
| itgmulc2nc.4 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| itgmulc2nc.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
| itgmulc2nc.6 | ⊢ (𝜑 → 0 ≤ 𝐶) |
| itgmulc2nc.7 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐵) |
| Ref | Expression |
|---|---|
| itgmulc2nclem1 | ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itgmulc2nc.5 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) | |
| 2 | itgmulc2nc.7 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐵) | |
| 3 | elrege0 13592 | . . . . . . . 8 ⊢ (𝐵 ∈ (0[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) | |
| 4 | 1, 2, 3 | sylanbrc 595 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (0[,)+∞)) |
| 5 | 0e0icopnf 13596 | . . . . . . . 8 ⊢ 0 ∈ (0[,)+∞) | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞)) |
| 7 | 4, 6 | ifclda 4517 | . . . . . 6 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 9 | 8 | fmpttd 7120 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)):ℝ⟶(0[,)+∞)) |
| 10 | itgmulc2nc.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 11 | 1, 2 | iblpos 26122 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ))) |
| 12 | 10, 11 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ)) |
| 13 | 12 | simprd 501 | . . . 4 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ) |
| 14 | itgmulc2nc.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 15 | itgmulc2nc.6 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝐶) | |
| 16 | elrege0 13592 | . . . . 5 ⊢ (𝐶 ∈ (0[,)+∞) ↔ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) | |
| 17 | 14, 15, 16 | sylanbrc 595 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (0[,)+∞)) |
| 18 | 9, 13, 17 | itg2mulc 26077 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 19 | reex 11298 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ∈ V) |
| 21 | itgmulc2nc.1 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 22 | 21 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 23 | fconstmpt 5713 | . . . . . . 7 ⊢ (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶)) |
| 25 | eqidd 2761 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) | |
| 26 | 20, 22, 8, 24, 25 | offval2 7717 | . . . . 5 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 27 | ovif2 7523 | . . . . . . 7 ⊢ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) | |
| 28 | 21 | mul01d 11516 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 · 0) = 0) |
| 29 | 28 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · 0) = 0) |
| 30 | 29 | ifeq2d 4502 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 31 | 27, 30 | eqtrid 2807 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 32 | 31 | mpteq2dva 5197 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 33 | 26, 32 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 34 | 33 | fveq2d 6894 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 35 | 18, 34 | eqtr3d 2797 | . 2 ⊢ (𝜑 → (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 36 | 1, 10, 2 | itgposval 26125 | . . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 37 | 36 | oveq2d 7440 | . 2 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 38 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
| 39 | 38, 1 | remulcld 11346 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℝ) |
| 40 | itgmulc2nc.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 41 | itgmulc2nc.m | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn) | |
| 42 | 21, 40, 10, 41 | iblmulc2nc 38740 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1) |
| 43 | 15 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐶) |
| 44 | 38, 1, 43, 2 | mulge0d 11900 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (𝐶 · 𝐵)) |
| 45 | 39, 42, 44 | itgposval 26125 | . 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 46 | 35, 37, 45 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ifcif 4481 {csn 4584 class class class wbr 5102 ↦ cmpt 5185 × cxp 5649 ‘cfv 6543 (class class class)co 7424 ∘f cof 7695 ℂcc 11205 ℝcr 11206 0cc0 11207 · cmul 11212 +∞cpnf 11347 ≤ cle 11351 [,)cico 13485 MblFncmbf 25944 ∫2citg2 25946 𝐿1cibl 25947 ∫citg 25948 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-inf2 9649 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 ax-addf 11286 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-disj 5070 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-of 7697 df-ofr 7698 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-map 8857 df-pm 8858 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-fi 9410 df-sup 9441 df-inf 9442 df-oi 9511 df-dju 9989 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-n0 12614 df-z 12701 df-uz 12973 df-q 13083 df-rp 13128 df-xneg 13248 df-xadd 13249 df-xmul 13250 df-ioo 13487 df-ico 13489 df-icc 13490 df-fz 13647 df-fzo 13796 df-fl 13939 df-mod 14017 df-seq 14152 df-exp 14212 df-hash 14482 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-clim 15664 df-sum 15863 df-rest 17602 df-topgen 17623 df-psmet 21679 df-xmet 21680 df-met 21681 df-bl 21682 df-mopn 21683 df-top 23221 df-topon 23238 df-bases 23273 df-cmp 23714 df-ovol 25794 df-vol 25795 df-mbf 25949 df-itg1 25950 df-itg2 25951 df-ibl 25952 df-itg 25953 df-0p 26000 |
| This theorem is used by: itgmulc2nclem2 38742 |
| Copyright terms: Public domain | W3C validator |