Theorem gzsumcl 13781

Description: Closure of an ordered group sum. (Contributed by Mario Carneiro, 15-Dec-2014.) (Revised by AV, 3-Jun-2019.) (Revised by Jim Kingdon, 16-Aug-2025.)

Hypotheses

Ref	Expression
gzsumcl.b	|- B = ( Base ` G )
gzsumcl.z	|- .0. = ( 0g ` G )
gzsumcl.g	|- ( ph -> G e. Mnd )
gzsumcl.m	|- ( ph -> M e. ZZ )
gzsumcl.n	|- ( ph -> N e. ZZ )
gzsumcl.f	|- ( ph -> F : ( M ... N ) --> B )

Assertion

Ref	Expression
gzsumcl	|- ( ph -> ( G gzsumgz F ) e. B )

Proof of Theorem gzsumcl

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gzsumcl.b	. . . . . 6 |- B = ( Base ` G )
2		gzsumcl.z	. . . . . 6 |- .0. = ( 0g ` G )
3		eqid 2238	. . . . . 6 |- ( +g ` G ) = ( +g ` G )
4		gzsumcl.g	. . . . . 6 |- ( ph -> G e. Mnd )
5		gzsumcl.m	. . . . . 6 |- ( ph -> M e. ZZ )
6		gzsumcl.n	. . . . . 6 |- ( ph -> N e. ZZ )
7		gzsumcl.f	. . . . . 6 |- ( ph -> F : ( M ... N ) --> B )
8	1, 2, 3, 4, 5, 6, 7	gzsumfzval 13688	. . . . 5 |- ( ph -> ( G gzsumgz F ) = if ( N < M , .0. , ( seq M ( ( +g ` G ) , F ) ` N ) ) )
9	8	adantr 276	. . . 4 |- ( ( ph /\ N < M ) -> ( G gzsumgz F ) = if ( N < M , .0. , ( seq M ( ( +g ` G ) , F ) ` N ) ) )
10		simpr 110	. . . . 5 |- ( ( ph /\ N < M ) -> N < M )
11	10	iftrued 3644	. . . 4 |- ( ( ph /\ N < M ) -> if ( N < M , .0. , ( seq M ( ( +g ` G ) , F ) ` N ) ) = .0. )
12	9, 11	eqtrd 2271	. . 3 |- ( ( ph /\ N < M ) -> ( G gzsumgz F ) = .0. )
13	1, 2	mndidcl 13720	. . . . 5 |- ( G e. Mnd -> .0. e. B )
14	4, 13	syl 14	. . . 4 |- ( ph -> .0. e. B )
15	14	adantr 276	. . 3 |- ( ( ph /\ N < M ) -> .0. e. B )
16	12, 15	eqeltrd 2315	. 2 |- ( ( ph /\ N < M ) -> ( G gzsumgz F ) e. B )
17	8	adantr 276	. . . 4 |- ( ( ph /\ -. N < M ) -> ( G gzsumgz F ) = if ( N < M , .0. , ( seq M ( ( +g ` G ) , F ) ` N ) ) )
18		simpr 110	. . . . 5 |- ( ( ph /\ -. N < M ) -> -. N < M )
19	18	iffalsed 3647	. . . 4 |- ( ( ph /\ -. N < M ) -> if ( N < M , .0. , ( seq M ( ( +g ` G ) , F ) ` N ) ) = ( seq M ( ( +g ` G ) , F ) ` N ) )
20	17, 19	eqtrd 2271	. . 3 |- ( ( ph /\ -. N < M ) -> ( G gzsumgz F ) = ( seq M ( ( +g ` G ) , F ) ` N ) )
21	5	adantr 276	. . . . 5 |- ( ( ph /\ -. N < M ) -> M e. ZZ )
22	6	adantr 276	. . . . 5 |- ( ( ph /\ -. N < M ) -> N e. ZZ )
23	21	zred 9747	. . . . . 6 |- ( ( ph /\ -. N < M ) -> M e. RR )
24	22	zred 9747	. . . . . 6 |- ( ( ph /\ -. N < M ) -> N e. RR )
25	23, 24, 18	nltled 8437	. . . . 5 |- ( ( ph /\ -. N < M ) -> M <_ N )
26		eluz2 9906	. . . . 5 |- ( N e. ( ZZ>= ` M ) <-> ( M e. ZZ /\ N e. ZZ /\ M <_ N ) )
27	21, 22, 25, 26	syl3anbrc 1212	. . . 4 |- ( ( ph /\ -. N < M ) -> N e. ( ZZ>= ` M ) )
28	5, 6	fzfigd 10846	. . . . . . 7 |- ( ph -> ( M ... N ) e. Fin )
29	7, 28	fexd 5938	. . . . . 6 |- ( ph -> F e. _V )
30	29	ad2antrr 492	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ x e. ( ZZ>= ` M ) ) -> F e. _V )
31		vex 2824	. . . . 5 |- x e. _V
32		fvexg 5709	. . . . 5 |- ( ( F e. _V /\ x e. _V ) -> ( F ` x ) e. _V )
33	30, 31, 32	sylancl 417	. . . 4 |- ( ( ( ph /\ -. N < M ) /\ x e. ( ZZ>= ` M ) ) -> ( F ` x ) e. _V )
34	7	ad2antrr 492	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ x e. ( M ... N ) ) -> F : ( M ... N ) --> B )
35		simpr 110	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ x e. ( M ... N ) ) -> x e. ( M ... N ) )
36	34, 35	ffvelcdmd 5835	. . . 4 |- ( ( ( ph /\ -. N < M ) /\ x e. ( M ... N ) ) -> ( F ` x ) e. B )
37	4	ad2antrr 492	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. B /\ y e. B ) ) -> G e. Mnd )
38		simprl 535	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. B /\ y e. B ) ) -> x e. B )
39		simprr 537	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. B /\ y e. B ) ) -> y e. B )
40	1, 3	mndcl 13713	. . . . 5 |- ( ( G e. Mnd /\ x e. B /\ y e. B ) -> ( x ( +g ` G ) y ) e. B )
41	37, 38, 39, 40	syl3anc 1278	. . . 4 |- ( ( ( ph /\ -. N < M ) /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` G ) y ) e. B )
42		ssv 3270	. . . . 5 |- B C_ _V
43	42	a1i 9	. . . 4 |- ( ( ph /\ -. N < M ) -> B C_ _V )
44		simprl 535	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. _V /\ y e. _V ) ) -> x e. _V )
45		plusgslid 13443	. . . . . . . 8 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
46	45	slotex 13357	. . . . . . 7 |- ( G e. Mnd -> ( +g ` G ) e. _V )
47	4, 46	syl 14	. . . . . 6 |- ( ph -> ( +g ` G ) e. _V )
48	47	ad2antrr 492	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. _V /\ y e. _V ) ) -> ( +g ` G ) e. _V )
49		simprr 537	. . . . 5 |- ( ( ( ph /\ -. N < M ) /\ ( x e. _V /\ y e. _V ) ) -> y e. _V )
50		ovexg 6109	. . . . 5 |- ( ( x e. _V /\ ( +g ` G ) e. _V /\ y e. _V ) -> ( x ( +g ` G ) y ) e. _V )
51	44, 48, 49, 50	syl3anc 1278	. . . 4 |- ( ( ( ph /\ -. N < M ) /\ ( x e. _V /\ y e. _V ) ) -> ( x ( +g ` G ) y ) e. _V )
52	27, 33, 36, 41, 43, 51	seq3clss 10886	. . 3 |- ( ( ph /\ -. N < M ) -> ( seq M ( ( +g ` G ) , F ) ` N ) e. B )
53	20, 52	eqeltrd 2315	. 2 |- ( ( ph /\ -. N < M ) -> ( G gzsumgz F ) e. B )
54		zdclt 9701	. . . 4 |- ( ( N e. ZZ /\ M e. ZZ ) -> DECID N < M )
55	6, 5, 54	syl2anc 415	. . 3 |- ( ph -> DECID N < M )
56		exmiddc 848	. . 3 |- (DECID N < M -> ( N < M \/ -. N < M ) )
57	55, 56	syl 14	. 2 |- ( ph -> ( N < M \/ -. N < M ) )
58	16, 53, 57	mpjaodan 810	1 |- ( ph -> ( G gzsumgz F ) e. B )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   ifcif 3635   class class class wbr 4125   -->wf 5368   ` cfv 5372  (class class class)co 6075   Fincfn 7012   < clt 8350   <_ cle 8351   ZZcz 9623   ZZ>=cuz 9900   ...cfz 10390   seqcseq 10862   Basecbs 13330   +g cplusg 13408   0gc0g 13587   gzsum_gz cgzsu 13588   Mndcmnd 13706

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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285

This theorem 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-rmo 2536  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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-en 7013  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-2 9342  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391  df-fzo 10528  df-seqfrec 10863  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-gzsum 13590  df-mgm 13653  df-sgrp 13694  df-mnd 13707

This theorem is referenced by:  gzsummhm2  14123