Theorem gsumpropd2lem 18848

Description: Lemma for gsumpropd2 18849. (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 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) → (Base‘𝐺) = (Base‘𝐻))
3		gsumpropd2.e	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
4	3	eqeq1d 2763	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → ((𝑠(+g‘𝐺)𝑡) = 𝑡 ↔ (𝑠(+g‘𝐻)𝑡) = 𝑡))
5	3	oveqrspc2v 7439	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑎(+g‘𝐻)𝑏))
6	5	oveqrspc2v 7439	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑡 ∈ (Base‘𝐺) ∧ 𝑠 ∈ (Base‘𝐺))) → (𝑡(+g‘𝐺)𝑠) = (𝑡(+g‘𝐻)𝑠))
7	6	ancom2s 663	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑡(+g‘𝐺)𝑠) = (𝑡(+g‘𝐻)𝑠))
8	7	eqeq1d 2763	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → ((𝑡(+g‘𝐺)𝑠) = 𝑡 ↔ (𝑡(+g‘𝐻)𝑠) = 𝑡))
9	4, 8	anbi12d 644	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
10	9	anassrs 473	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) ∧ 𝑡 ∈ (Base‘𝐺)) → (((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
11	2, 10	raleqbidva 3326	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (Base‘𝐺)) → (∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡) ↔ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)))
12	1, 11	rabeqbidva 3429	. . . 4 ⊢ (𝜑 → {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)} = {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)})
13	12	sseq2d 3963	. . 3 ⊢ (𝜑 → (ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)} ↔ ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))
14		eqidd 2762	. . . 4 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐺))
15	14, 1, 3	grpidpropd 18822	. . 3 ⊢ (𝜑 → (0g‘𝐺) = (0g‘𝐻))
16		simprl 783	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → 𝑛 ∈ (ℤ≥‘𝑚))
17		gsumpropd2.r	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺))
18	17	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → ran 𝐹 ⊆ (Base‘𝐺))
19		gsumpropd2.n	. . . . . . . . . . . . . 14 ⊢ (𝜑 → Fun 𝐹)
20	19	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → Fun 𝐹)
21		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ (𝑚...𝑛))
22		simplrr 790	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → dom 𝐹 = (𝑚...𝑛))
23	21, 22	eleqtrrd 2864	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → 𝑠 ∈ dom 𝐹)
24		fvelrn 7068	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐹 ∧ 𝑠 ∈ dom 𝐹) → (𝐹‘𝑠) ∈ ran 𝐹)
25	20, 23, 24	syl2anc 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ ran 𝐹)
26	18, 25	sseldd 3932	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ 𝑠 ∈ (𝑚...𝑛)) → (𝐹‘𝑠) ∈ (Base‘𝐺))
27		gsumpropd2.c	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
28	27	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))
29	3	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡))
30	16, 26, 28, 29	seqfeq4 14174	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))
31	30	eqeq2d 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑚) ∧ dom 𝐹 = (𝑚...𝑛))) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
32	31	anassrs 473	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) ∧ dom 𝐹 = (𝑚...𝑛)) → (𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛)))
33	32	pm5.32da 590	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑚)) → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
34	33	rexbidva 3185	. . . . . 6 ⊢ (𝜑 → (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
35	34	exbidv 1954	. . . . 5 ⊢ (𝜑 → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
36	35	iotabidv 6515	. . . 4 ⊢ (𝜑 → (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))) = (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐻), 𝐹)‘𝑛))))
37	12	difeq2d 4074	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}) = (V ∖ {𝑠 ∈ (Base‘𝐻) ∣ ∀𝑡 ∈ (Base‘𝐻)((𝑠(+g‘𝐻)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐻)𝑠) = 𝑡)}))
38	37	imaeq2d 6054	. . . . . . . . . . . . . 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 2821	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 = 𝐵)
42	41	fveq2d 6881	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘𝐴) = (♯‘𝐵))
43	42	fveq2d 6881	. . . . . . . . . . 11 ⊢ (𝜑 → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
44	43	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
45		simpr 490	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) → (♯‘𝐵) ∈ (ℤ≥‘1))
46	17	ad3antrrr 743	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ran 𝐹 ⊆ (Base‘𝐺))
47		f1ofun 6818	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Fun 𝑓)
48	47	ad3antlr 744	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → Fun 𝑓)
49		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ (1...(♯‘𝐵)))
50		f1odm 6820	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → dom 𝑓 = (1...(♯‘𝐴)))
51	50	ad3antlr 744	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → dom 𝑓 = (1...(♯‘𝐴)))
52	42	oveq2d 7428	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (1...(♯‘𝐴)) = (1...(♯‘𝐵)))
53	52	ad3antrrr 743	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (1...(♯‘𝐴)) = (1...(♯‘𝐵)))
54	51, 53	eqtrd 2796	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → dom 𝑓 = (1...(♯‘𝐵)))
55	49, 54	eleqtrrd 2864	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ dom 𝑓)
56		fvco 6975	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝑓 ∧ 𝑎 ∈ dom 𝑓) → ((𝐹 ∘ 𝑓)‘𝑎) = (𝐹‘(𝑓‘𝑎)))
57	48, 55, 56	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) = (𝐹‘(𝑓‘𝑎)))
58	19	ad3antrrr 743	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → Fun 𝐹)
59		difpreima 7056	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (Fun 𝐹 → (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
60	19, 59	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
61	39, 60	eqtrid 2808	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐴 = ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})))
62		difss 4083	. . . . . . . . . . . . . . . . . . 19 ⊢ ((◡𝐹 “ V) ∖ (◡𝐹 “ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)})) ⊆ (◡𝐹 “ V)
63	61, 62	eqsstrdi 3975	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ⊆ (◡𝐹 “ V))
64		dfdm4 5877	. . . . . . . . . . . . . . . . . . 19 ⊢ dom 𝐹 = ran ◡𝐹
65		dfrn4 6194	. . . . . . . . . . . . . . . . . . 19 ⊢ ran ◡𝐹 = (◡𝐹 “ V)
66	64, 65	eqtri 2784	. . . . . . . . . . . . . . . . . 18 ⊢ dom 𝐹 = (◡𝐹 “ V)
67	63, 66	sseqtrrdi 3972	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ⊆ dom 𝐹)
68	67	ad3antrrr 743	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝐴 ⊆ dom 𝐹)
69		f1of 6816	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
70	69	ad3antlr 744	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
71	49, 53	eleqtrrd 2864	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → 𝑎 ∈ (1...(♯‘𝐴)))
72	70, 71	ffvelcdmd 7077	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑎) ∈ 𝐴)
73	68, 72	sseldd 3932	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑎) ∈ dom 𝐹)
74		fvelrn 7068	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐹 ∧ (𝑓‘𝑎) ∈ dom 𝐹) → (𝐹‘(𝑓‘𝑎)) ∈ ran 𝐹)
75	58, 73, 74	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → (𝐹‘(𝑓‘𝑎)) ∈ ran 𝐹)
76	57, 75	eqeltrd 2861	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) ∈ ran 𝐹)
77	46, 76	sseldd 3932	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ 𝑎 ∈ (1...(♯‘𝐵))) → ((𝐹 ∘ 𝑓)‘𝑎) ∈ (Base‘𝐺))
78	27	caovclg 7605	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) ∈ (Base‘𝐺))
79	78	ad4ant14 765	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) ∈ (Base‘𝐺))
80	5	ad4ant14 765	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g‘𝐺)𝑏) = (𝑎(+g‘𝐻)𝑏))
81	45, 77, 79, 80	seqfeq4 14174	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
82		simpr 490	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ (ℤ≥‘1))
83		1z 12707	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℤ
84		seqfn 14136	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℤ → seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1))
85		fndm 6634	. . . . . . . . . . . . . . . . 17 ⊢ (seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1) → dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) = (ℤ≥‘1))
86	83, 84, 85	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) = (ℤ≥‘1)
87	86	eleq2i 2853	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) ↔ (♯‘𝐵) ∈ (ℤ≥‘1))
88	82, 87	sylnibr 332	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)))
89		ndmfv 6909	. . . . . . . . . . . . . 14 ⊢ (¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐺), (𝐹 ∘ 𝑓)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
90	88, 89	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
91		seqfn 14136	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℤ → seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1))
92		fndm 6634	. . . . . . . . . . . . . . . . 17 ⊢ (seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) Fn (ℤ≥‘1) → dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) = (ℤ≥‘1))
93	83, 91, 92	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) = (ℤ≥‘1)
94	93	eleq2i 2853	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) ↔ (♯‘𝐵) ∈ (ℤ≥‘1))
95	82, 94	sylnibr 332	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → ¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)))
96		ndmfv 6909	. . . . . . . . . . . . . 14 ⊢ (¬ (♯‘𝐵) ∈ dom seq1((+g‘𝐻), (𝐹 ∘ 𝑓)) → (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
97	95, 96	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = ∅)
98	90, 97	eqtr4d 2799	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
99	98	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) ∧ ¬ (♯‘𝐵) ∈ (ℤ≥‘1)) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
100	81, 99	pm2.61dan 825	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐵)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
101	44, 100	eqtrd 2796	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))
102	101	eqeq2d 2772	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)) ↔ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵))))
103	102	pm5.32da 590	. . . . . . 7 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
104	52	f1oeq2d 6812	. . . . . . . . 9 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐴))
105	41	f1oeq3d 6813	. . . . . . . . 9 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵))
106	104, 105	bitrd 282	. . . . . . . 8 ⊢ (𝜑 → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵))
107	106	anbi1d 643	. . . . . . 7 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵))) ↔ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
108	103, 107	bitrd 282	. . . . . 6 ⊢ (𝜑 → ((𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
109	108	exbidv 1954	. . . . 5 ⊢ (𝜑 → (∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴))) ↔ ∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
110	109	iotabidv 6515	. . . 4 ⊢ (𝜑 → (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)))) = (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑥 = (seq1((+g‘𝐻), (𝐹 ∘ 𝑓))‘(♯‘𝐵)))))
111	36, 110	ifeq12d 4504	. . 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 4511	. 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 2761	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
114		eqid 2761	. . 3 ⊢ (0g‘𝐺) = (0g‘𝐺)
115		eqid 2761	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
116		eqid 2761	. . 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 2762	. . 3 ⊢ (𝜑 → dom 𝐹 = dom 𝐹)
121	113, 114, 115, 116, 117, 118, 119, 120	gsumvalx 18845	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = if(ran 𝐹 ⊆ {𝑠 ∈ (Base‘𝐺) ∣ ∀𝑡 ∈ (Base‘𝐺)((𝑠(+g‘𝐺)𝑡) = 𝑡 ∧ (𝑡(+g‘𝐺)𝑠) = 𝑡)}, (0g‘𝐺), if(dom 𝐹 ∈ ran ..., (℩𝑥∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), 𝐹)‘𝑛))), (℩𝑥∃𝑓(𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ 𝑥 = (seq1((+g‘𝐺), (𝐹 ∘ 𝑓))‘(♯‘𝐴)))))))
122		eqid 2761	. . 3 ⊢ (Base‘𝐻) = (Base‘𝐻)
123		eqid 2761	. . 3 ⊢ (0g‘𝐻) = (0g‘𝐻)
124		eqid 2761	. . 3 ⊢ (+g‘𝐻) = (+g‘𝐻)
125		eqid 2761	. . 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 18845	. 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 2806	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  ifcif 4482  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654   ∘ ccom 5655  ℩cio 6485  Fun wfun 6525   Fn wfn 6526  ⟶wf 6527  –1-1-onto→wf1o 6530  ‘cfv 6531  (class class class)co 7412  1c1 11182  ℤcz 12674  ℤ_≥cuz 12946  ...cfz 13620  seqcseq 14124  ♯chash 14454  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590   Σ_g cgsu 17591

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-n0 12588  df-z 12675  df-uz 12947  df-fz 13621  df-seq 14125  df-0g 17592  df-gsum 17593

This theorem is used by:  gsumpropd2  18849