Theorem gsumpart 33240

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 2762	. . . 4 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
8		gsumpart.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑊)
9		gsumpart.1	. . . 4 ⊢ (𝜑 → Disj 𝑥 ∈ 𝑋 𝐶)
10		gsumpart.2	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 = 𝐴)
11	7, 4, 8, 9, 10	2ndresdjuf1o 32849	. . 3 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1-onto→𝐴)
12	1, 2, 3, 4, 5, 6, 11	gsumf1o 19956	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))))
13		vsnex 5392	. . . . . . 7 ⊢ {𝑥} ∈ V
14	13	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ V)
15	4	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑉)
16		ssidd 3959	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝐴)
17	10, 16	eqsstrd 3970	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
18		iunss 5002	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
19	17, 18	sylib 220	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
20	19	r19.21bi 3254	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ⊆ 𝐴)
21	15, 20	ssexd 5280	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ V)
22	14, 21	xpexd 7734	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ({𝑥} × 𝐶) ∈ V)
23	22	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
24		iunexg 7944	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V) → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
25	8, 23, 24	syl2anc 593	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
26		relxp 5665	. . . . . 6 ⊢ Rel ({𝑥} × 𝐶)
27	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Rel ({𝑥} × 𝐶))
28	27	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
29		reliun 5789	. . . 4 ⊢ (Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
30	28, 29	sylibr 236	. . 3 ⊢ (𝜑 → Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
31		dmiun 5889	. . . . . 6 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶)
32		dmxpss 6157	. . . . . . . 8 ⊢ dom ({𝑥} × 𝐶) ⊆ {𝑥}
33	32	rgenw 3080	. . . . . . 7 ⊢ ∀𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥}
34		ss2iun 4968	. . . . . . 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 7991	. . . . . . . 8 ⊢ 2nd :V–onto→V
41		fof 6778	. . . . . . . 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 6730	. . . . . . 7 ⊢ ((2nd :V⟶V ∧ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ V) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V)
45	42, 43, 44	mp2an 702	. . . . . 6 ⊢ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V
46		ffn 6691	. . . . . 6 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
47	45, 46	mp1i 13	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
48		djussxp2 32847	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)
49		imass2 6091	. . . . . . . 8 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)))
50	48, 49	ax-mp 5	. . . . . . 7 ⊢ (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶))
51		ima0 6066	. . . . . . . . . . 11 ⊢ (2nd “ ∅) = ∅
52		xpeq1 5661	. . . . . . . . . . . . 13 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (∅ × ∪ 𝑥 ∈ 𝑋 𝐶))
53		0xp 5746	. . . . . . . . . . . . 13 ⊢ (∅ × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅
54	52, 53	eqtrdi 2813	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅)
55	54	imaeq2d 6049	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = (2nd “ ∅))
56		iuneq1 4966	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∪ 𝑥 ∈ ∅ 𝐶)
57		0iun 5020	. . . . . . . . . . . 12 ⊢ ∪ 𝑥 ∈ ∅ 𝐶 = ∅
58	56, 57	eqtrdi 2813	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∅)
59	51, 55, 58	3eqtr4a 2823	. . . . . . . . . 10 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
60	59	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 = ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
61		2ndimaxp 32845	. . . . . . . . . 10 ⊢ (𝑋 ≠ ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
62	61	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 ≠ ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
63	60, 62	pm2.61dane 3044	. . . . . . . 8 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
64	63, 10	eqtrd 2797	. . . . . . 7 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = 𝐴)
65	50, 64	sseqtrid 3978	. . . . . 6 ⊢ (𝜑 → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴)
66		resssxp 6257	. . . . . 6 ⊢ ((2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴 ↔ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
67	65, 66	sylib 220	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
68		dff2 7080	. . . . 5 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴 ↔ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∧ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴)))
69	47, 67, 68	sylanbrc 592	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
70	5, 69	fcod 6717	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐵)
71	7, 4, 8, 9, 10	2ndresdju 32848	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1→𝐴)
72	2	fvexi 6881	. . . . 5 ⊢ 0 ∈ V
73	72	a1i 11	. . . 4 ⊢ (𝜑 → 0 ∈ V)
74	5, 4	fexd 7211	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
75	6, 71, 73, 74	fsuppco 9348	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))) finSupp 0 )
76	1, 2, 3, 25, 30, 8, 39, 70, 75	gsum2d 20012	. 2 ⊢ (𝜑 → (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))) = (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))))
77		nfcsb1v 3876	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐶
78		csbeq1a 3866	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → 𝐶 = ⦋𝑦 / 𝑥⦌𝐶)
79	8, 21, 77, 78	iunsnima2 32818	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) = ⦋𝑦 / 𝑥⦌𝐶)
80		df-ov 7399	. . . . . . . . 9 ⊢ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩)
81	69	ad2antrr 736	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
82		simplr 778	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ 𝑋)
83		vsnid 4622	. . . . . . . . . . . . . . 15 ⊢ 𝑦 ∈ {𝑦}
84	83	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ {𝑦})
85	79	eleq2d 2848	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↔ 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶))
86	85	biimpa 480	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶)
87	84, 86	opelxpd 5686	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
88		nfcv 2924	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥{𝑦}
89	88, 77	nfxp 5680	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
90	89	nfel2 2942	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
91		sneq 4592	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
92	91, 78	xpeq12d 5678	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ({𝑥} × 𝐶) = ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
93	92	eleq2d 2848	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶) ↔ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)))
94	90, 93	rspce 3570	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝑋 ∧ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
95	82, 87, 94	syl2anc 593	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
96		eliun 4953	. . . . . . . . . . . 12 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
97	95, 96	sylibr 236	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
98	81, 97	fvco3d 6968	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)))
99	97	fvresd 6887	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = (2nd ‘⟨𝑦, 𝑧⟩))
100		vex 3458	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
101		vex 3458	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
102	100, 101	op2nd 7979	. . . . . . . . . . . 12 ⊢ (2nd ‘⟨𝑦, 𝑧⟩) = 𝑧
103	99, 102	eqtrdi 2813	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = 𝑧)
104	103	fveq2d 6871	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)) = (𝐹‘𝑧))
105	98, 104	eqtrd 2797	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘𝑧))
106	80, 105	eqtrid 2809	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = (𝐹‘𝑧))
107	79, 106	mpteq12dva 5186	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
108	5	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → 𝐹:𝐴⟶𝐵)
109		imassrn 6060	. . . . . . . . . 10 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
110	10	xpeq2d 5677	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (𝑋 × 𝐴))
111	48, 110	sseqtrid 3978	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴))
112		rnss 5915	. . . . . . . . . . . . 13 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
113	111, 112	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
114	113	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
115		rnxpss 6158	. . . . . . . . . . 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 6936	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
120	107, 119	eqtr4d 2800	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
121	120	oveq2d 7412	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
122	121	mpteq2dva 5193	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))))
123		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑦(𝐺 Σg (𝐹 ↾ 𝐶))
124		nfcv 2924	. . . . . 6 ⊢ Ⅎ𝑥𝐺
125		nfcv 2924	. . . . . 6 ⊢ Ⅎ𝑥 Σg
126		nfcv 2924	. . . . . . 7 ⊢ Ⅎ𝑥𝐹
127	126, 77	nfres 5967	. . . . . 6 ⊢ Ⅎ𝑥(𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)
128	124, 125, 127	nfov 7426	. . . . 5 ⊢ Ⅎ𝑥(𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
129	78	reseq2d 5965	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ 𝐶) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
130	129	oveq2d 7412	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐺 Σg (𝐹 ↾ 𝐶)) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
131	123, 128, 130	cbvmpt 5202	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
132	122, 131	eqtr4di 2815	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))))
133	132	oveq2d 7412	. 2 ⊢ (𝜑 → (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))
134	12, 76, 133	3eqtrd 2801	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1560   ∈ wcel 2142   ≠ wne 2957  ∀wral 3076  ∃wrex 3086  Vcvv 3454  ⦋csb 3852   ⊆ wss 3904  ∅c0 4285  {csn 4582  ⟨cop 4588  ∪ ciun 4949  Disj wdisj 5067   class class class wbr 5100   ↦ cmpt 5181   × cxp 5645  dom cdm 5647  ran crn 5648   ↾ cres 5649   “ cima 5650   ∘ ccom 5651  Rel wrel 5652   Fn wfn 6516  ⟶wf 6517  –onto→wfo 6519  ‘cfv 6521  (class class class)co 7396  2^nd c2nd 7969   finSupp cfsupp 9307  Basecbs 17245  0_gc0g 17468   Σ_g cgsu 17469  CMndccmn 19820

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130  ax-1cn 11131  ax-icn 11132  ax-addcl 11133  ax-addrcl 11134  ax-mulcl 11135  ax-mulrcl 11136  ax-mulcom 11137  ax-addass 11138  ax-mulass 11139  ax-distr 11140  ax-i2m1 11141  ax-1ne0 11142  ax-1rid 11143  ax-rnegex 11144  ax-rrecex 11145  ax-cnre 11146  ax-pre-lttri 11147  ax-pre-lttrn 11148  ax-pre-ltadd 11149  ax-pre-mulgt0 11150

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-iin 4952  df-disj 5068  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-isom 6530  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-of 7660  df-om 7847  df-1st 7970  df-2nd 7971  df-supp 8141  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-2o 8438  df-er 8678  df-en 8928  df-dom 8929  df-sdom 8930  df-fin 8931  df-fsupp 9308  df-oi 9458  df-card 9897  df-pnf 11218  df-mnf 11219  df-xr 11220  df-ltxr 11221  df-le 11222  df-sub 11416  df-neg 11417  df-nn 12211  df-2 12280  df-n0 12482  df-z 12569  df-uz 12840  df-fz 13513  df-fzo 13660  df-seq 14015  df-hash 14344  df-sets 17200  df-slot 17218  df-ndx 17230  df-base 17246  df-ress 17267  df-plusg 17299  df-0g 17470  df-gsum 17471  df-mre 17614  df-mrc 17615  df-acs 17617  df-mgm 18674  df-sgrp 18753  df-mnd 18769  df-submnd 18818  df-mulg 19110  df-cntz 19357  df-cmn 19822

This theorem is referenced by:  elrspunidl  33611