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

Theorem mulgnngzsum 13930
Description: Group multiple (exponentiation) operation at a positive integer expressed by a group sum. (Contributed by AV, 28-Dec-2023.)
Hypotheses
Ref Expression
mulgnngzsum.b  |-  B  =  ( Base `  G
)
mulgnngzsum.t  |-  .x.  =  (.g
`  G )
mulgnngzsum.f  |-  F  =  ( x  e.  ( 1 ... N ) 
|->  X )
Assertion
Ref Expression
mulgnngzsum  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  ( G 
gzsumgz  F ) )
Distinct variable groups:    x, B    x, N    x, X
Allowed substitution hints:    .x. ( x)    F( x)    G( x)

Proof of Theorem mulgnngzsum
Dummy variables  a  b  i are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elnnuz 9959 . . . . 5  |-  ( N  e.  NN  <->  N  e.  ( ZZ>= `  1 )
)
21biimpi 120 . . . 4  |-  ( N  e.  NN  ->  N  e.  ( ZZ>= `  1 )
)
32adantr 276 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  N  e.  ( ZZ>= ` 
1 ) )
4 mulgnngzsum.f . . . . 5  |-  F  =  ( x  e.  ( 1 ... N ) 
|->  X )
5 eqidd 2239 . . . . 5  |-  ( ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N
) )  /\  x  =  i )  ->  X  =  X )
6 simpr 110 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  i  e.  ( 1 ... N
) )
7 simpr 110 . . . . . 6  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  X  e.  B )
87adantr 276 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  X  e.  B )
94, 5, 6, 8fvmptd2 5787 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( F `  i )  =  X )
10 elfznn 10460 . . . . 5  |-  ( i  e.  ( 1 ... N )  ->  i  e.  NN )
11 fvconst2g 5929 . . . . 5  |-  ( ( X  e.  B  /\  i  e.  NN )  ->  ( ( NN  X.  { X } ) `  i )  =  X )
127, 10, 11syl2an 289 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( ( NN  X.  { X }
) `  i )  =  X )
139, 12eqtr4d 2274 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( F `  i )  =  ( ( NN  X.  { X } ) `  i
) )
14 1zzd 9671 . . . . . . 7  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  1  e.  ZZ )
15 nnz 9663 . . . . . . . 8  |-  ( N  e.  NN  ->  N  e.  ZZ )
1615adantr 276 . . . . . . 7  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  N  e.  ZZ )
1714, 16fzfigd 10868 . . . . . 6  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( 1 ... N
)  e.  Fin )
18 mptexg 5942 . . . . . . 7  |-  ( ( 1 ... N )  e.  Fin  ->  (
x  e.  ( 1 ... N )  |->  X )  e.  _V )
194, 18eqeltrid 2325 . . . . . 6  |-  ( ( 1 ... N )  e.  Fin  ->  F  e.  _V )
2017, 19syl 14 . . . . 5  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  F  e.  _V )
2120adantr 276 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  F  e.  _V )
22 vex 2824 . . . 4  |-  a  e. 
_V
23 fvexg 5714 . . . 4  |-  ( ( F  e.  _V  /\  a  e.  _V )  ->  ( F `  a
)  e.  _V )
2421, 22, 23sylancl 417 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( F `  a )  e.  _V )
25 nnex 9310 . . . . 5  |-  NN  e.  _V
267adantr 276 . . . . . 6  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  X  e.  B
)
27 snexg 4321 . . . . . 6  |-  ( X  e.  B  ->  { X }  e.  _V )
2826, 27syl 14 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  { X }  e.  _V )
29 xpexg 4889 . . . . 5  |-  ( ( NN  e.  _V  /\  { X }  e.  _V )  ->  ( NN  X.  { X } )  e. 
_V )
3025, 28, 29sylancr 418 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( NN  X.  { X } )  e. 
_V )
31 fvexg 5714 . . . 4  |-  ( ( ( NN  X.  { X } )  e.  _V  /\  a  e.  _V )  ->  ( ( NN  X.  { X } ) `  a )  e.  _V )
3230, 22, 31sylancl 417 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( ( NN 
X.  { X }
) `  a )  e.  _V )
33 mulgnngzsum.b . . . . . . 7  |-  B  =  ( Base `  G
)
3433basmex 13412 . . . . . 6  |-  ( X  e.  B  ->  G  e.  _V )
3534adantl 277 . . . . 5  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  G  e.  _V )
36 plusgslid 13466 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
3736slotex 13379 . . . . 5  |-  ( G  e.  _V  ->  ( +g  `  G )  e. 
_V )
3835, 37syl 14 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( +g  `  G
)  e.  _V )
39 simprr 537 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( a  e. 
_V  /\  b  e.  _V ) )  ->  b  e.  _V )
40 ovexg 6119 . . . 4  |-  ( ( a  e.  _V  /\  ( +g  `  G )  e.  _V  /\  b  e.  _V )  ->  (
a ( +g  `  G
) b )  e. 
_V )
4122, 38, 39, 40mp3an2ani 1385 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( a  e. 
_V  /\  b  e.  _V ) )  ->  (
a ( +g  `  G
) b )  e. 
_V )
423, 13, 24, 32, 41seq3fveq 10916 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  (  seq 1 ( ( +g  `  G
) ,  F ) `
 N )  =  (  seq 1 ( ( +g  `  G
) ,  ( NN 
X.  { X }
) ) `  N
) )
43 eqid 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
447adantr 276 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  x  e.  ( 1 ... N ) )  ->  X  e.  B )
4544, 4fmptd 5862 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  F : ( 1 ... N ) --> B )
4633, 43, 35, 3, 45gzsumval2 13714 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( G  gzsumgz 
F )  =  (  seq 1 ( ( +g  `  G ) ,  F ) `  N ) )
47 mulgnngzsum.t . . 3  |-  .x.  =  (.g
`  G )
48 eqid 2238 . . 3  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
4933, 43, 47, 48mulgnn 13929 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  (  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) ) `  N ) )
5042, 46, 493eqtr4rd 2282 1  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  ( G 
gzsumgz  F ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   {csn 3709    |-> cmpt 4192    X. cxp 4772   ` cfv 5377  (class class class)co 6085   Fincfn 7022   1c1 8180   NNcn 9304   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411    seqcseq 10884   Basecbs 13352   +g cplusg 13431    gzsumgz cgzsu 13611  .gcmg 13922
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-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  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-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-2 9363  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-seqfrec 10885  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-gzsum 13613  df-minusg 13809  df-mulg 13923
This theorem is used by:  mulgnn0gzsum  13931
  Copyright terms: Public domain W3C validator