Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  gsumpart Structured version   Visualization version   GIF version

Theorem gsumpart 30988
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.
StepHypRef 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 2736 . . . 4 𝑥𝑋 ({𝑥} × 𝐶) = 𝑥𝑋 ({𝑥} × 𝐶)
8 gsumpart.x . . . 4 (𝜑𝑋𝑊)
9 gsumpart.1 . . . 4 (𝜑Disj 𝑥𝑋 𝐶)
10 gsumpart.2 . . . 4 (𝜑 𝑥𝑋 𝐶 = 𝐴)
117, 4, 8, 9, 102ndresdjuf1o 30660 . . 3 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)–1-1-onto𝐴)
121, 2, 3, 4, 5, 6, 11gsumf1o 19255 . 2 (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))))
13 snex 5309 . . . . . . 7 {𝑥} ∈ V
1413a1i 11 . . . . . 6 ((𝜑𝑥𝑋) → {𝑥} ∈ V)
154adantr 484 . . . . . . 7 ((𝜑𝑥𝑋) → 𝐴𝑉)
16 ssidd 3910 . . . . . . . . . 10 (𝜑𝐴𝐴)
1710, 16eqsstrd 3925 . . . . . . . . 9 (𝜑 𝑥𝑋 𝐶𝐴)
18 iunss 4940 . . . . . . . . 9 ( 𝑥𝑋 𝐶𝐴 ↔ ∀𝑥𝑋 𝐶𝐴)
1917, 18sylib 221 . . . . . . . 8 (𝜑 → ∀𝑥𝑋 𝐶𝐴)
2019r19.21bi 3120 . . . . . . 7 ((𝜑𝑥𝑋) → 𝐶𝐴)
2115, 20ssexd 5202 . . . . . 6 ((𝜑𝑥𝑋) → 𝐶 ∈ V)
2214, 21xpexd 7514 . . . . 5 ((𝜑𝑥𝑋) → ({𝑥} × 𝐶) ∈ V)
2322ralrimiva 3095 . . . 4 (𝜑 → ∀𝑥𝑋 ({𝑥} × 𝐶) ∈ V)
24 iunexg 7714 . . . 4 ((𝑋𝑊 ∧ ∀𝑥𝑋 ({𝑥} × 𝐶) ∈ V) → 𝑥𝑋 ({𝑥} × 𝐶) ∈ V)
258, 23, 24syl2anc 587 . . 3 (𝜑 𝑥𝑋 ({𝑥} × 𝐶) ∈ V)
26 relxp 5554 . . . . . 6 Rel ({𝑥} × 𝐶)
2726a1i 11 . . . . 5 ((𝜑𝑥𝑋) → Rel ({𝑥} × 𝐶))
2827ralrimiva 3095 . . . 4 (𝜑 → ∀𝑥𝑋 Rel ({𝑥} × 𝐶))
29 reliun 5671 . . . 4 (Rel 𝑥𝑋 ({𝑥} × 𝐶) ↔ ∀𝑥𝑋 Rel ({𝑥} × 𝐶))
3028, 29sylibr 237 . . 3 (𝜑 → Rel 𝑥𝑋 ({𝑥} × 𝐶))
31 dmiun 5767 . . . . . 6 dom 𝑥𝑋 ({𝑥} × 𝐶) = 𝑥𝑋 dom ({𝑥} × 𝐶)
32 dmxpss 6014 . . . . . . . 8 dom ({𝑥} × 𝐶) ⊆ {𝑥}
3332rgenw 3063 . . . . . . 7 𝑥𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥}
34 ss2iun 4908 . . . . . . 7 (∀𝑥𝑋 dom ({𝑥} × 𝐶) ⊆ {𝑥} → 𝑥𝑋 dom ({𝑥} × 𝐶) ⊆ 𝑥𝑋 {𝑥})
3533, 34ax-mp 5 . . . . . 6 𝑥𝑋 dom ({𝑥} × 𝐶) ⊆ 𝑥𝑋 {𝑥}
3631, 35eqsstri 3921 . . . . 5 dom 𝑥𝑋 ({𝑥} × 𝐶) ⊆ 𝑥𝑋 {𝑥}
37 iunid 4955 . . . . 5 𝑥𝑋 {𝑥} = 𝑋
3836, 37sseqtri 3923 . . . 4 dom 𝑥𝑋 ({𝑥} × 𝐶) ⊆ 𝑋
3938a1i 11 . . 3 (𝜑 → dom 𝑥𝑋 ({𝑥} × 𝐶) ⊆ 𝑋)
40 fo2nd 7760 . . . . . . . 8 2nd :V–onto→V
41 fof 6611 . . . . . . . 8 (2nd :V–onto→V → 2nd :V⟶V)
4240, 41ax-mp 5 . . . . . . 7 2nd :V⟶V
43 ssv 3911 . . . . . . 7 𝑥𝑋 ({𝑥} × 𝐶) ⊆ V
44 fssres 6563 . . . . . . 7 ((2nd :V⟶V ∧ 𝑥𝑋 ({𝑥} × 𝐶) ⊆ V) → (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶V)
4542, 43, 44mp2an 692 . . . . . 6 (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶V
46 ffn 6523 . . . . . 6 ((2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶V → (2nd 𝑥𝑋 ({𝑥} × 𝐶)) Fn 𝑥𝑋 ({𝑥} × 𝐶))
4745, 46mp1i 13 . . . . 5 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)) Fn 𝑥𝑋 ({𝑥} × 𝐶))
48 djussxp2 30658 . . . . . . . 8 𝑥𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝑥𝑋 𝐶)
49 imass2 5950 . . . . . . . 8 ( 𝑥𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝑥𝑋 𝐶) → (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × 𝑥𝑋 𝐶)))
5048, 49ax-mp 5 . . . . . . 7 (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ (2nd “ (𝑋 × 𝑥𝑋 𝐶))
51 ima0 5930 . . . . . . . . . . 11 (2nd “ ∅) = ∅
52 xpeq1 5550 . . . . . . . . . . . . 13 (𝑋 = ∅ → (𝑋 × 𝑥𝑋 𝐶) = (∅ × 𝑥𝑋 𝐶))
53 0xp 5631 . . . . . . . . . . . . 13 (∅ × 𝑥𝑋 𝐶) = ∅
5452, 53eqtrdi 2787 . . . . . . . . . . . 12 (𝑋 = ∅ → (𝑋 × 𝑥𝑋 𝐶) = ∅)
5554imaeq2d 5914 . . . . . . . . . . 11 (𝑋 = ∅ → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = (2nd “ ∅))
56 iuneq1 4906 . . . . . . . . . . . 12 (𝑋 = ∅ → 𝑥𝑋 𝐶 = 𝑥 ∈ ∅ 𝐶)
57 0iun 4957 . . . . . . . . . . . 12 𝑥 ∈ ∅ 𝐶 = ∅
5856, 57eqtrdi 2787 . . . . . . . . . . 11 (𝑋 = ∅ → 𝑥𝑋 𝐶 = ∅)
5951, 55, 583eqtr4a 2797 . . . . . . . . . 10 (𝑋 = ∅ → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝑥𝑋 𝐶)
6059adantl 485 . . . . . . . . 9 ((𝜑𝑋 = ∅) → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝑥𝑋 𝐶)
61 2ndimaxp 30657 . . . . . . . . . 10 (𝑋 ≠ ∅ → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝑥𝑋 𝐶)
6261adantl 485 . . . . . . . . 9 ((𝜑𝑋 ≠ ∅) → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝑥𝑋 𝐶)
6360, 62pm2.61dane 3019 . . . . . . . 8 (𝜑 → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝑥𝑋 𝐶)
6463, 10eqtrd 2771 . . . . . . 7 (𝜑 → (2nd “ (𝑋 × 𝑥𝑋 𝐶)) = 𝐴)
6550, 64sseqtrid 3939 . . . . . 6 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴)
66 resssxp 6113 . . . . . 6 ((2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ 𝐴 ↔ (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ ( 𝑥𝑋 ({𝑥} × 𝐶) × 𝐴))
6765, 66sylib 221 . . . . 5 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ ( 𝑥𝑋 ({𝑥} × 𝐶) × 𝐴))
68 dff2 6896 . . . . 5 ((2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶𝐴 ↔ ((2nd 𝑥𝑋 ({𝑥} × 𝐶)) Fn 𝑥𝑋 ({𝑥} × 𝐶) ∧ (2nd 𝑥𝑋 ({𝑥} × 𝐶)) ⊆ ( 𝑥𝑋 ({𝑥} × 𝐶) × 𝐴)))
6947, 67, 68sylanbrc 586 . . . 4 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶𝐴)
705, 69fcod 6549 . . 3 (𝜑 → (𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶))): 𝑥𝑋 ({𝑥} × 𝐶)⟶𝐵)
717, 4, 8, 9, 102ndresdju 30659 . . . 4 (𝜑 → (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)–1-1𝐴)
722fvexi 6709 . . . . 5 0 ∈ V
7372a1i 11 . . . 4 (𝜑0 ∈ V)
745, 4fexd 7021 . . . 4 (𝜑𝐹 ∈ V)
756, 71, 73, 74fsuppco 8996 . . 3 (𝜑 → (𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶))) finSupp 0 )
761, 2, 3, 25, 30, 8, 39, 70, 75gsum2d 19311 . 2 (𝜑 → (𝐺 Σg (𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))) = (𝐺 Σg (𝑦𝑋 ↦ (𝐺 Σg (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧))))))
77 nfcsb1v 3823 . . . . . . . . 9 𝑥𝑦 / 𝑥𝐶
78 csbeq1a 3812 . . . . . . . . 9 (𝑥 = 𝑦𝐶 = 𝑦 / 𝑥𝐶)
798, 21, 77, 78iunsnima2 30632 . . . . . . . 8 ((𝜑𝑦𝑋) → ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) = 𝑦 / 𝑥𝐶)
80 df-ov 7194 . . . . . . . . 9 (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧) = ((𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩)
8169ad2antrr 726 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (2nd 𝑥𝑋 ({𝑥} × 𝐶)): 𝑥𝑋 ({𝑥} × 𝐶)⟶𝐴)
82 simplr 769 . . . . . . . . . . . . 13 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦𝑋)
83 vsnid 4564 . . . . . . . . . . . . . . 15 𝑦 ∈ {𝑦}
8483a1i 11 . . . . . . . . . . . . . 14 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑦 ∈ {𝑦})
8579eleq2d 2816 . . . . . . . . . . . . . . 15 ((𝜑𝑦𝑋) → (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↔ 𝑧𝑦 / 𝑥𝐶))
8685biimpa 480 . . . . . . . . . . . . . 14 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → 𝑧𝑦 / 𝑥𝐶)
8784, 86opelxpd 5574 . . . . . . . . . . . . 13 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × 𝑦 / 𝑥𝐶))
88 nfcv 2897 . . . . . . . . . . . . . . . 16 𝑥{𝑦}
8988, 77nfxp 5569 . . . . . . . . . . . . . . 15 𝑥({𝑦} × 𝑦 / 𝑥𝐶)
9089nfel2 2915 . . . . . . . . . . . . . 14 𝑥𝑦, 𝑧⟩ ∈ ({𝑦} × 𝑦 / 𝑥𝐶)
91 sneq 4537 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑦 → {𝑥} = {𝑦})
9291, 78xpeq12d 5567 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦 → ({𝑥} × 𝐶) = ({𝑦} × 𝑦 / 𝑥𝐶))
9392eleq2d 2816 . . . . . . . . . . . . . 14 (𝑥 = 𝑦 → (⟨𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶) ↔ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × 𝑦 / 𝑥𝐶)))
9490, 93rspce 3516 . . . . . . . . . . . . 13 ((𝑦𝑋 ∧ ⟨𝑦, 𝑧⟩ ∈ ({𝑦} × 𝑦 / 𝑥𝐶)) → ∃𝑥𝑋𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
9582, 87, 94syl2anc 587 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ∃𝑥𝑋𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
96 eliun 4894 . . . . . . . . . . . 12 (⟨𝑦, 𝑧⟩ ∈ 𝑥𝑋 ({𝑥} × 𝐶) ↔ ∃𝑥𝑋𝑦, 𝑧⟩ ∈ ({𝑥} × 𝐶))
9795, 96sylibr 237 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ⟨𝑦, 𝑧⟩ ∈ 𝑥𝑋 ({𝑥} × 𝐶))
9881, 97fvco3d 6789 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹‘((2nd 𝑥𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)))
9997fvresd 6715 . . . . . . . . . . . 12 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd 𝑥𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = (2nd ‘⟨𝑦, 𝑧⟩))
100 vex 3402 . . . . . . . . . . . . 13 𝑦 ∈ V
101 vex 3402 . . . . . . . . . . . . 13 𝑧 ∈ V
102100, 101op2nd 7748 . . . . . . . . . . . 12 (2nd ‘⟨𝑦, 𝑧⟩) = 𝑧
10399, 102eqtrdi 2787 . . . . . . . . . . 11 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((2nd 𝑥𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩) = 𝑧)
104103fveq2d 6699 . . . . . . . . . 10 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝐹‘((2nd 𝑥𝑋 ({𝑥} × 𝐶))‘⟨𝑦, 𝑧⟩)) = (𝐹𝑧))
10598, 104eqtrd 2771 . . . . . . . . 9 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → ((𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))‘⟨𝑦, 𝑧⟩) = (𝐹𝑧))
10680, 105syl5eq 2783 . . . . . . . 8 (((𝜑𝑦𝑋) ∧ 𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦})) → (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧) = (𝐹𝑧))
10779, 106mpteq12dva 5124 . . . . . . 7 ((𝜑𝑦𝑋) → (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝑧𝑦 / 𝑥𝐶 ↦ (𝐹𝑧)))
1085adantr 484 . . . . . . . 8 ((𝜑𝑦𝑋) → 𝐹:𝐴𝐵)
109 imassrn 5925 . . . . . . . . . 10 ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ ran 𝑥𝑋 ({𝑥} × 𝐶)
11010xpeq2d 5566 . . . . . . . . . . . . . 14 (𝜑 → (𝑋 × 𝑥𝑋 𝐶) = (𝑋 × 𝐴))
11148, 110sseqtrid 3939 . . . . . . . . . . . . 13 (𝜑 𝑥𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴))
112 rnss 5793 . . . . . . . . . . . . 13 ( 𝑥𝑋 ({𝑥} × 𝐶) ⊆ (𝑋 × 𝐴) → ran 𝑥𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
113111, 112syl 17 . . . . . . . . . . . 12 (𝜑 → ran 𝑥𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
114113adantr 484 . . . . . . . . . . 11 ((𝜑𝑦𝑋) → ran 𝑥𝑋 ({𝑥} × 𝐶) ⊆ ran (𝑋 × 𝐴))
115 rnxpss 6015 . . . . . . . . . . 11 ran (𝑋 × 𝐴) ⊆ 𝐴
116114, 115sstrdi 3899 . . . . . . . . . 10 ((𝜑𝑦𝑋) → ran 𝑥𝑋 ({𝑥} × 𝐶) ⊆ 𝐴)
117109, 116sstrid 3898 . . . . . . . . 9 ((𝜑𝑦𝑋) → ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ⊆ 𝐴)
11879, 117eqsstrrd 3926 . . . . . . . 8 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐶𝐴)
119108, 118feqresmpt 6759 . . . . . . 7 ((𝜑𝑦𝑋) → (𝐹𝑦 / 𝑥𝐶) = (𝑧𝑦 / 𝑥𝐶 ↦ (𝐹𝑧)))
120107, 119eqtr4d 2774 . . . . . 6 ((𝜑𝑦𝑋) → (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧)) = (𝐹𝑦 / 𝑥𝐶))
121120oveq2d 7207 . . . . 5 ((𝜑𝑦𝑋) → (𝐺 Σg (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧))) = (𝐺 Σg (𝐹𝑦 / 𝑥𝐶)))
122121mpteq2dva 5135 . . . 4 (𝜑 → (𝑦𝑋 ↦ (𝐺 Σg (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑦𝑋 ↦ (𝐺 Σg (𝐹𝑦 / 𝑥𝐶))))
123 nfcv 2897 . . . . 5 𝑦(𝐺 Σg (𝐹𝐶))
124 nfcv 2897 . . . . . 6 𝑥𝐺
125 nfcv 2897 . . . . . 6 𝑥 Σg
126 nfcv 2897 . . . . . . 7 𝑥𝐹
127126, 77nfres 5838 . . . . . 6 𝑥(𝐹𝑦 / 𝑥𝐶)
128124, 125, 127nfov 7221 . . . . 5 𝑥(𝐺 Σg (𝐹𝑦 / 𝑥𝐶))
12978reseq2d 5836 . . . . . 6 (𝑥 = 𝑦 → (𝐹𝐶) = (𝐹𝑦 / 𝑥𝐶))
130129oveq2d 7207 . . . . 5 (𝑥 = 𝑦 → (𝐺 Σg (𝐹𝐶)) = (𝐺 Σg (𝐹𝑦 / 𝑥𝐶)))
131123, 128, 130cbvmpt 5141 . . . 4 (𝑥𝑋 ↦ (𝐺 Σg (𝐹𝐶))) = (𝑦𝑋 ↦ (𝐺 Σg (𝐹𝑦 / 𝑥𝐶)))
132122, 131eqtr4di 2789 . . 3 (𝜑 → (𝑦𝑋 ↦ (𝐺 Σg (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧)))) = (𝑥𝑋 ↦ (𝐺 Σg (𝐹𝐶))))
133132oveq2d 7207 . 2 (𝜑 → (𝐺 Σg (𝑦𝑋 ↦ (𝐺 Σg (𝑧 ∈ ( 𝑥𝑋 ({𝑥} × 𝐶) “ {𝑦}) ↦ (𝑦(𝐹 ∘ (2nd 𝑥𝑋 ({𝑥} × 𝐶)))𝑧))))) = (𝐺 Σg (𝑥𝑋 ↦ (𝐺 Σg (𝐹𝐶)))))
13412, 76, 1333eqtrd 2775 1 (𝜑 → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥𝑋 ↦ (𝐺 Σg (𝐹𝐶)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1543  wcel 2112  wne 2932  wral 3051  wrex 3052  Vcvv 3398  csb 3798  wss 3853  c0 4223  {csn 4527  cop 4533   ciun 4890  Disj wdisj 5004   class class class wbr 5039  cmpt 5120   × cxp 5534  dom cdm 5536  ran crn 5537  cres 5538  cima 5539  ccom 5540  Rel wrel 5541   Fn wfn 6353  wf 6354  ontowfo 6356  cfv 6358  (class class class)co 7191  2nd c2nd 7738   finSupp cfsupp 8963  Basecbs 16666  0gc0g 16898   Σg cgsu 16899  CMndccmn 19124
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501  ax-cnex 10750  ax-resscn 10751  ax-1cn 10752  ax-icn 10753  ax-addcl 10754  ax-addrcl 10755  ax-mulcl 10756  ax-mulrcl 10757  ax-mulcom 10758  ax-addass 10759  ax-mulass 10760  ax-distr 10761  ax-i2m1 10762  ax-1ne0 10763  ax-1rid 10764  ax-rnegex 10765  ax-rrecex 10766  ax-cnre 10767  ax-pre-lttri 10768  ax-pre-lttrn 10769  ax-pre-ltadd 10770  ax-pre-mulgt0 10771
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-nel 3037  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-tp 4532  df-op 4534  df-uni 4806  df-int 4846  df-iun 4892  df-iin 4893  df-disj 5005  df-br 5040  df-opab 5102  df-mpt 5121  df-tr 5147  df-id 5440  df-eprel 5445  df-po 5453  df-so 5454  df-fr 5494  df-se 5495  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6140  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-isom 6367  df-riota 7148  df-ov 7194  df-oprab 7195  df-mpo 7196  df-of 7447  df-om 7623  df-1st 7739  df-2nd 7740  df-supp 7882  df-wrecs 8025  df-recs 8086  df-rdg 8124  df-1o 8180  df-er 8369  df-en 8605  df-dom 8606  df-sdom 8607  df-fin 8608  df-fsupp 8964  df-oi 9104  df-card 9520  df-pnf 10834  df-mnf 10835  df-xr 10836  df-ltxr 10837  df-le 10838  df-sub 11029  df-neg 11030  df-nn 11796  df-2 11858  df-n0 12056  df-z 12142  df-uz 12404  df-fz 13061  df-fzo 13204  df-seq 13540  df-hash 13862  df-ndx 16669  df-slot 16670  df-base 16672  df-sets 16673  df-ress 16674  df-plusg 16762  df-0g 16900  df-gsum 16901  df-mre 17043  df-mrc 17044  df-acs 17046  df-mgm 18068  df-sgrp 18117  df-mnd 18128  df-submnd 18173  df-mulg 18443  df-cntz 18665  df-cmn 19126
This theorem is referenced by:  elrspunidl  31274
  Copyright terms: Public domain W3C validator