| 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 5288 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) | |
| 5 | 2, 3, 4 | syl2anc 596 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ V) |
| 6 | 3 | difexd 5300 | . . . 4 ⊢ (𝜑 → (𝐵 ∖ 𝐴) ∈ V) |
| 7 | disjdif 4429 | . . . . 5 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅ | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ (𝐵 ∖ 𝐴)) = ∅) |
| 9 | sge0ss.c | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (0[,]+∞)) | |
| 10 | sge0ss.c0 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 0) | |
| 11 | 0e0iccpnf 13630 | . . . . . 6 ⊢ 0 ∈ (0[,]+∞) | |
| 12 | 11 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 0 ∈ (0[,]+∞)) |
| 13 | 10, 12 | eqeltrd 2864 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ (0[,]+∞)) |
| 14 | 1, 5, 6, 8, 9, 13 | sge0splitmpt 47694 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
| 15 | 14 | eqcomd 2769 | . 2 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
| 16 | 1, 10 | mpteq2da 5203 | . . . . . 6 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) |
| 17 | 16 | fveq2d 6920 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0))) |
| 18 | 1, 6 | sge0z 47658 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 0)) = 0) |
| 19 | 17, 18 | eqtrd 2798 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)) = 0) |
| 20 | 19 | oveq2d 7467 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e 0)) |
| 21 | eqid 2763 | . . . . . 6 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶) | |
| 22 | 1, 9, 21 | fmptdf 7149 | . . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶(0[,]+∞)) |
| 23 | 5, 22 | sge0xrcl 47668 | . . . 4 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ*) |
| 24 | xaddrid 13411 | . . . 4 ⊢ ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) ∈ ℝ* → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
| 25 | 23, 24 | syl 18 | . . 3 ⊢ (𝜑 → ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e 0) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) |
| 26 | eqidd 2764 | . . 3 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶))) | |
| 27 | 20, 25, 26 | 3eqtrrd 2803 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = ((Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) +e (Σ^‘(𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)))) |
| 28 | undif 4441 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) | |
| 29 | 2, 28 | sylib 221 | . . . . 5 ⊢ (𝜑 → (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵) |
| 30 | 29 | eqcomd 2769 | . . . 4 ⊢ (𝜑 → 𝐵 = (𝐴 ∪ (𝐵 ∖ 𝐴))) |
| 31 | 30 | mpteq1d 5201 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶)) |
| 32 | 31 | fveq2d 6920 | . 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴)) ↦ 𝐶))) |
| 33 | 15, 27, 32 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝐴 ↦ 𝐶)) = (Σ^‘(𝑘 ∈ 𝐵 ↦ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∪ cun 4152 ∅c0 4281 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 0cc0 11239 +∞cpnf 11379 ℝ*cxr 11381 +e cxad 13279 [,]cicc 13519 Σ^csumge0 47645 |
| 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 |
| 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-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-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-oi 9541 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-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-xadd 13282 df-ico 13522 df-icc 13523 df-fz 13680 df-fzo 13829 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-sumge0 47646 |
| This theorem is used by: sge0fodjrnlem 47699 meadjiunlem 47748 ovnhoilem1 47884 ovnsubadd2lem 47928 |
| Copyright terms: Public domain | W3C validator |