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

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

Proof of Theorem mulgnngsum
Dummy variables  a  b  i are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elnnuz 9632 . . . . 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 mulgnngsum.f . . . . . 6  |-  F  =  ( x  e.  ( 1 ... N ) 
|->  X )
54a1i 9 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  F  =  ( x  e.  (
1 ... N )  |->  X ) )
6 eqidd 2194 . . . . 5  |-  ( ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N
) )  /\  x  =  i )  ->  X  =  X )
7 simpr 110 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  i  e.  ( 1 ... N
) )
8 simpr 110 . . . . . 6  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  X  e.  B )
98adantr 276 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  X  e.  B )
105, 6, 7, 9fvmptd 5639 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( F `  i )  =  X )
11 elfznn 10123 . . . . 5  |-  ( i  e.  ( 1 ... N )  ->  i  e.  NN )
12 fvconst2g 5773 . . . . 5  |-  ( ( X  e.  B  /\  i  e.  NN )  ->  ( ( NN  X.  { X } ) `  i )  =  X )
138, 11, 12syl2an 289 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( ( NN  X.  { X }
) `  i )  =  X )
1410, 13eqtr4d 2229 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  i  e.  ( 1 ... N ) )  ->  ( F `  i )  =  ( ( NN  X.  { X } ) `  i
) )
15 1zzd 9347 . . . . . . 7  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  1  e.  ZZ )
16 nnz 9339 . . . . . . . 8  |-  ( N  e.  NN  ->  N  e.  ZZ )
1716adantr 276 . . . . . . 7  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  N  e.  ZZ )
1815, 17fzfigd 10505 . . . . . 6  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( 1 ... N
)  e.  Fin )
19 mptexg 5784 . . . . . . 7  |-  ( ( 1 ... N )  e.  Fin  ->  (
x  e.  ( 1 ... N )  |->  X )  e.  _V )
204, 19eqeltrid 2280 . . . . . 6  |-  ( ( 1 ... N )  e.  Fin  ->  F  e.  _V )
2118, 20syl 14 . . . . 5  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  F  e.  _V )
2221adantr 276 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  F  e.  _V )
23 vex 2763 . . . 4  |-  a  e. 
_V
24 fvexg 5574 . . . 4  |-  ( ( F  e.  _V  /\  a  e.  _V )  ->  ( F `  a
)  e.  _V )
2522, 23, 24sylancl 413 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( F `  a )  e.  _V )
26 nnex 8990 . . . . 5  |-  NN  e.  _V
278adantr 276 . . . . . 6  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  X  e.  B
)
28 snexg 4214 . . . . . 6  |-  ( X  e.  B  ->  { X }  e.  _V )
2927, 28syl 14 . . . . 5  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  { X }  e.  _V )
30 xpexg 4774 . . . . 5  |-  ( ( NN  e.  _V  /\  { X }  e.  _V )  ->  ( NN  X.  { X } )  e. 
_V )
3126, 29, 30sylancr 414 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( NN  X.  { X } )  e. 
_V )
32 fvexg 5574 . . . 4  |-  ( ( ( NN  X.  { X } )  e.  _V  /\  a  e.  _V )  ->  ( ( NN  X.  { X } ) `  a )  e.  _V )
3331, 23, 32sylancl 413 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  a  e.  (
ZZ>= `  1 ) )  ->  ( ( NN 
X.  { X }
) `  a )  e.  _V )
34 mulgnngsum.b . . . . . . 7  |-  B  =  ( Base `  G
)
3534basmex 12680 . . . . . 6  |-  ( X  e.  B  ->  G  e.  _V )
3635adantl 277 . . . . 5  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  G  e.  _V )
37 plusgslid 12733 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
3837slotex 12648 . . . . 5  |-  ( G  e.  _V  ->  ( +g  `  G )  e. 
_V )
3936, 38syl 14 . . . 4  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( +g  `  G
)  e.  _V )
40 simprr 531 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( a  e. 
_V  /\  b  e.  _V ) )  ->  b  e.  _V )
41 ovexg 5953 . . . 4  |-  ( ( a  e.  _V  /\  ( +g  `  G )  e.  _V  /\  b  e.  _V )  ->  (
a ( +g  `  G
) b )  e. 
_V )
4223, 39, 40, 41mp3an2ani 1355 . . 3  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  ( a  e. 
_V  /\  b  e.  _V ) )  ->  (
a ( +g  `  G
) b )  e. 
_V )
433, 14, 25, 33, 42seq3fveq 10553 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  (  seq 1 ( ( +g  `  G
) ,  F ) `
 N )  =  (  seq 1 ( ( +g  `  G
) ,  ( NN 
X.  { X }
) ) `  N
) )
44 eqid 2193 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
458adantr 276 . . . 4  |-  ( ( ( N  e.  NN  /\  X  e.  B )  /\  x  e.  ( 1 ... N ) )  ->  X  e.  B )
4645, 4fmptd 5713 . . 3  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  F : ( 1 ... N ) --> B )
4734, 44, 36, 3, 46gsumval2 12983 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( G  gsumg  F )  =  (  seq 1 ( ( +g  `  G ) ,  F ) `  N ) )
48 mulgnngsum.t . . 3  |-  .x.  =  (.g
`  G )
49 eqid 2193 . . 3  |-  seq 1
( ( +g  `  G
) ,  ( NN 
X.  { X }
) )  =  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) )
5034, 44, 48, 49mulgnn 13199 . 2  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  (  seq 1 ( ( +g  `  G ) ,  ( NN  X.  { X } ) ) `  N ) )
5143, 47, 503eqtr4rd 2237 1  |-  ( ( N  e.  NN  /\  X  e.  B )  ->  ( N  .x.  X
)  =  ( G 
gsumg  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2164   _Vcvv 2760   {csn 3619    |-> cmpt 4091    X. cxp 4658   ` cfv 5255  (class class class)co 5919   Fincfn 6796   1c1 7875   NNcn 8984   ZZcz 9320   ZZ>=cuz 9595   ...cfz 10077    seqcseq 10521   Basecbs 12621   +g cplusg 12698    gsumg cgsu 12871  .gcmg 13192
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-apti 7989  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-frec 6446  df-1o 6471  df-er 6589  df-en 6797  df-fin 6799  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-inn 8985  df-2 9043  df-n0 9244  df-z 9321  df-uz 9596  df-fz 10078  df-seqfrec 10522  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-0g 12872  df-igsum 12873  df-minusg 13079  df-mulg 13193
This theorem is referenced by:  mulgnn0gsum  13201
  Copyright terms: Public domain W3C validator