| 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 5292 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) | |
| 5 | 2, 3, 4 | syl2anc 596 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ V) |
| 6 | 3 | difexd 5304 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝐴) ∈ V) |
| 7 | disjdif 4433 | . . . . 5 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅ | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅) |
| 9 | sge0ss.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (0[,]+∞)) | |
| 10 | sge0ss.c0 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 0) | |
| 11 | 0e0iccpnf 13498 | . . . . . 6 ⊢ 0 ∈ (0[,]+∞) | |
| 12 | 11 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 0 ∈ (0[,]+∞)) |
| 13 | 10, 12 | eqeltrd 2865 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ (0[,]+∞)) |
| 14 | 1, 5, 6, 8, 9, 13 | sge0splitmpt 47158 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
| 15 | 14 | eqcomd 2771 | . 2 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
| 16 | 1, 10 | mpteq2da 5205 | . . . . . 6 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) |
| 17 | 16 | fveq2d 6889 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0))) |
| 18 | 1, 6 | sge0z 47122 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) = 0) |
| 19 | 17, 18 | eqtrd 2800 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = 0) |
| 20 | 19 | oveq2d 7432 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0)) |
| 21 | eqid 2765 | . . . . . 6 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶) | |
| 22 | 1, 9, 21 | fmptdf 7116 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶(0[,]+∞)) |
| 23 | 5, 22 | sge0xrcl 47132 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ*) |
| 24 | xaddrid 13279 | . . . 4 ⊢ ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ* → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
| 25 | 23, 24 | syl 18 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) |
| 26 | eqidd 2766 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
| 27 | 20, 25, 26 | 3eqtrrd 2805 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +𝑒 (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
| 28 | undif 4445 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) | |
| 29 | 2, 28 | sylib 221 | . . . . 5 ⊢ (𝜑 → (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) |
| 30 | 29 | eqcomd 2771 | . . . 4 ⊢ (𝜑 → 𝐵 = (𝐴 ∪ (𝐵 ∖ 𝐴))) |
| 31 | 30 | mpteq1d 5203 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) |
| 32 | 31 | fveq2d 6889 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
| 33 | 15, 27, 32 | 3eqtr4d 2810 | 1 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2146 Vcvv 3457 ∖ cdif 3903 ∪ cun 3904 ∩ cin 3905 ⊆ wss 3906 ∅c0 4286 ↦ cmpt 5194 ‘cfv 6540 (class class class)co 7416 0cc0 11111 +∞cpnf 11251 ℝ*cxr 11253 +𝑒 cxad 13147 [,]cicc 13387 Σ^csumge0 47109 |
| 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 7738 ax-inf2 9613 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 |
| 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-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 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-sup 9405 df-oi 9475 df-card 9937 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12875 df-rp 13029 df-xadd 13150 df-ico 13390 df-icc 13391 df-fz 13548 df-fzo 13696 df-seq 14052 df-exp 14112 df-hash 14381 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307 df-clim 15559 df-sum 15758 df-sumge0 47110 |
| This theorem is used by: sge0fodjrnlem 47163 meadjiunlem 47212 ovnhoilem1 47348 ovnsubadd2lem 47392 |
| Copyright terms: Public domain | W3C validator |