Theorem gsumpropd2lem 18638

Description: Lemma for gsumpropd2 18639. (Contributed by Thierry Arnoux, 28-Jun-2017.)

Hypotheses

Ref	Expression
gsumpropd2.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
gsumpropd2.g	⊢ (𝜑 → 𝐺 ∈ 𝑊)
gsumpropd2.h	⊢ (𝜑 → 𝐻 ∈ 𝑋)
gsumpropd2.b	⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻))
gsumpropd2.c	⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
gsumpropd2.e	⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
gsumpropd2.n	⊢ (𝜑 → Fun 𝐹)
gsumpropd2.r	⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
gsumprop2dlem.1	⊢ 𝐴 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}))
gsumprop2dlem.2	⊢ 𝐵 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))

Assertion

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

Distinct variable groups:   𝑡,𝑠,𝐹   𝐺,𝑠,𝑡   𝐻,𝑠,𝑡   𝜑,𝑠,𝑡

Allowed substitution hints:   𝐴(𝑡,𝑠)   𝐵(𝑡,𝑠)   𝑉(𝑡,𝑠)   𝑊(𝑡,𝑠)   𝑋(𝑡,𝑠)

Proof of Theorem gsumpropd2lem

Dummy variables 𝑎 𝑏 𝑓 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gsumpropd2.b	. . . . 5 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻))
2	1	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) → (Base‘𝐺) = (Base‘𝐻))
3		gsumpropd2.e	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
4	3	eqeq1d 2739	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → ((𝑠(+g‘𝐺)𝑡) = 𝑡 ↔ (𝑠(+g‘𝐻)𝑡) = 𝑡))
5	3	oveqrspc2v 7387	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑎(+g‘𝐻)𝑏))
6	5	oveqrspc2v 7387	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑡 ∈ (Base‘𝐺) ∧ 𝑠 ∈ (Base‘𝐺))) → (𝑡(+g‘𝐺)𝑠) = (𝑡(+g‘𝐻)𝑠))
7	6	ancom2s 651	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑡(+g‘𝐺)𝑠) = (𝑡(+g‘𝐻)𝑠))
8	7	eqeq1d 2739	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → ((𝑡(+g‘𝐺)𝑠) = 𝑡 ↔ (𝑡(+g‘𝐻)𝑠) = 𝑡))
9	4, 8	anbi12d 633	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
10	9	anassrs 467	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) ∧ 𝑡 ∈ (Base‘𝐺)) → (((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
11	2, 10	raleqbidva 3302	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) → (∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
12	1, 11	rabeqbidva 3406	. . . 4 ⊢ (𝜑 → {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)} = {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)})
13	12	sseq2d 3955	. . 3 ⊢ (𝜑 → (ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)} ↔ ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))
14		eqidd 2738	. . . 4 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐺))
15	14, 1, 3	grpidpropd 18621	. . 3 ⊢ (𝜑 → (0g‘𝐺) = (0g‘𝐻))
16		simprl 771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → 𝑛 ∈ (ℤ≥‘𝑚))
17		gsumpropd2.r	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
18	17	ad2antrr 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → ran 𝐹 ⊆ (Base‘𝐺))
19		gsumpropd2.n	. . . . . . . . . . . . . 14 ⊢ (𝜑 → Fun 𝐹)
20	19	ad2antrr 727	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → Fun 𝐹)
21		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ (𝑚...𝑛))
22		simplrr 778	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → dom 𝐹 = (𝑚...𝑛))
23	21, 22	eleqtrrd 2840	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ dom 𝐹)
24		fvelrn 7022	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐹 ∧ 𝑠 ∈ dom 𝐹) → (𝐹‘𝑠) ∈ ran 𝐹)
25	20, 23, 24	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ ran 𝐹)
26	18, 25	sseldd 3923	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ (Base‘𝐺))
27		gsumpropd2.c	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
28	27	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
29	3	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
30	16, 26, 28, 29	seqfeq4 14004	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))
31	30	eqeq2d 2748	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
32	31	anassrs 467	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) ∧ dom 𝐹 = (𝑚...𝑛)) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
33	32	pm5.32da 579	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
34	33	rexbidva 3160	. . . . . 6 ⊢ (𝜑 → (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
35	34	exbidv 1923	. . . . 5 ⊢ (𝜑 → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
36	35	iotabidv 6476	. . . 4 ⊢ (𝜑 → (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))) = (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
37	12	difeq2d 4067	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}) = (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))
38	37	imaeq2d 6019	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)})))
39		gsumprop2dlem.1	. . . . . . . . . . . . . 14 ⊢ 𝐴 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}))
40		gsumprop2dlem.2	. . . . . . . . . . . . . 14 ⊢ 𝐵 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))
41	38, 39, 40	3eqtr4g 2797	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 = 𝐵)
42	41	fveq2d 6838	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘𝐴) = (♯‘𝐵))
43	42	fveq2d 6838	. . . . . . . . . . 11 ⊢ (𝜑 → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
44	43	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
45		simpr 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) → (♯‘𝐵) ∈ (ℤ≥‘1))
46	17	ad3antrrr 731	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ran 𝐹 ⊆ (Base‘𝐺))
47		f1ofun 6776	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Fun 𝑓)
48	47	ad3antlr 732	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → Fun 𝑓)
49		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ (1...(♯‘𝐵)))
50		f1odm 6778	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → dom 𝑓 = (1...(♯‘𝐴)))
51	50	ad3antlr 732	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → dom 𝑓 = (1...(♯‘𝐴)))
52	42	oveq2d 7376	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (1...(♯‘𝐴)) = (1...(♯‘𝐵)))
53	52	ad3antrrr 731	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (1...(♯‘𝐴)) = (1...(♯‘𝐵)))
54	51, 53	eqtrd 2772	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → dom 𝑓 = (1...(♯‘𝐵)))
55	49, 54	eleqtrrd 2840	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ dom 𝑓)
56		fvco 6932	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝑓 ∧ 𝑎 ∈ dom 𝑓) → ((𝐹 ∘ 𝑓)‘𝑎) = (𝐹‘(𝑓‘𝑎)))
57	48, 55, 56	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) = (𝐹‘(𝑓‘𝑎)))
58	19	ad3antrrr 731	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → Fun 𝐹)
59		difpreima 7011	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (Fun 𝐹 → (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
60	19, 59	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
61	39, 60	eqtrid 2784	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐴 = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
62		difss 4077	. . . . . . . . . . . . . . . . . . 19 ⊢ ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) ⊆ (◡𝐹 “ V)
63	61, 62	eqsstrdi 3967	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ⊆ (◡𝐹 “ V))
64		dfdm4 5844	. . . . . . . . . . . . . . . . . . 19 ⊢ dom 𝐹 = ran ◡𝐹
65		dfrn4 6160	. . . . . . . . . . . . . . . . . . 19 ⊢ ran ◡𝐹 = (◡𝐹 “ V)
66	64, 65	eqtri 2760	. . . . . . . . . . . . . . . . . 18 ⊢ dom 𝐹 = (◡𝐹 “ V)
67	63, 66	sseqtrrdi 3964	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ⊆ dom 𝐹)
68	67	ad3antrrr 731	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝐴 ⊆ dom 𝐹)
69		f1of 6774	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
70	69	ad3antlr 732	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
71	49, 53	eleqtrrd 2840	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ (1...(♯‘𝐴)))
72	70, 71	ffvelcdmd 7031	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑎) ∈ 𝐴)
73	68, 72	sseldd 3923	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑎) ∈ dom 𝐹)
74		fvelrn 7022	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐹 ∧ (𝑓‘𝑎) ∈ dom 𝐹) → (𝐹‘(𝑓‘𝑎)) ∈ ran 𝐹)
75	58, 73, 74	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝐹‘(𝑓‘𝑎)) ∈ ran 𝐹)
76	57, 75	eqeltrd 2837	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) ∈ ran 𝐹)
77	46, 76	sseldd 3923	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) ∈ (Base‘𝐺))
78	27	caovclg 7552	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) ∈ (Base‘𝐺))
79	78	ad4ant14 753	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) ∈ (Base‘𝐺))
80	5	ad4ant14 753	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑎(+g‘𝐻)𝑏))
81	45, 77, 79, 80	seqfeq4 14004	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
82		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ (ℤ≥‘1))
83		1z 12548	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℤ
84		seqfn 13966	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℤ → seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1))
85		fndm 6595	. . . . . . . . . . . . . . . . 17 ⊢ (seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1) → dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) = (ℤ≥‘1))
86	83, 84, 85	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) = (ℤ≥‘1)
87	86	eleq2i 2829	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) ↔ (♯‘𝐵) ∈ (ℤ≥‘1))
88	82, 87	sylnibr 329	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)))
89		ndmfv 6866	. . . . . . . . . . . . . 14 ⊢ (¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
90	88, 89	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
91		seqfn 13966	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℤ → seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1))
92		fndm 6595	. . . . . . . . . . . . . . . . 17 ⊢ (seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1) → dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) = (ℤ≥‘1))
93	83, 91, 92	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) = (ℤ≥‘1)
94	93	eleq2i 2829	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) ↔ (♯‘𝐵) ∈ (ℤ≥‘1))
95	82, 94	sylnibr 329	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)))
96		ndmfv 6866	. . . . . . . . . . . . . 14 ⊢ (¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) → (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
97	95, 96	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
98	90, 97	eqtr4d 2775	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
99	98	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
100	81, 99	pm2.61dan 813	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
101	44, 100	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
102	101	eqeq2d 2748	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) ↔ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵))))
103	102	pm5.32da 579	. . . . . . 7 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
104	52	f1oeq2d 6770	. . . . . . . . 9 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐴))
105	41	f1oeq3d 6771	. . . . . . . . 9 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵))
106	104, 105	bitrd 279	. . . . . . . 8 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵))
107	106	anbi1d 632	. . . . . . 7 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵))) ↔ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
108	103, 107	bitrd 279	. . . . . 6 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
109	108	exbidv 1923	. . . . 5 ⊢ (𝜑 → (∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ ∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
110	109	iotabidv 6476	. . . 4 ⊢ (𝜑 → (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)))) = (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
111	36, 110	ifeq12d 4489	. . 3 ⊢ (𝜑 → if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))))) = if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵))))))
112	13, 15, 111	ifbieq12d 4496	. 2 ⊢ (𝜑 → if(ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}, (0g‘𝐺), if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)))))) = if(ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}, (0g‘𝐻), if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))))
113		eqid 2737	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
114		eqid 2737	. . 3 ⊢ (0g‘𝐺) = (0g‘𝐺)
115		eqid 2737	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
116		eqid 2737	. . 3 ⊢ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)} = {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}
117	39	a1i 11	. . 3 ⊢ (𝜑 → 𝐴 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
118		gsumpropd2.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
119		gsumpropd2.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
120		eqidd 2738	. . 3 ⊢ (𝜑 → dom 𝐹 = dom 𝐹)
121	113, 114, 115, 116, 117, 118, 119, 120	gsumvalx 18635	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = if(ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}, (0g‘𝐺), if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)))))))
122		eqid 2737	. . 3 ⊢ (Base‘𝐻) = (Base‘𝐻)
123		eqid 2737	. . 3 ⊢ (0g‘𝐻) = (0g‘𝐻)
124		eqid 2737	. . 3 ⊢ (+g‘𝐻) = (+g‘𝐻)
125		eqid 2737	. . 3 ⊢ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)} = {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}
126	40	a1i 11	. . 3 ⊢ (𝜑 → 𝐵 = (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)})))
127		gsumpropd2.h	. . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑋)
128	122, 123, 124, 125, 126, 127, 119, 120	gsumvalx 18635	. 2 ⊢ (𝜑 → (𝐻 Σg 𝐹) = if(ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}, (0g‘𝐻), if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))))
129	112, 121, 128	3eqtr4d 2782	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  {crab 3390  Vcvv 3430   ∖ cdif 3887   ⊆ wss 3890  ∅c0 4274  ifcif 4467  ^◡ccnv 5623  dom cdm 5624  ran crn 5625   “ cima 5627   ∘ ccom 5628  ℩cio 6446  Fun wfun 6486   Fn wfn 6487  ⟶wf 6488  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7360  1c1 11030  ℤcz 12515  ℤ_≥cuz 12779  ...cfz 13452  seqcseq 13954  ♯chash 14283  Basecbs 17170  +_gcplusg 17211  0_gc0g 17393   Σ_g cgsu 17394

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-seq 13955  df-0g 17395  df-gsum 17396

This theorem is referenced by:  gsumpropd2  18639