Theorem gsumpart 32814

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 2725	. . . 4 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
8		gsumpart.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑊)
9		gsumpart.1	. . . 4 ⊢ (𝜑 → Disj 𝑥 ∈ 𝑋 𝐶)
10		gsumpart.2	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 = 𝐴)
11	7, 4, 8, 9, 10	2ndresdjuf1o 32481	. . 3 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1-onto→𝐴)
12	1, 2, 3, 4, 5, 6, 11	gsumf1o 19875	. 2 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))))
13		vsnex 5425	. . . . . . 7 ⊢ {𝑥} ∈ V
14	13	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → {𝑥} ∈ V)
15	4	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑉)
16		ssidd 3996	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 𝐴)
17	10, 16	eqsstrd 4011	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
18		iunss 5043	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
19	17, 18	sylib 217	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝐶 ⊆ 𝐴)
20	19	r19.21bi 3239	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ⊆ 𝐴)
21	15, 20	ssexd 5319	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐶 ∈ V)
22	14, 21	xpexd 7751	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ({𝑥} × 𝐶) ∈ V)
23	22	ralrimiva 3136	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
24		iunexg 7965	. . . 4 ⊢ ((𝑋 ∈ 𝑊 ∧ ∀𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V) → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
25	8, 23, 24	syl2anc 582	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∈ V)
26		relxp 5690	. . . . . 6 ⊢ Rel ({𝑥} × 𝐶)
27	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → Rel ({𝑥} × 𝐶))
28	27	ralrimiva 3136	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
29		reliun 5812	. . . 4 ⊢ (Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∀𝑥 ∈ 𝑋 Rel ({𝑥} × 𝐶))
30	28, 29	sylibr 233	. . 3 ⊢ (𝜑 → Rel ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
31		dmiun 5910	. . . . . 6 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) = ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶)
32		dmxpss 6170	. . . . . . . 8 ⊢ dom ({𝑥} × 𝐶) ⊆ {𝑥}
33	32	rgenw 3055	. . . . . . 7 ⊢ ∀𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥}
34		ss2iun 5009	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥} → ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥})
35	33, 34	ax-mp 5	. . . . . 6 ⊢ ∪ 𝑥 ∈ 𝑋 dom ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥}
36	31, 35	eqsstri 4007	. . . . 5 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ∪ 𝑥 ∈ 𝑋 {𝑥}
37		iunid 5058	. . . . 5 ⊢ ∪ 𝑥 ∈ 𝑋 {𝑥} = 𝑋
38	36, 37	sseqtri 4009	. . . 4 ⊢ dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝑋
39	38	a1i 11	. . 3 ⊢ (𝜑 → dom ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝑋)
40		fo2nd 8012	. . . . . . . 8 ⊢ 2nd :V–onto→V
41		fof 6806	. . . . . . . 8 ⊢ (2nd :V–onto→V → 2nd :V⟶V)
42	40, 41	ax-mp 5	. . . . . . 7 ⊢ 2nd :V⟶V
43		ssv 3997	. . . . . . 7 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ V
44		fssres 6758	. . . . . . 7 ⊢ ((2nd :V⟶V ∧ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ V) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V)
45	42, 43, 44	mp2an 690	. . . . . 6 ⊢ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V
46		ffn 6717	. . . . . 6 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶V → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
47	45, 46	mp1i 13	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
48		djussxp2 32479	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)
49		imass2 6101	. . . . . . . 8 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)))
50	48, 49	ax-mp 5	. . . . . . 7 ⊢ (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶))
51		ima0 6075	. . . . . . . . . . 11 ⊢ (2nd “ ∅) = ∅
52		xpeq1 5686	. . . . . . . . . . . . 13 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (∅ × ∪ 𝑥 ∈ 𝑋 𝐶))
53		0xp 5770	. . . . . . . . . . . . 13 ⊢ (∅ × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅
54	52, 53	eqtrdi 2781	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = ∅)
55	54	imaeq2d 6058	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = (2nd “ ∅))
56		iuneq1 5007	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∪ 𝑥 ∈ ∅ 𝐶)
57		0iun 5061	. . . . . . . . . . . 12 ⊢ ∪ 𝑥 ∈ ∅ 𝐶 = ∅
58	56, 57	eqtrdi 2781	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → ∪ 𝑥 ∈ 𝑋 𝐶 = ∅)
59	51, 55, 58	3eqtr4a 2791	. . . . . . . . . 10 ⊢ (𝑋 = ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
60	59	adantl 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 = ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
61		2ndimaxp 32478	. . . . . . . . . 10 ⊢ (𝑋 ≠ ∅ → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
62	61	adantl 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑋 ≠ ∅) → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
63	60, 62	pm2.61dane 3019	. . . . . . . 8 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = ∪ 𝑥 ∈ 𝑋 𝐶)
64	63, 10	eqtrd 2765	. . . . . . 7 ⊢ (𝜑 → (2nd “ (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶)) = 𝐴)
65	50, 64	sseqtrid 4025	. . . . . 6 ⊢ (𝜑 → (2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴)
66		resssxp 6269	. . . . . 6 ⊢ ((2nd “ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴 ↔ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
67	65, 66	sylib 217	. . . . 5 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴))
68		dff2 7104	. . . . 5 ⊢ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴 ↔ ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) Fn ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ∧ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)) ⊆ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) × 𝐴)))
69	47, 67, 68	sylanbrc 581	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
70	5, 69	fcod 6744	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐵)
71	7, 4, 8, 9, 10	2ndresdju 32480	. . . 4 ⊢ (𝜑 → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)–1-1→𝐴)
72	2	fvexi 6906	. . . . 5 ⊢ 0 ∈ V
73	72	a1i 11	. . . 4 ⊢ (𝜑 → 0 ∈ V)
74	5, 4	fexd 7235	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
75	6, 71, 73, 74	fsuppco 9425	. . 3 ⊢ (𝜑 → (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))) finSupp 0 )
76	1, 2, 3, 25, 30, 8, 39, 70, 75	gsum2d 19931	. 2 ⊢ (𝜑 → (𝐺 Σg (𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))) = (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))))
77		nfcsb1v 3909	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐶
78		csbeq1a 3898	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → 𝐶 = ⦋𝑦 / 𝑥⦌𝐶)
79	8, 21, 77, 78	iunsnima2 32454	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) = ⦋𝑦 / 𝑥⦌𝐶)
80		df-ov 7419	. . . . . . . . 9 ⊢ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩)
81	69	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)):∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)⟶𝐴)
82		simplr 767	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ 𝑋)
83		vsnid 4661	. . . . . . . . . . . . . . 15 ⊢ 𝑦 ∈ {𝑦}
84	83	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ {𝑦})
85	79	eleq2d 2811	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↔ 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶))
86	85	biimpa 475	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶)
87	84, 86	opelxpd 5711	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
88		nfcv 2892	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥{𝑦}
89	88, 77	nfxp 5705	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
90	89	nfel2 2911	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)
91		sneq 4634	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
92	91, 78	xpeq12d 5703	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ({𝑥} × 𝐶) = ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶))
93	92	eleq2d 2811	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶) ↔ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)))
94	90, 93	rspce 3590	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝑋 ∧ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × ⦋𝑦 / 𝑥⦌𝐶)) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
95	82, 87, 94	syl2anc 582	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
96		eliun 4995	. . . . . . . . . . . 12 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ↔ ∃𝑥 ∈ 𝑋 ⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
97	95, 96	sylibr 233	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))
98	81, 97	fvco3d 6993	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)))
99	97	fvresd 6912	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = (2nd ‘⟨𝑦, 𝑧⟩))
100		vex 3467	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
101		vex 3467	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
102	100, 101	op2nd 8000	. . . . . . . . . . . 12 ⊢ (2nd ‘⟨𝑦, 𝑧⟩) = 𝑧
103	99, 102	eqtrdi 2781	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = 𝑧)
104	103	fveq2d 6896	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝐹‘((2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)) = (𝐹‘𝑧))
105	98, 104	eqtrd 2765	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘𝑧))
106	80, 105	eqtrid 2777	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑋) ∧ 𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧) = (𝐹‘𝑧))
107	79, 106	mpteq12dva 5232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
108	5	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → 𝐹:𝐴⟶𝐵)
109		imassrn 6069	. . . . . . . . . 10 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)
110	10	xpeq2d 5702	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 × ∪ 𝑥 ∈ 𝑋 𝐶) = (𝑋 × 𝐴))
111	48, 110	sseqtrid 4025	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴))
112		rnss 5935	. . . . . . . . . . . . 13 ⊢ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
113	111, 112	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
114	113	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
115		rnxpss 6171	. . . . . . . . . . 11 ⊢ ran (𝑋 × 𝐴) ⊆ 𝐴
116	114, 115	sstrdi 3985	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ran ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) ⊆ 𝐴)
117	109, 116	sstrid 3984	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ 𝐴)
118	79, 117	eqsstrrd 4012	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐶 ⊆ 𝐴)
119	108, 118	feqresmpt 6963	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶) = (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↦ (𝐹‘𝑧)))
120	107, 119	eqtr4d 2768	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
121	120	oveq2d 7432	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋) → (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
122	121	mpteq2dva 5243	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))))
123		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑦(𝐺 Σg (𝐹 ↾ 𝐶))
124		nfcv 2892	. . . . . 6 ⊢ Ⅎ𝑥𝐺
125		nfcv 2892	. . . . . 6 ⊢ Ⅎ𝑥 Σg
126		nfcv 2892	. . . . . . 7 ⊢ Ⅎ𝑥𝐹
127	126, 77	nfres 5981	. . . . . 6 ⊢ Ⅎ𝑥(𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)
128	124, 125, 127	nfov 7446	. . . . 5 ⊢ Ⅎ𝑥(𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
129	78	reseq2d 5979	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ 𝐶) = (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶))
130	129	oveq2d 7432	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐺 Σg (𝐹 ↾ 𝐶)) = (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
131	123, 128, 130	cbvmpt 5254	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))) = (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ ⦋𝑦 / 𝑥⦌𝐶)))
132	122, 131	eqtr4di 2783	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶))))
133	132	oveq2d 7432	. 2 ⊢ (𝜑 → (𝐺 Σg (𝑦 ∈ 𝑋 ↦ (𝐺 Σg (𝑧 ∈ (∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd ↾ ∪ 𝑥 ∈ 𝑋 ({𝑥} × 𝐶)))𝑧))))) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))
134	12, 76, 133	3eqtrd 2769	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝑋 ↦ (𝐺 Σg (𝐹 ↾ 𝐶)))))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098   ≠ wne 2930  ∀wral 3051  ∃wrex 3060  Vcvv 3463  ⦋csb 3884   ⊆ wss 3939  ∅c0 4318  {csn 4624  ⟨cop 4630  ∪ ciun 4991  Disj wdisj 5108   class class class wbr 5143   ↦ cmpt 5226   × cxp 5670  dom cdm 5672  ran crn 5673   ↾ cres 5674   “ cima 5675   ∘ ccom 5676  Rel wrel 5677   Fn wfn 6538  ⟶wf 6539  –onto→wfo 6541  ‘cfv 6543  (class class class)co 7416  2^nd c2nd 7990   finSupp cfsupp 9385  Basecbs 17179  0_gc0g 17420   Σ_g cgsu 17421  CMndccmn 19739

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7738  ax-cnex 11194  ax-resscn 11195  ax-1cn 11196  ax-icn 11197  ax-addcl 11198  ax-addrcl 11199  ax-mulcl 11200  ax-mulrcl 11201  ax-mulcom 11202  ax-addass 11203  ax-mulass 11204  ax-distr 11205  ax-i2m1 11206  ax-1ne0 11207  ax-1rid 11208  ax-rnegex 11209  ax-rrecex 11210  ax-cnre 11211  ax-pre-lttri 11212  ax-pre-lttrn 11213  ax-pre-ltadd 11214  ax-pre-mulgt0 11215

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3364  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3769  df-csb 3885  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-pss 3959  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-int 4945  df-iun 4993  df-iin 4994  df-disj 5109  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-se 5628  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7372  df-ov 7419  df-oprab 7420  df-mpo 7421  df-of 7682  df-om 7869  df-1st 7991  df-2nd 7992  df-supp 8164  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-er 8723  df-en 8963  df-dom 8964  df-sdom 8965  df-fin 8966  df-fsupp 9386  df-oi 9533  df-card 9962  df-pnf 11280  df-mnf 11281  df-xr 11282  df-ltxr 11283  df-le 11284  df-sub 11476  df-neg 11477  df-nn 12243  df-2 12305  df-n0 12503  df-z 12589  df-uz 12853  df-fz 13517  df-fzo 13660  df-seq 13999  df-hash 14322  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17180  df-ress 17209  df-plusg 17245  df-0g 17422  df-gsum 17423  df-mre 17565  df-mrc 17566  df-acs 17568  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-submnd 18740  df-mulg 19028  df-cntz 19272  df-cmn 19741

This theorem is referenced by:  elrspunidl  33193