![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gsumxp | Structured version Visualization version GIF version |
Description: Write a group sum over a cartesian product as a double sum. (Contributed by Mario Carneiro, 28-Dec-2014.) (Revised by AV, 9-Jun-2019.) |
Ref | Expression |
---|---|
gsumxp.b | ⊢ 𝐵 = (Base‘𝐺) |
gsumxp.z | ⊢ 0 = (0g‘𝐺) |
gsumxp.g | ⊢ (𝜑 → 𝐺 ∈ CMnd) |
gsumxp.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
gsumxp.r | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
gsumxp.f | ⊢ (𝜑 → 𝐹:(𝐴 × 𝐶)⟶𝐵) |
gsumxp.w | ⊢ (𝜑 → 𝐹 finSupp 0 ) |
Ref | Expression |
---|---|
gsumxp | ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsumxp.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | gsumxp.z | . . 3 ⊢ 0 = (0g‘𝐺) | |
3 | gsumxp.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd) | |
4 | gsumxp.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
5 | gsumxp.r | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
6 | 4, 5 | xpexd 7733 | . . 3 ⊢ (𝜑 → (𝐴 × 𝐶) ∈ V) |
7 | relxp 5693 | . . . 4 ⊢ Rel (𝐴 × 𝐶) | |
8 | 7 | a1i 11 | . . 3 ⊢ (𝜑 → Rel (𝐴 × 𝐶)) |
9 | dmxpss 6167 | . . . 4 ⊢ dom (𝐴 × 𝐶) ⊆ 𝐴 | |
10 | 9 | a1i 11 | . . 3 ⊢ (𝜑 → dom (𝐴 × 𝐶) ⊆ 𝐴) |
11 | gsumxp.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴 × 𝐶)⟶𝐵) | |
12 | gsumxp.w | . . 3 ⊢ (𝜑 → 𝐹 finSupp 0 ) | |
13 | 1, 2, 3, 6, 8, 4, 10, 11, 12 | gsum2d 19832 | . 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ ((𝐴 × 𝐶) “ {𝑗}) ↦ (𝑗𝐹𝑘)))))) |
14 | df-ima 5688 | . . . . . . 7 ⊢ ((𝐴 × 𝐶) “ {𝑗}) = ran ((𝐴 × 𝐶) ↾ {𝑗}) | |
15 | df-res 5687 | . . . . . . . . . . 11 ⊢ ((𝐴 × 𝐶) ↾ {𝑗}) = ((𝐴 × 𝐶) ∩ ({𝑗} × V)) | |
16 | inxp 5830 | . . . . . . . . . . 11 ⊢ ((𝐴 × 𝐶) ∩ ({𝑗} × V)) = ((𝐴 ∩ {𝑗}) × (𝐶 ∩ V)) | |
17 | 15, 16 | eqtri 2761 | . . . . . . . . . 10 ⊢ ((𝐴 × 𝐶) ↾ {𝑗}) = ((𝐴 ∩ {𝑗}) × (𝐶 ∩ V)) |
18 | simpr 486 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝑗 ∈ 𝐴) | |
19 | 18 | snssd 4811 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → {𝑗} ⊆ 𝐴) |
20 | sseqin2 4214 | . . . . . . . . . . . 12 ⊢ ({𝑗} ⊆ 𝐴 ↔ (𝐴 ∩ {𝑗}) = {𝑗}) | |
21 | 19, 20 | sylib 217 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → (𝐴 ∩ {𝑗}) = {𝑗}) |
22 | inv1 4393 | . . . . . . . . . . . 12 ⊢ (𝐶 ∩ V) = 𝐶 | |
23 | 22 | a1i 11 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → (𝐶 ∩ V) = 𝐶) |
24 | 21, 23 | xpeq12d 5706 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ((𝐴 ∩ {𝑗}) × (𝐶 ∩ V)) = ({𝑗} × 𝐶)) |
25 | 17, 24 | eqtrid 2785 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ((𝐴 × 𝐶) ↾ {𝑗}) = ({𝑗} × 𝐶)) |
26 | 25 | rneqd 5935 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ran ((𝐴 × 𝐶) ↾ {𝑗}) = ran ({𝑗} × 𝐶)) |
27 | vex 3479 | . . . . . . . . . 10 ⊢ 𝑗 ∈ V | |
28 | 27 | snnz 4779 | . . . . . . . . 9 ⊢ {𝑗} ≠ ∅ |
29 | rnxp 6166 | . . . . . . . . 9 ⊢ ({𝑗} ≠ ∅ → ran ({𝑗} × 𝐶) = 𝐶) | |
30 | 28, 29 | ax-mp 5 | . . . . . . . 8 ⊢ ran ({𝑗} × 𝐶) = 𝐶 |
31 | 26, 30 | eqtrdi 2789 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ran ((𝐴 × 𝐶) ↾ {𝑗}) = 𝐶) |
32 | 14, 31 | eqtrid 2785 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ((𝐴 × 𝐶) “ {𝑗}) = 𝐶) |
33 | 32 | mpteq1d 5242 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → (𝑘 ∈ ((𝐴 × 𝐶) “ {𝑗}) ↦ (𝑗𝐹𝑘)) = (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘))) |
34 | 33 | oveq2d 7420 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → (𝐺 Σg (𝑘 ∈ ((𝐴 × 𝐶) “ {𝑗}) ↦ (𝑗𝐹𝑘))) = (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))) |
35 | 34 | mpteq2dva 5247 | . . 3 ⊢ (𝜑 → (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ ((𝐴 × 𝐶) “ {𝑗}) ↦ (𝑗𝐹𝑘)))) = (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘))))) |
36 | 35 | oveq2d 7420 | . 2 ⊢ (𝜑 → (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ ((𝐴 × 𝐶) “ {𝑗}) ↦ (𝑗𝐹𝑘))))) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
37 | 13, 36 | eqtrd 2773 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑗 ∈ 𝐴 ↦ (𝐺 Σg (𝑘 ∈ 𝐶 ↦ (𝑗𝐹𝑘)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 Vcvv 3475 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 {csn 4627 class class class wbr 5147 ↦ cmpt 5230 × cxp 5673 dom cdm 5675 ran crn 5676 ↾ cres 5677 “ cima 5678 Rel wrel 5680 ⟶wf 6536 ‘cfv 6540 (class class class)co 7404 finSupp cfsupp 9357 Basecbs 17140 0gc0g 17381 Σg cgsu 17382 CMndccmn 19641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7720 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 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 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-of 7665 df-om 7851 df-1st 7970 df-2nd 7971 df-supp 8142 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-0g 17383 df-gsum 17384 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-submnd 18668 df-mulg 18945 df-cntz 19175 df-cmn 19643 |
This theorem is referenced by: tsmsxplem1 23639 tsmsxplem2 23640 fedgmullem1 32659 fedgmullem2 32660 evlselv 41109 |
Copyright terms: Public domain | W3C validator |