![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sge0ss | Structured version Visualization version GIF version |
Description: Change the index set to a subset in a sum of nonnegative extended reals. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
Ref | Expression |
---|---|
sge0ss.kph | ⊢ Ⅎ𝑘𝜑 |
sge0ss.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
sge0ss.a | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
sge0ss.c | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (0[,]+∞)) |
sge0ss.c0 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 0) |
Ref | Expression |
---|---|
sge0ss | ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sge0ss.kph | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
2 | sge0ss.a | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
3 | sge0ss.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
4 | ssexg 4952 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) | |
5 | 2, 3, 4 | syl2anc 696 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ V) |
6 | difexg 4956 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → (𝐵 ∖ 𝐴) ∈ V) | |
7 | 3, 6 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝐴) ∈ V) |
8 | disjdif 4180 | . . . . 5 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅ | |
9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅) |
10 | sge0ss.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (0[,]+∞)) | |
11 | sge0ss.c0 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 0) | |
12 | 0e0iccpnf 12472 | . . . . . 6 ⊢ 0 ∈ (0[,]+∞) | |
13 | 12 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 0 ∈ (0[,]+∞)) |
14 | 11, 13 | eqeltrd 2835 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ (0[,]+∞)) |
15 | 1, 5, 7, 9, 10, 14 | sge0splitmpt 41127 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
16 | 15 | eqcomd 2762 | . 2 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
17 | 1, 11 | mpteq2da 4891 | . . . . . 6 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) |
18 | 17 | fveq2d 6352 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0))) |
19 | 1, 7 | sge0z 41091 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) = 0) |
20 | 18, 19 | eqtrd 2790 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = 0) |
21 | 20 | oveq2d 6825 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0)) |
22 | eqid 2756 | . . . . . 6 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶) | |
23 | 1, 10, 22 | fmptdf 6546 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶(0[,]+∞)) |
24 | 5, 23 | sge0xrcl 41101 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ*) |
25 | xaddid1 12261 | . . . 4 ⊢ ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ* → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
26 | 24, 25 | syl 17 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) |
27 | eqidd 2757 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
28 | 21, 26, 27 | 3eqtrrd 2795 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
29 | undif 4189 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) | |
30 | 2, 29 | sylib 208 | . . . . 5 ⊢ (𝜑 → (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) |
31 | 30 | eqcomd 2762 | . . . 4 ⊢ (𝜑 → 𝐵 = (𝐴 ∪ (𝐵 ∖ 𝐴))) |
32 | 31 | mpteq1d 4886 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) |
33 | 32 | fveq2d 6352 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
34 | 16, 28, 33 | 3eqtr4d 2800 | 1 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1628 Ⅎwnf 1853 ∈ wcel 2135 Vcvv 3336 ∖ cdif 3708 ∪ cun 3709 ∩ cin 3710 ⊆ wss 3711 ∅c0 4054 ↦ cmpt 4877 ‘cfv 6045 (class class class)co 6809 0cc0 10124 +∞cpnf 10259 ℝ*cxr 10261 +𝑒 cxad 12133 [,]cicc 12367 Σ^csumge0 41078 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1867 ax-4 1882 ax-5 1984 ax-6 2050 ax-7 2086 ax-8 2137 ax-9 2144 ax-10 2164 ax-11 2179 ax-12 2192 ax-13 2387 ax-ext 2736 ax-rep 4919 ax-sep 4929 ax-nul 4937 ax-pow 4988 ax-pr 5051 ax-un 7110 ax-inf2 8707 ax-cnex 10180 ax-resscn 10181 ax-1cn 10182 ax-icn 10183 ax-addcl 10184 ax-addrcl 10185 ax-mulcl 10186 ax-mulrcl 10187 ax-mulcom 10188 ax-addass 10189 ax-mulass 10190 ax-distr 10191 ax-i2m1 10192 ax-1ne0 10193 ax-1rid 10194 ax-rnegex 10195 ax-rrecex 10196 ax-cnre 10197 ax-pre-lttri 10198 ax-pre-lttrn 10199 ax-pre-ltadd 10200 ax-pre-mulgt0 10201 ax-pre-sup 10202 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1631 df-fal 1634 df-ex 1850 df-nf 1855 df-sb 2043 df-eu 2607 df-mo 2608 df-clab 2743 df-cleq 2749 df-clel 2752 df-nfc 2887 df-ne 2929 df-nel 3032 df-ral 3051 df-rex 3052 df-reu 3053 df-rmo 3054 df-rab 3055 df-v 3338 df-sbc 3573 df-csb 3671 df-dif 3714 df-un 3716 df-in 3718 df-ss 3725 df-pss 3727 df-nul 4055 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4585 df-int 4624 df-iun 4670 df-br 4801 df-opab 4861 df-mpt 4878 df-tr 4901 df-id 5170 df-eprel 5175 df-po 5183 df-so 5184 df-fr 5221 df-se 5222 df-we 5223 df-xp 5268 df-rel 5269 df-cnv 5270 df-co 5271 df-dm 5272 df-rn 5273 df-res 5274 df-ima 5275 df-pred 5837 df-ord 5883 df-on 5884 df-lim 5885 df-suc 5886 df-iota 6008 df-fun 6047 df-fn 6048 df-f 6049 df-f1 6050 df-fo 6051 df-f1o 6052 df-fv 6053 df-isom 6054 df-riota 6770 df-ov 6812 df-oprab 6813 df-mpt2 6814 df-om 7227 df-1st 7329 df-2nd 7330 df-wrecs 7572 df-recs 7633 df-rdg 7671 df-1o 7725 df-oadd 7729 df-er 7907 df-en 8118 df-dom 8119 df-sdom 8120 df-fin 8121 df-sup 8509 df-oi 8576 df-card 8951 df-pnf 10264 df-mnf 10265 df-xr 10266 df-ltxr 10267 df-le 10268 df-sub 10456 df-neg 10457 df-div 10873 df-nn 11209 df-2 11267 df-3 11268 df-n0 11481 df-z 11566 df-uz 11876 df-rp 12022 df-xadd 12136 df-ico 12370 df-icc 12371 df-fz 12516 df-fzo 12656 df-seq 12992 df-exp 13051 df-hash 13308 df-cj 14034 df-re 14035 df-im 14036 df-sqrt 14170 df-abs 14171 df-clim 14414 df-sum 14612 df-sumge0 41079 |
This theorem is referenced by: sge0fodjrnlem 41132 meadjiunlem 41181 ovnhoilem1 41317 ovnsubadd2lem 41361 |
Copyright terms: Public domain | W3C validator |