ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  gzsumgsum Unicode version

Theorem gzsumgsum 14155
Description: On an integer range,  gzsumgz and  gsumg agree. (Contributed by Jim Kingdon, 25-Mar-2026.)
Hypotheses
Ref Expression
gzsumgsum.b  |-  B  =  ( Base `  G
)
gzsumgsum.g  |-  ( ph  ->  G  e. CMnd )
gzsumgsum.m  |-  ( ph  ->  M  e.  ZZ )
gzsumgsum.n  |-  ( ph  ->  N  e.  ZZ )
gzsumgsum.f  |-  ( ph  ->  F : ( M ... N ) --> B )
Assertion
Ref Expression
gzsumgsum  |-  ( ph  ->  ( G  gzsumgz 
F )  =  ( G  gsumg  F ) )

Proof of Theorem gzsumgsum
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 gzsumgsum.b . . . 4  |-  B  =  ( Base `  G
)
2 gzsumgsum.g . . . . 5  |-  ( ph  ->  G  e. CMnd )
32adantr 276 . . . 4  |-  ( (
ph  /\  M  <_  N )  ->  G  e. CMnd )
4 gzsumgsum.m . . . . . 6  |-  ( ph  ->  M  e.  ZZ )
54adantr 276 . . . . 5  |-  ( (
ph  /\  M  <_  N )  ->  M  e.  ZZ )
6 gzsumgsum.n . . . . . 6  |-  ( ph  ->  N  e.  ZZ )
76adantr 276 . . . . 5  |-  ( (
ph  /\  M  <_  N )  ->  N  e.  ZZ )
8 simpr 110 . . . . 5  |-  ( (
ph  /\  M  <_  N )  ->  M  <_  N )
9 eluz2 9927 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  N  e.  ZZ  /\  M  <_  N ) )
105, 7, 8, 9syl3anbrc 1212 . . . 4  |-  ( (
ph  /\  M  <_  N )  ->  N  e.  ( ZZ>= `  M )
)
11 gzsumgsum.f . . . . 5  |-  ( ph  ->  F : ( M ... N ) --> B )
1211adantr 276 . . . 4  |-  ( (
ph  /\  M  <_  N )  ->  F :
( M ... N
) --> B )
13 eqid 2238 . . . 4  |-  ( j  e.  ( 1 ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M ) ) )  =  ( j  e.  ( 1 ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M
) ) )
141, 3, 10, 12, 13gzsumshift 14149 . . 3  |-  ( (
ph  /\  M  <_  N )  ->  ( G  gzsumgz  F )  =  ( G 
gzsumgz  ( F  o.  (
j  e.  ( 1 ... ( N  +  ( 1  -  M
) ) )  |->  ( j  -  ( 1  -  M ) ) ) ) ) )
154, 6fzfigd 10868 . . . . 5  |-  ( ph  ->  ( M ... N
)  e.  Fin )
1615adantr 276 . . . 4  |-  ( (
ph  /\  M  <_  N )  ->  ( M ... N )  e.  Fin )
17 1zzd 9671 . . . . . . . 8  |-  ( ph  ->  1  e.  ZZ )
1817, 4zsubcld 9773 . . . . . . 7  |-  ( ph  ->  ( 1  -  M
)  e.  ZZ )
1918, 4, 6mptfzshft 12209 . . . . . 6  |-  ( ph  ->  ( j  e.  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M ) ) ) 
|->  ( j  -  (
1  -  M ) ) ) : ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M ) ) ) -1-1-onto-> ( M ... N ) )
2019adantr 276 . . . . 5  |-  ( (
ph  /\  M  <_  N )  ->  ( j  e.  ( ( M  +  ( 1  -  M
) ) ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M
) ) ) : ( ( M  +  ( 1  -  M
) ) ... ( N  +  ( 1  -  M ) ) ) -1-1-onto-> ( M ... N
) )
214zcnd 9769 . . . . . . . . . 10  |-  ( ph  ->  M  e.  CC )
22 1cnd 8342 . . . . . . . . . 10  |-  ( ph  ->  1  e.  CC )
2321, 22pncan3d 8640 . . . . . . . . 9  |-  ( ph  ->  ( M  +  ( 1  -  M ) )  =  1 )
2423oveq1d 6100 . . . . . . . 8  |-  ( ph  ->  ( ( M  +  ( 1  -  M
) ) ... ( N  +  ( 1  -  M ) ) )  =  ( 1 ... ( N  +  ( 1  -  M
) ) ) )
2524mpteq1d 4216 . . . . . . 7  |-  ( ph  ->  ( j  e.  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M ) ) ) 
|->  ( j  -  (
1  -  M ) ) )  =  ( j  e.  ( 1 ... ( N  +  ( 1  -  M
) ) )  |->  ( j  -  ( 1  -  M ) ) ) )
2625adantr 276 . . . . . 6  |-  ( (
ph  /\  M  <_  N )  ->  ( j  e.  ( ( M  +  ( 1  -  M
) ) ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M
) ) )  =  ( j  e.  ( 1 ... ( N  +  ( 1  -  M ) ) ) 
|->  ( j  -  (
1  -  M ) ) ) )
2723adantr 276 . . . . . . 7  |-  ( (
ph  /\  M  <_  N )  ->  ( M  +  ( 1  -  M ) )  =  1 )
28 hashfz 11262 . . . . . . . . 9  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( `  ( M ... N ) )  =  ( ( N  -  M )  +  1 ) )
2910, 28syl 14 . . . . . . . 8  |-  ( (
ph  /\  M  <_  N )  ->  ( `  ( M ... N ) )  =  ( ( N  -  M )  +  1 ) )
307zcnd 9769 . . . . . . . . 9  |-  ( (
ph  /\  M  <_  N )  ->  N  e.  CC )
3121adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  M  <_  N )  ->  M  e.  CC )
32 1cnd 8342 . . . . . . . . 9  |-  ( (
ph  /\  M  <_  N )  ->  1  e.  CC )
3330, 31, 32subadd23d 8659 . . . . . . . 8  |-  ( (
ph  /\  M  <_  N )  ->  ( ( N  -  M )  +  1 )  =  ( N  +  ( 1  -  M ) ) )
3429, 33eqtr2d 2272 . . . . . . 7  |-  ( (
ph  /\  M  <_  N )  ->  ( N  +  ( 1  -  M ) )  =  ( `  ( M ... N ) ) )
3527, 34oveq12d 6103 . . . . . 6  |-  ( (
ph  /\  M  <_  N )  ->  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M
) ) )  =  ( 1 ... ( `  ( M ... N
) ) ) )
36 eqidd 2239 . . . . . 6  |-  ( (
ph  /\  M  <_  N )  ->  ( M ... N )  =  ( M ... N ) )
3726, 35, 36f1oeq123d 5633 . . . . 5  |-  ( (
ph  /\  M  <_  N )  ->  ( (
j  e.  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M
) ) )  |->  ( j  -  ( 1  -  M ) ) ) : ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M
) ) ) -1-1-onto-> ( M ... N )  <->  ( j  e.  ( 1 ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M
) ) ) : ( 1 ... ( `  ( M ... N
) ) ) -1-1-onto-> ( M ... N ) ) )
3820, 37mpbid 147 . . . 4  |-  ( (
ph  /\  M  <_  N )  ->  ( j  e.  ( 1 ... ( N  +  ( 1  -  M ) ) )  |->  ( j  -  ( 1  -  M
) ) ) : ( 1 ... ( `  ( M ... N
) ) ) -1-1-onto-> ( M ... N ) )
391, 3, 12, 16, 38gsumvalfi 14152 . . 3  |-  ( (
ph  /\  M  <_  N )  ->  ( G  gsumg  F )  =  ( G 
gzsumgz  ( F  o.  (
j  e.  ( 1 ... ( N  +  ( 1  -  M
) ) )  |->  ( j  -  ( 1  -  M ) ) ) ) ) )
4014, 39eqtr4d 2274 . 2  |-  ( (
ph  /\  M  <_  N )  ->  ( G  gzsumgz  F )  =  ( G 
gsumg  F ) )
412adantr 276 . . . 4  |-  ( (
ph  /\  -.  M  <_  N )  ->  G  e. CMnd )
42 gsum0cmn 14154 . . . 4  |-  ( G  e. CMnd  ->  ( G  gsumg  (/) )  =  ( 0g `  G
) )
4341, 42syl 14 . . 3  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gsumg  (/) )  =  ( 0g `  G ) )
4411adantr 276 . . . . . 6  |-  ( (
ph  /\  -.  M  <_  N )  ->  F : ( M ... N ) --> B )
45 simpr 110 . . . . . . . . 9  |-  ( (
ph  /\  -.  M  <_  N )  ->  -.  M  <_  N )
466adantr 276 . . . . . . . . . 10  |-  ( (
ph  /\  -.  M  <_  N )  ->  N  e.  ZZ )
474adantr 276 . . . . . . . . . 10  |-  ( (
ph  /\  -.  M  <_  N )  ->  M  e.  ZZ )
48 zltnle 9690 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  M  e.  ZZ )  ->  ( N  <  M  <->  -.  M  <_  N )
)
4946, 47, 48syl2anc 415 . . . . . . . . 9  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( N  <  M  <->  -.  M  <_  N ) )
5045, 49mpbird 167 . . . . . . . 8  |-  ( (
ph  /\  -.  M  <_  N )  ->  N  <  M )
51 fzn 10446 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  <->  ( M ... N )  =  (/) ) )
5247, 46, 51syl2anc 415 . . . . . . . 8  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( N  <  M  <->  ( M ... N )  =  (/) ) )
5350, 52mpbid 147 . . . . . . 7  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( M ... N )  =  (/) )
5453feq2d 5521 . . . . . 6  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( F : ( M ... N ) --> B  <->  F : (/) --> B ) )
5544, 54mpbid 147 . . . . 5  |-  ( (
ph  /\  -.  M  <_  N )  ->  F : (/) --> B )
56 f0bi 5585 . . . . 5  |-  ( F : (/) --> B  <->  F  =  (/) )
5755, 56sylib 122 . . . 4  |-  ( (
ph  /\  -.  M  <_  N )  ->  F  =  (/) )
5857oveq2d 6101 . . 3  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gsumg  F )  =  ( G  gsumg  (/) ) )
5957oveq2d 6101 . . . 4  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gzsumgz 
F )  =  ( G  gzsumgz  (/) ) )
60 eqid 2238 . . . . . 6  |-  ( 0g
`  G )  =  ( 0g `  G
)
6160gzsum0 13713 . . . . 5  |-  ( G  e. CMnd  ->  ( G  gzsumgz  (/) )  =  ( 0g `  G
) )
6241, 61syl 14 . . . 4  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gzsumgz  (/) )  =  ( 0g `  G ) )
6359, 62eqtrd 2271 . . 3  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gzsumgz 
F )  =  ( 0g `  G ) )
6443, 58, 633eqtr4rd 2282 . 2  |-  ( (
ph  /\  -.  M  <_  N )  ->  ( G  gzsumgz 
F )  =  ( G  gsumg  F ) )
65 zdcle 9721 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  -> DECID  M  <_  N )
664, 6, 65syl2anc 415 . . 3  |-  ( ph  -> DECID  M  <_  N )
67 exmiddc 848 . . 3  |-  (DECID  M  <_  N  ->  ( M  <_  N  \/  -.  M  <_  N ) )
6866, 67syl 14 . 2  |-  ( ph  ->  ( M  <_  N  \/  -.  M  <_  N
) )
6940, 64, 68mpjaodan 810 1  |-  ( ph  ->  ( G  gzsumgz 
F )  =  ( G  gsumg  F ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720  DECID wdc 846    = wceq 1402    e. wcel 2209   (/)c0 3520   class class class wbr 4130    |-> cmpt 4192    o. ccom 4778   -->wf 5373   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085   Fincfn 7022   CCcc 8177   1c1 8180    + caddc 8182    < clt 8360    <_ cle 8361    - cmin 8497   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411  ♯chash 11214   Basecbs 13352   0gc0g 13610    gzsumgz cgzsu 13611  CMndccmn 14087    gsumg cgsu 14150
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296
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-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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-inn 9305  df-2 9363  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-fzo 10550  df-seqfrec 10885  df-ihash 11215  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-gzsum 13613  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-cmn 14089  df-gsumfi 14151
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator