Theorem gsumpart 33157

Description: Express a group sum as a double sum, grouping along a (possibly infinite) partition. (Contributed by Thierry Arnoux, 22-Jun-2024.)

Hypotheses

Ref	Expression
gsumpart.b	⊢ 𝐵 = (Base‘𝐺)
gsumpart.z	⊢ 0 = (0g‘𝐺)
gsumpart.g	⊢ (𝜑 → 𝐺 ∈ CMnd)
gsumpart.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
gsumpart.x	⊢ (𝜑 → 𝑋 ∈ 𝑊)
gsumpart.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
gsumpart.w	⊢ (𝜑 → 𝐹 finSupp 0 )
gsumpart.1	⊢ (𝜑 → Disj 𝑥 ∈ 𝑋 𝐶)
gsumpart.2	⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 = 𝐴)

Assertion

Ref	Expression
gsumpart	⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝑥,𝑋   𝜑,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝑉(𝑥)   𝑊(𝑥)   0 (𝑥)

Proof of Theorem gsumpart

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

Step	Hyp	Ref	Expression
1		gsumpart.b	. . 3 ⊢ 𝐵 = (Base‘𝐺)
2		gsumpart.z	. . 3 ⊢ 0 = (0g‘𝐺)
3		gsumpart.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ CMnd)
4		gsumpart.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		gsumpart.f	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
6		gsumpart.w	. . 3 ⊢ (𝜑 → 𝐹 finSupp 0 )
7		eqid 2737	. . . 4 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
8		gsumpart.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑊)
9		gsumpart.1	. . . 4 ⊢ (𝜑 → Disj 𝑥 ∈ 𝑋 𝐶)
10		gsumpart.2	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 = 𝐴)
11	7, 4, 8, 9, 10	2ndresdjuf1o 32740	. . 3 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1-onto→𝐴)
12	1, 2, 3, 4, 5, 6, 11	gsumf1o 19857	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))))
13		vsnex 5381	. . . . . . 7 ⊢ {𝑥} ∈ V
14	13	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ V)
15	4	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑉)
16		ssidd 3959	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝐴)
17	10, 16	eqsstrd 3970	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
18		iunss 5002	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
19	17, 18	sylib 218	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
20	19	r19.21bi 3230	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ⊆ 𝐴)
21	15, 20	ssexd 5271	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ V)
22	14, 21	xpexd 7706	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ({𝑥} × 𝐶) ∈ V)
23	22	ralrimiva 3130	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
24		iunexg 7917	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V) → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
25	8, 23, 24	syl2anc 585	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
26		relxp 5650	. . . . . 6 ⊢ Rel ({𝑥} × 𝐶)
27	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Rel ({𝑥} × 𝐶))
28	27	ralrimiva 3130	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
29		reliun 5773	. . . 4 ⊢ (Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
30	28, 29	sylibr 234	. . 3 ⊢ (𝜑 → Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
31		dmiun 5870	. . . . . 6 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶)
32		dmxpss 6137	. . . . . . . 8 ⊢ dom ({𝑥} × 𝐶) ⊆ {𝑥}
33	32	rgenw 3056	. . . . . . 7 ⊢ ∀𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥}
34		ss2iun 4967	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥} → ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥})
35	33, 34	ax-mp 5	. . . . . 6 ⊢ ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥}
36	31, 35	eqsstri 3982	. . . . 5 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥}
37		iunid 5018	. . . . 5 ⊢ ∪ 𝑥 ∈ 𝑋 {𝑥} = 𝑋
38	36, 37	sseqtri 3984	. . . 4 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝑋
39	38	a1i 11	. . 3 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝑋)
40		fo2nd 7964	. . . . . . . 8 ⊢ 2nd :V–onto→V
41		fof 6754	. . . . . . . 8 ⊢ (2nd :V–onto→V → 2nd :V⟶V)
42	40, 41	ax-mp 5	. . . . . . 7 ⊢ 2nd :V⟶V
43		ssv 3960	. . . . . . 7 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ V
44		fssres 6708	. . . . . . 7 ⊢ ((2nd :V⟶V ∧ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ V) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V)
45	42, 43, 44	mp2an 693	. . . . . 6 ⊢ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V
46		ffn 6670	. . . . . 6 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
47	45, 46	mp1i 13	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
48		djussxp2 32738	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)
49		imass2 6069	. . . . . . . 8 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)))
50	48, 49	ax-mp 5	. . . . . . 7 ⊢ (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶))
51		ima0 6044	. . . . . . . . . . 11 ⊢ (2nd “ ∅) = ∅
52		xpeq1 5646	. . . . . . . . . . . . 13 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (∅ × ∪ 𝑥 ∈ 𝑋 𝐶))
53		0xp 5731	. . . . . . . . . . . . 13 ⊢ (∅ × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅
54	52, 53	eqtrdi 2788	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅)
55	54	imaeq2d 6027	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = (2nd “ ∅))
56		iuneq1 4965	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∪ 𝑥 ∈ ∅ 𝐶)
57		0iun 5020	. . . . . . . . . . . 12 ⊢ ∪ 𝑥 ∈ ∅ 𝐶 = ∅
58	56, 57	eqtrdi 2788	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∅)
59	51, 55, 58	3eqtr4a 2798	. . . . . . . . . 10 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
60	59	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 = ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
61		2ndimaxp 32736	. . . . . . . . . 10 ⊢ (𝑋 ≠ ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
62	61	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 ≠ ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
63	60, 62	pm2.61dane 3020	. . . . . . . 8 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
64	63, 10	eqtrd 2772	. . . . . . 7 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = 𝐴)
65	50, 64	sseqtrid 3978	. . . . . 6 ⊢ (𝜑 → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴)
66		resssxp 6236	. . . . . 6 ⊢ ((2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴 ↔ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
67	65, 66	sylib 218	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
68		dff2 7053	. . . . 5 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴 ↔ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∧ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴)))
69	47, 67, 68	sylanbrc 584	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
70	5, 69	fcod 6695	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐵)
71	7, 4, 8, 9, 10	2ndresdju 32739	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1→𝐴)
72	2	fvexi 6856	. . . . 5 ⊢ 0 ∈ V
73	72	a1i 11	. . . 4 ⊢ (𝜑 → 0 ∈ V)
74	5, 4	fexd 7183	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
75	6, 71, 73, 74	fsuppco 9317	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))) finSupp 0 )
76	1, 2, 3, 25, 30, 8, 39, 70, 75	gsum2d 19913	. 2 ⊢ (𝜑 → (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))) = (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))))
77		nfcsb1v 3875	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐶
78		csbeq1a 3865	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → 𝐶 = ⦋𝑦 / 𝑥⦌𝐶)
79	8, 21, 77, 78	iunsnima2 32709	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) = ⦋𝑦 / 𝑥⦌𝐶)
80		df-ov 7371	. . . . . . . . 9 ⊢ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩)
81	69	ad2antrr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
82		simplr 769	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ 𝑋)
83		vsnid 4622	. . . . . . . . . . . . . . 15 ⊢ 𝑦 ∈ {𝑦}
84	83	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ {𝑦})
85	79	eleq2d 2823	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↔ 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶))
86	85	biimpa 476	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶)
87	84, 86	opelxpd 5671	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
88		nfcv 2899	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥{𝑦}
89	88, 77	nfxp 5665	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
90	89	nfel2 2918	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
91		sneq 4592	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
92	91, 78	xpeq12d 5663	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ({𝑥} × 𝐶) = ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
93	92	eleq2d 2823	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶) ↔ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)))
94	90, 93	rspce 3567	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝑋 ∧ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
95	82, 87, 94	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
96		eliun 4952	. . . . . . . . . . . 12 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
97	95, 96	sylibr 234	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
98	81, 97	fvco3d 6942	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)))
99	97	fvresd 6862	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = (2nd ‘⟨𝑦, 𝑧⟩))
100		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
101		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
102	100, 101	op2nd 7952	. . . . . . . . . . . 12 ⊢ (2nd ‘⟨𝑦, 𝑧⟩) = 𝑧
103	99, 102	eqtrdi 2788	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = 𝑧)
104	103	fveq2d 6846	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)) = (𝐹‘𝑧))
105	98, 104	eqtrd 2772	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘𝑧))
106	80, 105	eqtrid 2784	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = (𝐹‘𝑧))
107	79, 106	mpteq12dva 5186	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
108	5	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → 𝐹:𝐴⟶𝐵)
109		imassrn 6038	. . . . . . . . . 10 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
110	10	xpeq2d 5662	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (𝑋 × 𝐴))
111	48, 110	sseqtrid 3978	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴))
112		rnss 5896	. . . . . . . . . . . . 13 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
113	111, 112	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
114	113	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
115		rnxpss 6138	. . . . . . . . . . 11 ⊢ ran (𝑋 × 𝐴) ⊆ 𝐴
116	114, 115	sstrdi 3948	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝐴)
117	109, 116	sstrid 3947	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ 𝐴)
118	79, 117	eqsstrrd 3971	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐶 ⊆ 𝐴)
119	108, 118	feqresmpt 6911	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
120	107, 119	eqtr4d 2775	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
121	120	oveq2d 7384	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
122	121	mpteq2dva 5193	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))))
123		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑦(𝐺 Σg (𝐹 ↾ 𝐶))
124		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥𝐺
125		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥 Σg
126		nfcv 2899	. . . . . . 7 ⊢ Ⅎ𝑥𝐹
127	126, 77	nfres 5948	. . . . . 6 ⊢ Ⅎ𝑥(𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)
128	124, 125, 127	nfov 7398	. . . . 5 ⊢ Ⅎ𝑥(𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
129	78	reseq2d 5946	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ 𝐶) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
130	129	oveq2d 7384	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐺 Σg (𝐹 ↾ 𝐶)) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
131	123, 128, 130	cbvmpt 5202	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
132	122, 131	eqtr4di 2790	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))))
133	132	oveq2d 7384	. 2 ⊢ (𝜑 → (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))
134	12, 76, 133	3eqtrd 2776	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  Vcvv 3442  ⦋csb 3851   ⊆ wss 3903  ∅c0 4287  {csn 4582  ⟨cop 4588  ∪ ciun 4948  Disj wdisj 5067   class class class wbr 5100   ↦ cmpt 5181   × cxp 5630  dom cdm 5632  ran crn 5633   ↾ cres 5634   “ cima 5635   ∘ ccom 5636  Rel wrel 5637   Fn wfn 6495  ⟶wf 6496  –onto→wfo 6498  ‘cfv 6500  (class class class)co 7368  2^nd c2nd 7942   finSupp cfsupp 9276  Basecbs 17148  0_gc0g 17371   Σ_g cgsu 17372  CMndccmn 19721

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-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

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-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-disj 5068  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-of 7632  df-om 7819  df-1st 7943  df-2nd 7944  df-supp 8113  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-fsupp 9277  df-oi 9427  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-n0 12414  df-z 12501  df-uz 12764  df-fz 13436  df-fzo 13583  df-seq 13937  df-hash 14266  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-0g 17373  df-gsum 17374  df-mre 17517  df-mrc 17518  df-acs 17520  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-submnd 18721  df-mulg 19010  df-cntz 19258  df-cmn 19723

This theorem is referenced by:  elrspunidl  33521