Theorem gsumfzval 12974

Description: An expression for gsum_g when summing over a finite set of sequential integers. (Contributed by Jim Kingdon, 14-Aug-2025.)

Hypotheses

Ref	Expression
gsumval.b	|- B = ( Base ` G )
gsumval.z	|- .0. = ( 0g ` G )
gsumval.p	|- .+ = ( +g ` G )
gsumval.g	|- ( ph -> G e. V )
gsumfzval.m	|- ( ph -> M e. ZZ )
gsumfzval.n	|- ( ph -> N e. ZZ )
gsumfzval.f	|- ( ph -> F : ( M ... N ) --> B )

Assertion

Ref	Expression
gsumfzval	|- ( ph -> ( G gsumg F ) = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) )

Proof of Theorem gsumfzval

Dummy variables m n x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gsumval.b	. . 3 |- B = ( Base ` G )
2		gsumval.z	. . 3 |- .0. = ( 0g ` G )
3		gsumval.p	. . 3 |- .+ = ( +g ` G )
4		gsumval.g	. . 3 |- ( ph -> G e. V )
5		gsumfzval.m	. . . 4 |- ( ph -> M e. ZZ )
6		gsumfzval.n	. . . 4 |- ( ph -> N e. ZZ )
7	5, 6	fzfigd 10502	. . 3 |- ( ph -> ( M ... N ) e. Fin )
8		gsumfzval.f	. . 3 |- ( ph -> F : ( M ... N ) --> B )
9	1, 2, 3, 4, 7, 8	igsumval 12973	. 2 |- ( ph -> ( G gsumg F ) = ( iota x ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) ) )
10		fn0g 12958	. . . . . 6 |- 0g Fn _V
11	4	elexd 2773	. . . . . 6 |- ( ph -> G e. _V )
12		funfvex 5571	. . . . . . 7 |- ( ( Fun 0g /\ G e. dom 0g ) -> ( 0g ` G ) e. _V )
13	12	funfni 5354	. . . . . 6 |- ( ( 0g Fn _V /\ G e. _V ) -> ( 0g ` G ) e. _V )
14	10, 11, 13	sylancr 414	. . . . 5 |- ( ph -> ( 0g ` G ) e. _V )
15	2, 14	eqeltrid 2280	. . . 4 |- ( ph -> .0. e. _V )
16		seqex 10520	. . . . 5 |- seq M ( .+ , F ) e. _V
17		fvexg 5573	. . . . 5 |- ( ( seq M ( .+ , F ) e. _V /\ N e. ZZ ) -> ( seq M ( .+ , F ) ` N ) e. _V )
18	16, 6, 17	sylancr 414	. . . 4 |- ( ph -> ( seq M ( .+ , F ) ` N ) e. _V )
19	15, 18	ifexd 4515	. . 3 |- ( ph -> if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) e. _V )
20		zdclt 9394	. . . . . . . 8 |- ( ( N e. ZZ /\ M e. ZZ ) -> DECID N < M )
21	6, 5, 20	syl2anc 411	. . . . . . 7 |- ( ph -> DECID N < M )
22		eqifdc 3592	. . . . . . 7 |- (DECID N < M -> ( x = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) <-> ( ( N < M /\ x = .0. ) \/ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) ) )
23	21, 22	syl 14	. . . . . 6 |- ( ph -> ( x = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) <-> ( ( N < M /\ x = .0. ) \/ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) ) )
24		fzn 10108	. . . . . . . . 9 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( N < M <-> ( M ... N ) = (/) ) )
25	5, 6, 24	syl2anc 411	. . . . . . . 8 |- ( ph -> ( N < M <-> ( M ... N ) = (/) ) )
26	25	anbi1d 465	. . . . . . 7 |- ( ph -> ( ( N < M /\ x = .0. ) <-> ( ( M ... N ) = (/) /\ x = .0. ) ) )
27	5	adantr 276	. . . . . . . . . 10 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> M e. ZZ )
28	27	zred 9439	. . . . . . . . . . . . 13 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> M e. RR )
29	6	adantr 276	. . . . . . . . . . . . . 14 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> N e. ZZ )
30	29	zred 9439	. . . . . . . . . . . . 13 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> N e. RR )
31		simprl 529	. . . . . . . . . . . . 13 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> -. N < M )
32	28, 30, 31	nltled 8140	. . . . . . . . . . . 12 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> M <_ N )
33		eluz 9605	. . . . . . . . . . . . 13 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( N e. ( ZZ>= ` M ) <-> M <_ N ) )
34	27, 29, 33	syl2anc 411	. . . . . . . . . . . 12 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> ( N e. ( ZZ>= ` M ) <-> M <_ N ) )
35	32, 34	mpbird 167	. . . . . . . . . . 11 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> N e. ( ZZ>= ` M ) )
36		oveq2 5926	. . . . . . . . . . . . . 14 |- ( n = N -> ( M ... n ) = ( M ... N ) )
37	36	eqeq2d 2205	. . . . . . . . . . . . 13 |- ( n = N -> ( ( M ... N ) = ( M ... n ) <-> ( M ... N ) = ( M ... N ) ) )
38		fveq2 5554	. . . . . . . . . . . . . 14 |- ( n = N -> ( seq M ( .+ , F ) ` n ) = ( seq M ( .+ , F ) ` N ) )
39	38	eqeq2d 2205	. . . . . . . . . . . . 13 |- ( n = N -> ( x = ( seq M ( .+ , F ) ` n ) <-> x = ( seq M ( .+ , F ) ` N ) ) )
40	37, 39	anbi12d 473	. . . . . . . . . . . 12 |- ( n = N -> ( ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) <-> ( ( M ... N ) = ( M ... N ) /\ x = ( seq M ( .+ , F ) ` N ) ) ) )
41	40	adantl 277	. . . . . . . . . . 11 |- ( ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) /\ n = N ) -> ( ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) <-> ( ( M ... N ) = ( M ... N ) /\ x = ( seq M ( .+ , F ) ` N ) ) ) )
42		eqidd 2194	. . . . . . . . . . . 12 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> ( M ... N ) = ( M ... N ) )
43		simprr 531	. . . . . . . . . . . 12 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> x = ( seq M ( .+ , F ) ` N ) )
44	42, 43	jca 306	. . . . . . . . . . 11 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> ( ( M ... N ) = ( M ... N ) /\ x = ( seq M ( .+ , F ) ` N ) ) )
45	35, 41, 44	rspcedvd 2870	. . . . . . . . . 10 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> E. n e. ( ZZ>= ` M ) ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) )
46		fveq2 5554	. . . . . . . . . . . 12 |- ( m = M -> ( ZZ>= ` m ) = ( ZZ>= ` M ) )
47		oveq1 5925	. . . . . . . . . . . . . 14 |- ( m = M -> ( m ... n ) = ( M ... n ) )
48	47	eqeq2d 2205	. . . . . . . . . . . . 13 |- ( m = M -> ( ( M ... N ) = ( m ... n ) <-> ( M ... N ) = ( M ... n ) ) )
49		seqeq1 10521	. . . . . . . . . . . . . . 15 |- ( m = M -> seq m ( .+ , F ) = seq M ( .+ , F ) )
50	49	fveq1d 5556	. . . . . . . . . . . . . 14 |- ( m = M -> ( seq m ( .+ , F ) ` n ) = ( seq M ( .+ , F ) ` n ) )
51	50	eqeq2d 2205	. . . . . . . . . . . . 13 |- ( m = M -> ( x = ( seq m ( .+ , F ) ` n ) <-> x = ( seq M ( .+ , F ) ` n ) ) )
52	48, 51	anbi12d 473	. . . . . . . . . . . 12 |- ( m = M -> ( ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) <-> ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) ) )
53	46, 52	rexeqbidv 2707	. . . . . . . . . . 11 |- ( m = M -> ( E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) <-> E. n e. ( ZZ>= ` M ) ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) ) )
54	53	spcegv 2848	. . . . . . . . . 10 |- ( M e. ZZ -> ( E. n e. ( ZZ>= ` M ) ( ( M ... N ) = ( M ... n ) /\ x = ( seq M ( .+ , F ) ` n ) ) -> E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) )
55	27, 45, 54	sylc 62	. . . . . . . . 9 |- ( ( ph /\ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) -> E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) )
56	55	ex 115	. . . . . . . 8 |- ( ph -> ( ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) -> E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) )
57		eluzel2 9597	. . . . . . . . . . . . . . 15 |- ( n e. ( ZZ>= ` m ) -> m e. ZZ )
58	57	ad2antlr 489	. . . . . . . . . . . . . 14 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> m e. ZZ )
59	58	zred 9439	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> m e. RR )
60		eluzelre 9602	. . . . . . . . . . . . . 14 |- ( n e. ( ZZ>= ` m ) -> n e. RR )
61	60	ad2antlr 489	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> n e. RR )
62		eluzle 9604	. . . . . . . . . . . . . 14 |- ( n e. ( ZZ>= ` m ) -> m <_ n )
63	62	ad2antlr 489	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> m <_ n )
64	59, 61, 63	lensymd 8141	. . . . . . . . . . . 12 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> -. n < m )
65		simprl 529	. . . . . . . . . . . . . . . 16 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( M ... N ) = ( m ... n ) )
66	65	eqcomd 2199	. . . . . . . . . . . . . . 15 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( m ... n ) = ( M ... N ) )
67		fzopth 10127	. . . . . . . . . . . . . . . 16 |- ( n e. ( ZZ>= ` m ) -> ( ( m ... n ) = ( M ... N ) <-> ( m = M /\ n = N ) ) )
68	67	ad2antlr 489	. . . . . . . . . . . . . . 15 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( ( m ... n ) = ( M ... N ) <-> ( m = M /\ n = N ) ) )
69	66, 68	mpbid 147	. . . . . . . . . . . . . 14 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( m = M /\ n = N ) )
70	69	simprd 114	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> n = N )
71	69	simpld 112	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> m = M )
72	70, 71	breq12d 4042	. . . . . . . . . . . 12 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( n < m <-> N < M ) )
73	64, 72	mtbid 673	. . . . . . . . . . 11 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> -. N < M )
74		simprr 531	. . . . . . . . . . . 12 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> x = ( seq m ( .+ , F ) ` n ) )
75	71	seqeq1d 10524	. . . . . . . . . . . . 13 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> seq m ( .+ , F ) = seq M ( .+ , F ) )
76	75, 70	fveq12d 5561	. . . . . . . . . . . 12 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( seq m ( .+ , F ) ` n ) = ( seq M ( .+ , F ) ` N ) )
77	74, 76	eqtrd 2226	. . . . . . . . . . 11 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> x = ( seq M ( .+ , F ) ` N ) )
78	73, 77	jca 306	. . . . . . . . . 10 |- ( ( ( ph /\ n e. ( ZZ>= ` m ) ) /\ ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) -> ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) )
79	78	rexlimdva2 2614	. . . . . . . . 9 |- ( ph -> ( E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) -> ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) )
80	79	exlimdv 1830	. . . . . . . 8 |- ( ph -> ( E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) -> ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) )
81	56, 80	impbid 129	. . . . . . 7 |- ( ph -> ( ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) <-> E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) )
82	26, 81	orbi12d 794	. . . . . 6 |- ( ph -> ( ( ( N < M /\ x = .0. ) \/ ( -. N < M /\ x = ( seq M ( .+ , F ) ` N ) ) ) <-> ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) ) )
83	23, 82	bitr2d 189	. . . . 5 |- ( ph -> ( ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) <-> x = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) ) )
84	83	adantr 276	. . . 4 |- ( ( ph /\ if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) e. _V ) -> ( ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) <-> x = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) ) )
85	84	iota5 5236	. . 3 |- ( ( ph /\ if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) e. _V ) -> ( iota x ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) ) = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) )
86	19, 85	mpdan 421	. 2 |- ( ph -> ( iota x ( ( ( M ... N ) = (/) /\ x = .0. ) \/ E. m E. n e. ( ZZ>= ` m ) ( ( M ... N ) = ( m ... n ) /\ x = ( seq m ( .+ , F ) ` n ) ) ) ) = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) )
87	9, 86	eqtrd 2226	1 |- ( ph -> ( G gsumg F ) = if ( N < M , .0. , ( seq M ( .+ , F ) ` N ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709  DECID wdc 835   = wceq 1364   E.wex 1503   e. wcel 2164   E.wrex 2473   _Vcvv 2760   (/)c0 3446   ifcif 3557   class class class wbr 4029   iotacio 5213   Fn wfn 5249   -->wf 5250   ` cfv 5254  (class class class)co 5918   Fincfn 6794   RRcr 7871   < clt 8054   <_ cle 8055   ZZcz 9317   ZZ>=cuz 9592   ...cfz 10074   seqcseq 10518   Basecbs 12618   +g cplusg 12695   0gc0g 12867   gsum_g cgsu 12868

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 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988

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 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-frec 6444  df-1o 6469  df-er 6587  df-en 6795  df-fin 6797  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-inn 8983  df-n0 9241  df-z 9318  df-uz 9593  df-fz 10075  df-seqfrec 10519  df-ndx 12621  df-slot 12622  df-base 12624  df-0g 12869  df-igsum 12870

This theorem is referenced by:  gsumfzz  13067  gsumfzcl  13071  gsumfzreidx  13407  gsumfzsubmcl  13408  gsumfzmptfidmadd  13409  gsumfzmhm  13413