| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gsummptfidmsplitres | GIF version | ||
| Description: Split a group sum expressed as mapping with a finite domain into two parts using restrictions. (Contributed by AV, 23-Jul-2019.) |
| Ref | Expression |
|---|---|
| gsummptfidmsplit.b | ⊢ 𝐵 = (Base‘𝐺) |
| gsummptfidmsplit.p | ⊢ + = (+g‘𝐺) |
| gsummptfidmsplit.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
| gsummptfidmsplit.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| gsummptfidmsplit.y | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑌 ∈ 𝐵) |
| gsummptfidmsplit.i | ⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅) |
| gsummptfidmsplit.u | ⊢ (𝜑 → 𝐴 = (𝐶 ∪ 𝐷)) |
| gsummptfidmsplitres.f | ⊢ 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑌) |
| Ref | Expression |
|---|---|
| gsummptfidmsplitres | ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐺 Σg (𝐹 ↾ 𝐶)) + (𝐺 Σg (𝐹 ↾ 𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummptfidmsplit.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | gsummptfidmsplit.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | gsummptfidmsplit.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
| 4 | gsummptfidmsplit.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 5 | gsummptfidmsplit.y | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑌 ∈ 𝐵) | |
| 6 | gsummptfidmsplit.i | . . 3 ⊢ (𝜑 → (𝐶 ∩ 𝐷) = ∅) | |
| 7 | gsummptfidmsplit.u | . . 3 ⊢ (𝜑 → 𝐴 = (𝐶 ∪ 𝐷)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | gsummptfidmsplit 14254 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)) = ((𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑌)) + (𝐺 Σg (𝑘 ∈ 𝐷 ↦ 𝑌)))) |
| 9 | gsummptfidmsplitres.f | . . . 4 ⊢ 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑌) | |
| 10 | 9 | oveq2i 6099 | . . 3 ⊢ (𝐺 Σg 𝐹) = (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑌)) |
| 11 | 10 | a1i 9 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑌))) |
| 12 | 9 | reseq1i 5061 | . . . . 5 ⊢ (𝐹 ↾ 𝐶) = ((𝑘 ∈ 𝐴 ↦ 𝑌) ↾ 𝐶) |
| 13 | ssun1 3392 | . . . . . . 7 ⊢ 𝐶 ⊆ (𝐶 ∪ 𝐷) | |
| 14 | 13, 7 | sseqtrrid 3299 | . . . . . 6 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
| 15 | 14 | resmptd 5117 | . . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝑌) ↾ 𝐶) = (𝑘 ∈ 𝐶 ↦ 𝑌)) |
| 16 | 12, 15 | eqtrid 2283 | . . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑘 ∈ 𝐶 ↦ 𝑌)) |
| 17 | 16 | oveq2d 6104 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ 𝐶)) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑌))) |
| 18 | 9 | reseq1i 5061 | . . . . 5 ⊢ (𝐹 ↾ 𝐷) = ((𝑘 ∈ 𝐴 ↦ 𝑌) ↾ 𝐷) |
| 19 | ssun2 3393 | . . . . . . 7 ⊢ 𝐷 ⊆ (𝐶 ∪ 𝐷) | |
| 20 | 19, 7 | sseqtrrid 3299 | . . . . . 6 ⊢ (𝜑 → 𝐷 ⊆ 𝐴) |
| 21 | 20 | resmptd 5117 | . . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝑌) ↾ 𝐷) = (𝑘 ∈ 𝐷 ↦ 𝑌)) |
| 22 | 18, 21 | eqtrid 2283 | . . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝐷) = (𝑘 ∈ 𝐷 ↦ 𝑌)) |
| 23 | 22 | oveq2d 6104 | . . 3 ⊢ (𝜑 → (𝐺 Σg (𝐹 ↾ 𝐷)) = (𝐺 Σg (𝑘 ∈ 𝐷 ↦ 𝑌))) |
| 24 | 17, 23 | oveq12d 6106 | . 2 ⊢ (𝜑 → ((𝐺 Σg (𝐹 ↾ 𝐶)) + (𝐺 Σg (𝐹 ↾ 𝐷))) = ((𝐺 Σg (𝑘 ∈ 𝐶 ↦ 𝑌)) + (𝐺 Σg (𝑘 ∈ 𝐷 ↦ 𝑌)))) |
| 25 | 8, 11, 24 | 3eqtr4d 2281 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = ((𝐺 Σg (𝐹 ↾ 𝐶)) + (𝐺 Σg (𝐹 ↾ 𝐷)))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 ∩ cin 3219 ∅c0 3520 ↦ cmpt 4193 ↾ cres 4778 ‘cfv 5380 (class class class)co 6088 Fincfn 7026 Basecbs 13410 +gcplusg 13490 CMndccmn 14177 Σg cgsu 14240 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 |
| This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-oadd 6695 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-inn 9314 df-2 9372 df-n0 9575 df-z 9656 df-uz 9938 df-fz 10429 df-fzo 10567 df-seqfrec 10906 df-ihash 11237 df-ndx 13413 df-slot 13414 df-base 13416 df-plusg 13503 df-0g 13671 df-gzsum 13672 df-mgm 13735 df-sgrp 13776 df-mnd 13789 df-minusg 13868 df-mulg 13982 df-cmn 14179 df-gsumfi 14241 |
| This theorem is used by: gsumsplitfi 14256 |
| Copyright terms: Public domain | W3C validator |