| 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 38396; cf. itgmulc2lem1 26042. (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 13497 | . . . . . . . 8 ⊢ (𝐵 ∈ (0[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) | |
| 4 | 1, 2, 3 | sylanbrc 595 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (0[,)+∞)) |
| 5 | 0e0icopnf 13501 | . . . . . . . 8 ⊢ 0 ∈ (0[,)+∞) | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞)) |
| 7 | 4, 6 | ifclda 4525 | . . . . . 6 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 9 | 8 | fmpttd 7114 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)):ℝ⟶(0[,)+∞)) |
| 10 | itgmulc2nc.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 11 | 1, 2 | iblpos 26003 | . . . . . 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 13497 | . . . . 5 ⊢ (𝐶 ∈ (0[,)+∞) ↔ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) | |
| 17 | 14, 15, 16 | sylanbrc 595 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (0[,)+∞)) |
| 18 | 9, 13, 17 | itg2mulc 25957 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 19 | reex 11206 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ∈ V) |
| 21 | itgmulc2nc.1 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 22 | 21 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 23 | fconstmpt 5725 | . . . . . . 7 ⊢ (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶)) |
| 25 | eqidd 2766 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) | |
| 26 | 20, 22, 8, 24, 25 | offval2 7704 | . . . . 5 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 27 | ovif2 7518 | . . . . . . 7 ⊢ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) | |
| 28 | 21 | mul01d 11424 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 · 0) = 0) |
| 29 | 28 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · 0) = 0) |
| 30 | 29 | ifeq2d 4510 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 31 | 27, 30 | eqtrid 2812 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 32 | 31 | mpteq2dva 5206 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 33 | 26, 32 | eqtrd 2800 | . . . 4 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 34 | 33 | fveq2d 6889 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 35 | 18, 34 | eqtr3d 2802 | . 2 ⊢ (𝜑 → (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 36 | 1, 10, 2 | itgposval 26006 | . . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 37 | 36 | oveq2d 7435 | . 2 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 38 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
| 39 | 38, 1 | remulcld 11254 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℝ) |
| 40 | itgmulc2nc.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 41 | itgmulc2nc.m | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn) | |
| 42 | 21, 40, 10, 41 | iblmulc2nc 38393 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1) |
| 43 | 15 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐶) |
| 44 | 38, 1, 43, 2 | mulge0d 11806 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (𝐶 · 𝐵)) |
| 45 | 39, 42, 44 | itgposval 26006 | . 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 46 | 35, 37, 45 | 3eqtr4d 2810 | 1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ifcif 4489 {csn 4591 class class class wbr 5111 ↦ cmpt 5194 × cxp 5661 ‘cfv 6540 (class class class)co 7419 ∘f cof 7682 ℂcc 11113 ℝcr 11114 0cc0 11115 · cmul 11120 +∞cpnf 11255 ≤ cle 11259 [,)cico 13390 MblFncmbf 25824 ∫2citg2 25826 𝐿1cibl 25827 ∫citg 25828 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 ax-addf 11194 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-disj 5079 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 df-ofr 7685 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fi 9378 df-sup 9409 df-inf 9410 df-oi 9479 df-dju 9903 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-n0 12520 df-z 12607 df-uz 12879 df-q 12989 df-rp 13033 df-xneg 13153 df-xadd 13154 df-xmul 13155 df-ioo 13392 df-ico 13394 df-icc 13395 df-fz 13552 df-fzo 13700 df-fl 13843 df-mod 13921 df-seq 14056 df-exp 14116 df-hash 14385 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-clim 15563 df-sum 15762 df-rest 17497 df-topgen 17518 df-psmet 21564 df-xmet 21565 df-met 21566 df-bl 21567 df-mopn 21568 df-top 23101 df-topon 23118 df-bases 23153 df-cmp 23594 df-ovol 25674 df-vol 25675 df-mbf 25829 df-itg1 25830 df-itg2 25831 df-ibl 25832 df-itg 25833 df-0p 25880 |
| This theorem is used by: itgmulc2nclem2 38395 |
| Copyright terms: Public domain | W3C validator |