| 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 38874; cf. itgmulc2lem1 26207. (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 13625 | . . . . . . . 8 ⊢ (𝐵 ∈ (0[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) | |
| 4 | 1, 2, 3 | sylanbrc 595 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ (0[,)+∞)) |
| 5 | 0e0icopnf 13629 | . . . . . . . 8 ⊢ 0 ∈ (0[,)+∞) | |
| 6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞)) |
| 7 | 4, 6 | ifclda 4521 | . . . . . 6 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, 𝐵, 0) ∈ (0[,)+∞)) |
| 9 | 8 | fmpttd 7147 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)):ℝ⟶(0[,)+∞)) |
| 10 | itgmulc2nc.3 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿1) | |
| 11 | 1, 2 | iblpos 26168 | . . . . . 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 13625 | . . . . 5 ⊢ (𝐶 ∈ (0[,)+∞) ↔ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) | |
| 17 | 14, 15, 16 | sylanbrc 595 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (0[,)+∞)) |
| 18 | 9, 13, 17 | itg2mulc 26123 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 19 | reex 11330 | . . . . . . 7 ⊢ ℝ ∈ V | |
| 20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℝ ∈ V) |
| 21 | itgmulc2nc.1 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 22 | 21 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 23 | fconstmpt 5720 | . . . . . . 7 ⊢ (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (ℝ × {𝐶}) = (𝑥 ∈ ℝ ↦ 𝐶)) |
| 25 | eqidd 2764 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) | |
| 26 | 20, 22, 8, 24, 25 | offval2 7745 | . . . . 5 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 27 | ovif2 7550 | . . . . . . 7 ⊢ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) | |
| 28 | 21 | mul01d 11548 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 · 0) = 0) |
| 29 | 28 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · 0) = 0) |
| 30 | 29 | ifeq2d 4506 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), (𝐶 · 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 31 | 27, 30 | eqtrid 2810 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0)) = if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)) |
| 32 | 31 | mpteq2dva 5204 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (𝐶 · if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 33 | 26, 32 | eqtrd 2798 | . . . 4 ⊢ (𝜑 → ((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0))) |
| 34 | 33 | fveq2d 6920 | . . 3 ⊢ (𝜑 → (∫2‘((ℝ × {𝐶}) ∘f · (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 35 | 18, 34 | eqtr3d 2800 | . 2 ⊢ (𝜑 → (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 36 | 1, 10, 2 | itgposval 26171 | . . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0)))) |
| 37 | 36 | oveq2d 7467 | . 2 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = (𝐶 · (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, 𝐵, 0))))) |
| 38 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ) |
| 39 | 38, 1 | remulcld 11378 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℝ) |
| 40 | itgmulc2nc.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
| 41 | itgmulc2nc.m | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn) | |
| 42 | 21, 40, 10, 41 | iblmulc2nc 38871 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∈ 𝐿1) |
| 43 | 15 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ 𝐶) |
| 44 | 38, 1, 43, 2 | mulge0d 11933 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (𝐶 · 𝐵)) |
| 45 | 39, 42, 44 | itgposval 26171 | . 2 ⊢ (𝜑 → ∫𝐴(𝐶 · 𝐵) d𝑥 = (∫2‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (𝐶 · 𝐵), 0)))) |
| 46 | 35, 37, 45 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (𝐶 · ∫𝐴𝐵 d𝑥) = ∫𝐴(𝐶 · 𝐵) d𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ifcif 4485 {csn 4588 class class class wbr 5108 ↦ cmpt 5192 × cxp 5656 ‘cfv 6566 (class class class)co 7451 ∘f cof 7723 ℂcc 11237 ℝcr 11238 0cc0 11239 · cmul 11244 +∞cpnf 11379 ≤ cle 11383 [,)cico 13518 MblFncmbf 25990 ∫2citg2 25992 𝐿1cibl 25993 ∫citg 25994 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 ax-addf 11318 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-disj 5076 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-ofr 7726 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fi 9440 df-sup 9471 df-inf 9472 df-oi 9541 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-n0 12647 df-z 12734 df-uz 13006 df-q 13116 df-rp 13161 df-xneg 13281 df-xadd 13282 df-xmul 13283 df-ioo 13520 df-ico 13522 df-icc 13523 df-fz 13680 df-fzo 13829 df-fl 13972 df-mod 14050 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 df-sum 15898 df-rest 17643 df-topgen 17664 df-psmet 21721 df-xmet 21722 df-met 21723 df-bl 21724 df-mopn 21725 df-top 23267 df-topon 23284 df-bases 23319 df-cmp 23760 df-ovol 25840 df-vol 25841 df-mbf 25995 df-itg1 25996 df-itg2 25997 df-ibl 25998 df-itg 25999 df-0p 26046 |
| This theorem is used by: itgmulc2nclem2 38873 |
| Copyright terms: Public domain | W3C validator |