| 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 37828; cf. itgmulc2lem1 25787. (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 13368 | . . . . . . . 8 ⊢ (𝐵 ∈ (0[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) | |
| 4 | 1, 2, 3 | sylanbrc 583 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (0[,)+∞)) |
| 5 | 0e0icopnf 13372 | . . . . . . . 8 ⊢ 0 ∈ (0[,)+∞) | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞)) |
| 7 | 4, 6 | ifclda 4513 | . . . . . 6 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 8 | 7 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 9 | 8 | fmpttd 7058 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)):ℝ⟶(0[,)+∞)) |
| 10 | itgmulc2nc.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 11 | 1, 2 | iblpos 25748 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1 ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ))) |
| 12 | 10, 11 | mpbid 232 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ)) |
| 13 | 12 | simprd 495 | . . . 4 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) ∈ ℝ) |
| 14 | itgmulc2nc.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 15 | itgmulc2nc.6 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝐶) | |
| 16 | elrege0 13368 | . . . . 5 ⊢ (𝐶 ∈ (0[,)+∞) ↔ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) | |
| 17 | 14, 15, 16 | sylanbrc 583 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (0[,)+∞)) |
| 18 | 9, 13, 17 | itg2mulc 25702 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 19 | reex 11115 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ∈ V) |
| 21 | itgmulc2nc.1 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 22 | 21 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 23 | fconstmpt 5684 | . . . . . . 7 ⊢ (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶)) |
| 25 | eqidd 2735 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) | |
| 26 | 20, 22, 8, 24, 25 | offval2 7640 | . . . . 5 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 27 | ovif2 7455 | . . . . . . 7 ⊢ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) | |
| 28 | 21 | mul01d 11330 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 · 0) = 0) |
| 29 | 28 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · 0) = 0) |
| 30 | 29 | ifeq2d 4498 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 31 | 27, 30 | eqtrid 2781 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 32 | 31 | mpteq2dva 5189 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 33 | 26, 32 | eqtrd 2769 | . . . 4 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 34 | 33 | fveq2d 6836 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 35 | 18, 34 | eqtr3d 2771 | . 2 ⊢ (𝜑 → (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 36 | 1, 10, 2 | itgposval 25751 | . . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 37 | 36 | oveq2d 7372 | . 2 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 38 | 14 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
| 39 | 38, 1 | remulcld 11160 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℝ) |
| 40 | itgmulc2nc.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 41 | itgmulc2nc.m | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn) | |
| 42 | 21, 40, 10, 41 | iblmulc2nc 37825 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1) |
| 43 | 15 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐶) |
| 44 | 38, 1, 43, 2 | mulge0d 11712 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (𝐶 · 𝐵)) |
| 45 | 39, 42, 44 | itgposval 25751 | . 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 46 | 35, 37, 45 | 3eqtr4d 2779 | 1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ifcif 4477 {csn 4578 class class class wbr 5096 ↦ cmpt 5177 × cxp 5620 ‘cfv 6490 (class class class)co 7356 ∘f cof 7618 ℂcc 11022 ℝcr 11023 0cc0 11024 · cmul 11029 +∞cpnf 11161 ≤ cle 11165 [,)cico 13261 MblFncmbf 25569 ∫2citg2 25571 𝐿1cibl 25572 ∫citg 25573 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-inf2 9548 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 ax-pre-sup 11102 ax-addf 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-disj 5064 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-ofr 7621 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8763 df-pm 8764 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-fi 9312 df-sup 9343 df-inf 9344 df-oi 9413 df-dju 9811 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-n0 12400 df-z 12487 df-uz 12750 df-q 12860 df-rp 12904 df-xneg 13024 df-xadd 13025 df-xmul 13026 df-ioo 13263 df-ico 13265 df-icc 13266 df-fz 13422 df-fzo 13569 df-fl 13710 df-mod 13788 df-seq 13923 df-exp 13983 df-hash 14252 df-cj 15020 df-re 15021 df-im 15022 df-sqrt 15156 df-abs 15157 df-clim 15409 df-sum 15608 df-rest 17340 df-topgen 17361 df-psmet 21299 df-xmet 21300 df-met 21301 df-bl 21302 df-mopn 21303 df-top 22836 df-topon 22853 df-bases 22888 df-cmp 23329 df-ovol 25419 df-vol 25420 df-mbf 25574 df-itg1 25575 df-itg2 25576 df-ibl 25577 df-itg 25578 df-0p 25625 |
| This theorem is referenced by: itgmulc2nclem2 37827 |
| Copyright terms: Public domain | W3C validator |