MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gsumxp Structured version   Unicode version

Theorem gsumxp 17593
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.)
Hypotheses
Ref Expression
gsumxp.b  |-  B  =  ( Base `  G
)
gsumxp.z  |-  .0.  =  ( 0g `  G )
gsumxp.g  |-  ( ph  ->  G  e. CMnd )
gsumxp.a  |-  ( ph  ->  A  e.  V )
gsumxp.r  |-  ( ph  ->  C  e.  W )
gsumxp.f  |-  ( ph  ->  F : ( A  X.  C ) --> B )
gsumxp.w  |-  ( ph  ->  F finSupp  .0.  )
Assertion
Ref Expression
gsumxp  |-  ( ph  ->  ( G  gsumg  F )  =  ( G  gsumg  ( j  e.  A  |->  ( G  gsumg  ( k  e.  C  |->  ( j F k ) ) ) ) ) )
Distinct variable groups:    j, k,  .0.    j, G, k    ph, j,
k    A, j, k    B, j, k    C, j, k   
j, F, k    j, V
Allowed substitution hints:    V( k)    W( j, k)

Proof of Theorem gsumxp
StepHypRef Expression
1 gsumxp.b . . 3  |-  B  =  ( Base `  G
)
2 gsumxp.z . . 3  |-  .0.  =  ( 0g `  G )
3 gsumxp.g . . 3  |-  ( ph  ->  G  e. CMnd )
4 gsumxp.a . . . 4  |-  ( ph  ->  A  e.  V )
5 gsumxp.r . . . 4  |-  ( ph  ->  C  e.  W )
6 xpexg 6603 . . . 4  |-  ( ( A  e.  V  /\  C  e.  W )  ->  ( A  X.  C
)  e.  _V )
74, 5, 6syl2anc 665 . . 3  |-  ( ph  ->  ( A  X.  C
)  e.  _V )
8 relxp 4957 . . . 4  |-  Rel  ( A  X.  C )
98a1i 11 . . 3  |-  ( ph  ->  Rel  ( A  X.  C ) )
10 dmxpss 5283 . . . 4  |-  dom  ( A  X.  C )  C_  A
1110a1i 11 . . 3  |-  ( ph  ->  dom  ( A  X.  C )  C_  A
)
12 gsumxp.f . . 3  |-  ( ph  ->  F : ( A  X.  C ) --> B )
13 gsumxp.w . . 3  |-  ( ph  ->  F finSupp  .0.  )
141, 2, 3, 7, 9, 4, 11, 12, 13gsum2d 17589 . 2  |-  ( ph  ->  ( G  gsumg  F )  =  ( G  gsumg  ( j  e.  A  |->  ( G  gsumg  ( k  e.  ( ( A  X.  C
) " { j } )  |->  ( j F k ) ) ) ) ) )
15 df-ima 4862 . . . . . . 7  |-  ( ( A  X.  C )
" { j } )  =  ran  (
( A  X.  C
)  |`  { j } )
16 df-res 4861 . . . . . . . . . . 11  |-  ( ( A  X.  C )  |`  { j } )  =  ( ( A  X.  C )  i^i  ( { j }  X.  _V ) )
17 inxp 4982 . . . . . . . . . . 11  |-  ( ( A  X.  C )  i^i  ( { j }  X.  _V )
)  =  ( ( A  i^i  { j } )  X.  ( C  i^i  _V ) )
1816, 17eqtri 2451 . . . . . . . . . 10  |-  ( ( A  X.  C )  |`  { j } )  =  ( ( A  i^i  { j } )  X.  ( C  i^i  _V ) )
19 simpr 462 . . . . . . . . . . . . 13  |-  ( (
ph  /\  j  e.  A )  ->  j  e.  A )
2019snssd 4142 . . . . . . . . . . . 12  |-  ( (
ph  /\  j  e.  A )  ->  { j }  C_  A )
21 sseqin2 3681 . . . . . . . . . . . 12  |-  ( { j }  C_  A  <->  ( A  i^i  { j } )  =  {
j } )
2220, 21sylib 199 . . . . . . . . . . 11  |-  ( (
ph  /\  j  e.  A )  ->  ( A  i^i  { j } )  =  { j } )
23 inv1 3789 . . . . . . . . . . . 12  |-  ( C  i^i  _V )  =  C
2423a1i 11 . . . . . . . . . . 11  |-  ( (
ph  /\  j  e.  A )  ->  ( C  i^i  _V )  =  C )
2522, 24xpeq12d 4874 . . . . . . . . . 10  |-  ( (
ph  /\  j  e.  A )  ->  (
( A  i^i  {
j } )  X.  ( C  i^i  _V ) )  =  ( { j }  X.  C ) )
2618, 25syl5eq 2475 . . . . . . . . 9  |-  ( (
ph  /\  j  e.  A )  ->  (
( A  X.  C
)  |`  { j } )  =  ( { j }  X.  C
) )
2726rneqd 5077 . . . . . . . 8  |-  ( (
ph  /\  j  e.  A )  ->  ran  ( ( A  X.  C )  |`  { j } )  =  ran  ( { j }  X.  C ) )
28 vex 3084 . . . . . . . . . 10  |-  j  e. 
_V
2928snnz 4115 . . . . . . . . 9  |-  { j }  =/=  (/)
30 rnxp 5282 . . . . . . . . 9  |-  ( { j }  =/=  (/)  ->  ran  ( { j }  X.  C )  =  C )
3129, 30ax-mp 5 . . . . . . . 8  |-  ran  ( { j }  X.  C )  =  C
3227, 31syl6eq 2479 . . . . . . 7  |-  ( (
ph  /\  j  e.  A )  ->  ran  ( ( A  X.  C )  |`  { j } )  =  C )
3315, 32syl5eq 2475 . . . . . 6  |-  ( (
ph  /\  j  e.  A )  ->  (
( A  X.  C
) " { j } )  =  C )
3433mpteq1d 4502 . . . . 5  |-  ( (
ph  /\  j  e.  A )  ->  (
k  e.  ( ( A  X.  C )
" { j } )  |->  ( j F k ) )  =  ( k  e.  C  |->  ( j F k ) ) )
3534oveq2d 6317 . . . 4  |-  ( (
ph  /\  j  e.  A )  ->  ( G  gsumg  ( k  e.  ( ( A  X.  C
) " { j } )  |->  ( j F k ) ) )  =  ( G 
gsumg  ( k  e.  C  |->  ( j F k ) ) ) )
3635mpteq2dva 4507 . . 3  |-  ( ph  ->  ( j  e.  A  |->  ( G  gsumg  ( k  e.  ( ( A  X.  C
) " { j } )  |->  ( j F k ) ) ) )  =  ( j  e.  A  |->  ( G  gsumg  ( k  e.  C  |->  ( j F k ) ) ) ) )
3736oveq2d 6317 . 2  |-  ( ph  ->  ( G  gsumg  ( j  e.  A  |->  ( G  gsumg  ( k  e.  ( ( A  X.  C
) " { j } )  |->  ( j F k ) ) ) ) )  =  ( G  gsumg  ( j  e.  A  |->  ( G  gsumg  ( k  e.  C  |->  ( j F k ) ) ) ) ) )
3814, 37eqtrd 2463 1  |-  ( ph  ->  ( G  gsumg  F )  =  ( G  gsumg  ( j  e.  A  |->  ( G  gsumg  ( k  e.  C  |->  ( j F k ) ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 370    = wceq 1437    e. wcel 1868    =/= wne 2618   _Vcvv 3081    i^i cin 3435    C_ wss 3436   (/)c0 3761   {csn 3996   class class class wbr 4420    |-> cmpt 4479    X. cxp 4847   dom cdm 4849   ran crn 4850    |` cres 4851   "cima 4852   Rel wrel 4854   -->wf 5593   ` cfv 5597  (class class class)co 6301   finSupp cfsupp 7885   Basecbs 15106   0gc0g 15323    gsumg cgsu 15324  CMndccmn 17415
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1839  ax-8 1870  ax-9 1872  ax-10 1887  ax-11 1892  ax-12 1905  ax-13 2053  ax-ext 2400  ax-rep 4533  ax-sep 4543  ax-nul 4551  ax-pow 4598  ax-pr 4656  ax-un 6593  ax-inf2 8148  ax-cnex 9595  ax-resscn 9596  ax-1cn 9597  ax-icn 9598  ax-addcl 9599  ax-addrcl 9600  ax-mulcl 9601  ax-mulrcl 9602  ax-mulcom 9603  ax-addass 9604  ax-mulass 9605  ax-distr 9606  ax-i2m1 9607  ax-1ne0 9608  ax-1rid 9609  ax-rnegex 9610  ax-rrecex 9611  ax-cnre 9612  ax-pre-lttri 9613  ax-pre-lttrn 9614  ax-pre-ltadd 9615  ax-pre-mulgt0 9616
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-eu 2269  df-mo 2270  df-clab 2408  df-cleq 2414  df-clel 2417  df-nfc 2572  df-ne 2620  df-nel 2621  df-ral 2780  df-rex 2781  df-reu 2782  df-rmo 2783  df-rab 2784  df-v 3083  df-sbc 3300  df-csb 3396  df-dif 3439  df-un 3441  df-in 3443  df-ss 3450  df-pss 3452  df-nul 3762  df-if 3910  df-pw 3981  df-sn 3997  df-pr 3999  df-tp 4001  df-op 4003  df-uni 4217  df-int 4253  df-iun 4298  df-iin 4299  df-br 4421  df-opab 4480  df-mpt 4481  df-tr 4516  df-eprel 4760  df-id 4764  df-po 4770  df-so 4771  df-fr 4808  df-se 4809  df-we 4810  df-xp 4855  df-rel 4856  df-cnv 4857  df-co 4858  df-dm 4859  df-rn 4860  df-res 4861  df-ima 4862  df-pred 5395  df-ord 5441  df-on 5442  df-lim 5443  df-suc 5444  df-iota 5561  df-fun 5599  df-fn 5600  df-f 5601  df-f1 5602  df-fo 5603  df-f1o 5604  df-fv 5605  df-isom 5606  df-riota 6263  df-ov 6304  df-oprab 6305  df-mpt2 6306  df-of 6541  df-om 6703  df-1st 6803  df-2nd 6804  df-supp 6922  df-wrecs 7032  df-recs 7094  df-rdg 7132  df-1o 7186  df-oadd 7190  df-er 7367  df-en 7574  df-dom 7575  df-sdom 7576  df-fin 7577  df-fsupp 7886  df-oi 8027  df-card 8374  df-pnf 9677  df-mnf 9678  df-xr 9679  df-ltxr 9680  df-le 9681  df-sub 9862  df-neg 9863  df-nn 10610  df-2 10668  df-n0 10870  df-z 10938  df-uz 11160  df-fz 11785  df-fzo 11916  df-seq 12213  df-hash 12515  df-ndx 15109  df-slot 15110  df-base 15111  df-sets 15112  df-ress 15113  df-plusg 15188  df-0g 15325  df-gsum 15326  df-mre 15477  df-mrc 15478  df-acs 15480  df-mgm 16473  df-sgrp 16512  df-mnd 16522  df-submnd 16568  df-mulg 16661  df-cntz 16956  df-cmn 17417
This theorem is referenced by:  tsmsxplem1  21151  tsmsxplem2  21152
  Copyright terms: Public domain W3C validator