Theorem gsumress 18596

Description: The group sum in a substructure is the same as the group sum in the original structure. The only requirement on the substructure is that it contain the identity element; neither 𝐺 nor 𝐻 need be groups. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by Mario Carneiro, 30-Apr-2015.)

Hypotheses

Ref	Expression
gsumress.b	⊢ 𝐵 = (Base‘𝐺)
gsumress.o	⊢ + = (+g‘𝐺)
gsumress.h	⊢ 𝐻 = (𝐺 ↾s 𝑆)
gsumress.g	⊢ (𝜑 → 𝐺 ∈ 𝑉)
gsumress.a	⊢ (𝜑 → 𝐴 ∈ 𝑋)
gsumress.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
gsumress.f	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
gsumress.z	⊢ (𝜑 → 0 ∈ 𝑆)
gsumress.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))

Assertion

Ref	Expression
gsumress	⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐺   𝜑,𝑥   𝑥,𝑆   𝑥,𝐻   𝑥, +   𝑥, 0

Allowed substitution hints:   𝐴(𝑥)   𝐹(𝑥)   𝑉(𝑥)   𝑋(𝑥)

Proof of Theorem gsumress

Dummy variables 𝑓 𝑚 𝑛 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 7359	. . . . . . . . . 10 ⊢ (𝑦 = 0 → (𝑦 + 𝑥) = ( 0 + 𝑥))
2	1	eqeq1d 2733	. . . . . . . . 9 ⊢ (𝑦 = 0 → ((𝑦 + 𝑥) = 𝑥 ↔ ( 0 + 𝑥) = 𝑥))
3	2	ovanraleqv 7376	. . . . . . . 8 ⊢ (𝑦 = 0 → (∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
4		gsumress.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
5		gsumress.z	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ 𝑆)
6	4, 5	sseldd 3930	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ 𝐵)
7		gsumress.c	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
8	7	ralrimiva 3124	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
9	3, 6, 8	elrabd 3644	. . . . . . 7 ⊢ (𝜑 → 0 ∈ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)})
10	9	snssd 4760	. . . . . 6 ⊢ (𝜑 → { 0 } ⊆ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)})
11		gsumress.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
12		gsumress.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐺)
13		eqid 2731	. . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺)
14		gsumress.o	. . . . . . . . 9 ⊢ + = (+g‘𝐺)
15		eqid 2731	. . . . . . . . 9 ⊢ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)}
16	12, 13, 14, 15	mgmidsssn0 18586	. . . . . . . 8 ⊢ (𝐺 ∈ 𝑉 → {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} ⊆ {(0g‘𝐺)})
17	11, 16	syl 17	. . . . . . 7 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} ⊆ {(0g‘𝐺)})
18	17, 9	sseldd 3930	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ {(0g‘𝐺)})
19		elsni 4592	. . . . . . . . 9 ⊢ ( 0 ∈ {(0g‘𝐺)} → 0 = (0g‘𝐺))
20	18, 19	syl 17	. . . . . . . 8 ⊢ (𝜑 → 0 = (0g‘𝐺))
21	20	sneqd 4587	. . . . . . 7 ⊢ (𝜑 → { 0 } = {(0g‘𝐺)})
22	17, 21	sseqtrrd 3967	. . . . . 6 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} ⊆ { 0 })
23	10, 22	eqssd 3947	. . . . 5 ⊢ (𝜑 → { 0 } = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)})
24	2	ovanraleqv 7376	. . . . . . . . 9 ⊢ (𝑦 = 0 → (∀𝑥 ∈ 𝑆 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥) ↔ ∀𝑥 ∈ 𝑆 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))
25	4	sselda 3929	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
26	25, 7	syldan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
27	26	ralrimiva 3124	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
28	24, 5, 27	elrabd 3644	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ {𝑦 ∈ 𝑆 ∣ ∀𝑥 ∈ 𝑆 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)})
29		gsumress.h	. . . . . . . . . . 11 ⊢ 𝐻 = (𝐺 ↾s 𝑆)
30	29, 12	ressbas2 17155	. . . . . . . . . 10 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘𝐻))
31	4, 30	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 = (Base‘𝐻))
32		fvex 6841	. . . . . . . . . . . . . . 15 ⊢ (Base‘𝐻) ∈ V
33	31, 32	eqeltrdi 2839	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ V)
34	29, 14	ressplusg 17201	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ V → + = (+g‘𝐻))
35	33, 34	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → + = (+g‘𝐻))
36	35	oveqd 7369	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 + 𝑥) = (𝑦(+g‘𝐻)𝑥))
37	36	eqeq1d 2733	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑦 + 𝑥) = 𝑥 ↔ (𝑦(+g‘𝐻)𝑥) = 𝑥))
38	35	oveqd 7369	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 + 𝑦) = (𝑥(+g‘𝐻)𝑦))
39	38	eqeq1d 2733	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 + 𝑦) = 𝑥 ↔ (𝑥(+g‘𝐻)𝑦) = 𝑥))
40	37, 39	anbi12d 632	. . . . . . . . . 10 ⊢ (𝜑 → (((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥) ↔ ((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)))
41	31, 40	raleqbidv 3312	. . . . . . . . 9 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)))
42	31, 41	rabeqbidv 3413	. . . . . . . 8 ⊢ (𝜑 → {𝑦 ∈ 𝑆 ∣ ∀𝑥 ∈ 𝑆 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} = {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})
43	28, 42	eleqtrd 2833	. . . . . . 7 ⊢ (𝜑 → 0 ∈ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})
44	43	snssd 4760	. . . . . 6 ⊢ (𝜑 → { 0 } ⊆ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})
45	29	ovexi 7386	. . . . . . . . 9 ⊢ 𝐻 ∈ V
46	45	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ V)
47		eqid 2731	. . . . . . . . 9 ⊢ (Base‘𝐻) = (Base‘𝐻)
48		eqid 2731	. . . . . . . . 9 ⊢ (0g‘𝐻) = (0g‘𝐻)
49		eqid 2731	. . . . . . . . 9 ⊢ (+g‘𝐻) = (+g‘𝐻)
50		eqid 2731	. . . . . . . . 9 ⊢ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)} = {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)}
51	47, 48, 49, 50	mgmidsssn0 18586	. . . . . . . 8 ⊢ (𝐻 ∈ V → {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)} ⊆ {(0g‘𝐻)})
52	46, 51	syl 17	. . . . . . 7 ⊢ (𝜑 → {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)} ⊆ {(0g‘𝐻)})
53	52, 43	sseldd 3930	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ {(0g‘𝐻)})
54		elsni 4592	. . . . . . . . 9 ⊢ ( 0 ∈ {(0g‘𝐻)} → 0 = (0g‘𝐻))
55	53, 54	syl 17	. . . . . . . 8 ⊢ (𝜑 → 0 = (0g‘𝐻))
56	55	sneqd 4587	. . . . . . 7 ⊢ (𝜑 → { 0 } = {(0g‘𝐻)})
57	52, 56	sseqtrrd 3967	. . . . . 6 ⊢ (𝜑 → {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)} ⊆ { 0 })
58	44, 57	eqssd 3947	. . . . 5 ⊢ (𝜑 → { 0 } = {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})
59	23, 58	eqtr3d 2768	. . . 4 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} = {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})
60	59	sseq2d 3962	. . 3 ⊢ (𝜑 → (ran 𝐹 ⊆ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)} ↔ ran 𝐹 ⊆ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)}))
61	20, 55	eqtr3d 2768	. . 3 ⊢ (𝜑 → (0g‘𝐺) = (0g‘𝐻))
62	35	seqeq2d 13921	. . . . . . . . . 10 ⊢ (𝜑 → seq𝑚( + , 𝐹) = seq𝑚((+g‘𝐻), 𝐹))
63	62	fveq1d 6830	. . . . . . . . 9 ⊢ (𝜑 → (seq𝑚( + , 𝐹)‘𝑛) = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))
64	63	eqeq2d 2742	. . . . . . . 8 ⊢ (𝜑 → (𝑧 = (seq𝑚( + , 𝐹)‘𝑛) ↔ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
65	64	anbi2d 630	. . . . . . 7 ⊢ (𝜑 → ((𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ (𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
66	65	rexbidv 3156	. . . . . 6 ⊢ (𝜑 → (∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
67	66	exbidv 1922	. . . . 5 ⊢ (𝜑 → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
68	67	iotabidv 6471	. . . 4 ⊢ (𝜑 → (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛))) = (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
69	35	seqeq2d 13921	. . . . . . . . 9 ⊢ (𝜑 → seq1( + , (𝐹 ∘ 𝑓)) = seq1((+g‘𝐻), (𝐹 ∘ 𝑓)))
70	69	fveq1d 6830	. . . . . . . 8 ⊢ (𝜑 → (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))
71	70	eqeq2d 2742	. . . . . . 7 ⊢ (𝜑 → (𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))) ↔ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 }))))))
72	71	anbi2d 630	. . . . . 6 ⊢ (𝜑 → ((𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 }))))) ↔ (𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))
73	72	exbidv 1922	. . . . 5 ⊢ (𝜑 → (∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 }))))) ↔ ∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))
74	73	iotabidv 6471	. . . 4 ⊢ (𝜑 → (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))) = (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))
75	68, 74	ifeq12d 4496	. . 3 ⊢ (𝜑 → if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 }))))))) = if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 }))))))))
76	60, 61, 75	ifbieq12d 4503	. 2 ⊢ (𝜑 → if(ran 𝐹 ⊆ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)}, (0g‘𝐺), if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))) = if(ran 𝐹 ⊆ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)}, (0g‘𝐻), if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))))
77	23	difeq2d 4075	. . . 4 ⊢ (𝜑 → (V ∖ { 0 }) = (V ∖ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)}))
78	77	imaeq2d 6014	. . 3 ⊢ (𝜑 → (◡𝐹 “ (V ∖ { 0 })) = (◡𝐹 “ (V ∖ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)})))
79		gsumress.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
80		gsumress.f	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
81	80, 4	fssd 6674	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
82	12, 13, 14, 15, 78, 11, 79, 81	gsumval 18591	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = if(ran 𝐹 ⊆ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐵 ((𝑦 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑦) = 𝑥)}, (0g‘𝐺), if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚( + , 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1( + , (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))))
83	58	difeq2d 4075	. . . 4 ⊢ (𝜑 → (V ∖ { 0 }) = (V ∖ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)}))
84	83	imaeq2d 6014	. . 3 ⊢ (𝜑 → (◡𝐹 “ (V ∖ { 0 })) = (◡𝐹 “ (V ∖ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)})))
85	31	feq3d 6642	. . . 4 ⊢ (𝜑 → (𝐹:𝐴⟶𝑆 ↔ 𝐹:𝐴⟶(Base‘𝐻)))
86	80, 85	mpbid 232	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶(Base‘𝐻))
87	47, 48, 49, 50, 84, 46, 79, 86	gsumval 18591	. 2 ⊢ (𝜑 → (𝐻 Σg 𝐹) = if(ran 𝐹 ⊆ {𝑦 ∈ (Base‘𝐻) ∣ ∀𝑥 ∈ (Base‘𝐻)((𝑦(+g‘𝐻)𝑥) = 𝑥 ∧ (𝑥(+g‘𝐻)𝑦) = 𝑥)}, (0g‘𝐻), if(𝐴 ∈ ran ..., (℩𝑧∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑧 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑧∃𝑓(𝑓:(1...(♯‘(◡𝐹 “ (V ∖ { 0 }))))–1-1-onto→(◡𝐹 “ (V ∖ { 0 })) ∧ 𝑧 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘(◡𝐹 “ (V ∖ { 0 })))))))))
88	76, 82, 87	3eqtr4d 2776	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2111  ∀wral 3047  ∃wrex 3056  {crab 3395  Vcvv 3436   ∖ cdif 3894   ⊆ wss 3897  ifcif 4474  {csn 4575  ^◡ccnv 5618  ran crn 5620   “ cima 5622   ∘ ccom 5623  ℩cio 6441  ⟶wf 6483  –1-1-onto→wf1o 6486  ‘cfv 6487  (class class class)co 7352  1c1 11013  ℤ_≥cuz 12738  ...cfz 13413  seqcseq 13914  ♯chash 14243  Basecbs 17126   ↾_s cress 17147  +_gcplusg 17167  0_gc0g 17349   Σ_g cgsu 17350

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11068  ax-resscn 11069  ax-1cn 11070  ax-icn 11071  ax-addcl 11072  ax-addrcl 11073  ax-mulcl 11074  ax-mulrcl 11075  ax-mulcom 11076  ax-addass 11077  ax-mulass 11078  ax-distr 11079  ax-i2m1 11080  ax-1ne0 11081  ax-1rid 11082  ax-rnegex 11083  ax-rrecex 11084  ax-cnre 11085  ax-pre-lttri 11086  ax-pre-lttrn 11087  ax-pre-ltadd 11088  ax-pre-mulgt0 11089

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6254  df-ord 6315  df-on 6316  df-lim 6317  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11154  df-mnf 11155  df-xr 11156  df-ltxr 11157  df-le 11158  df-sub 11352  df-neg 11353  df-nn 12132  df-2 12194  df-seq 13915  df-sets 17081  df-slot 17099  df-ndx 17111  df-base 17127  df-ress 17148  df-plusg 17180  df-0g 17351  df-gsum 17352

This theorem is referenced by:  gsumsubm  18749  regsumfsum  21378  regsumsupp  21565  frlmgsum  21715  imasdsf1olem  24294  gsumsubg  33033  gsumzrsum  33046  ressply1evls1  33535  esumpfinvallem  34094  sge0tsms  46483  aacllem  49907