MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gsum2d2lem Structured version   Visualization version   GIF version

Theorem gsum2d2lem 20220
Description: Lemma for gsum2d2 20221: show the function is finitely supported. (Contributed by Mario Carneiro, 28-Dec-2014.) (Revised by AV, 9-Jun-2019.)
Hypotheses
Ref Expression
gsum2d2.b 𝐵 = (Base‘𝐺)
gsum2d2.z 0 = (0g‘𝐺)
gsum2d2.g (𝜑 → 𝐺 ∈ CMnd)
gsum2d2.a (𝜑 → 𝐴 ∈ 𝑉)
gsum2d2.r ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑊)
gsum2d2.f ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵)
gsum2d2.u (𝜑 → 𝑈 ∈ Fin)
gsum2d2.n ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) → 𝑋 = 0 )
Assertion
Ref Expression
gsum2d2lem (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 )
Distinct variable groups:   𝑗,𝑘,𝐵   𝜑,𝑗,𝑘   𝐴,𝑗,𝑘   𝑗,𝐺,𝑘   𝑈,𝑗,𝑘   𝐶,𝑘   𝑗,𝑉   0 ,𝑗,𝑘
Allowed substitution hints:   𝐶(𝑗)   𝑉(𝑘)   𝑊(𝑗, 𝑘)   𝑋(𝑗, 𝑘)

Proof of Theorem gsum2d2lem
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) = (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
21mpofun 7570 . . 3 Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
32a1i 11 . 2 (𝜑 → Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋))
4 gsum2d2.u . . 3 (𝜑 → 𝑈 ∈ Fin)
5 gsum2d2.f . . . . . 6 ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵)
65ralrimivva 3209 . . . . 5 (𝜑 → ∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵)
71fmpox 8106 . . . . 5 (∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵 ↔ (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
86, 7sylib 221 . . . 4 (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
9 nfv 1949 . . . . . 6 Ⅎ𝑗𝜑
10 nfiu1 4989 . . . . . . . 8 Ⅎ𝑗∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
11 nfcv 2926 . . . . . . . 8 Ⅎ𝑗𝑈
1210, 11nfdif 4069 . . . . . . 7 Ⅎ𝑗(∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
1312nfcri 2918 . . . . . 6 Ⅎ𝑗 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
149, 13nfan 1934 . . . . 5 Ⅎ𝑗(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
15 nfmpo1 7526 . . . . . . 7 Ⅎ𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
16 nfcv 2926 . . . . . . 7 Ⅎ𝑗𝑧
1715, 16nffv 6921 . . . . . 6 Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
1817nfeq1 2941 . . . . 5 Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
19 relxp 5674 . . . . . . . 8 Rel ({𝑗} × 𝐶)
2019rgenw 3084 . . . . . . 7 ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶)
21 reliun 5800 . . . . . . 7 (Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶))
2220, 21mpbir 234 . . . . . 6 Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
23 eldifi 4070 . . . . . . 7 (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
2423adantl 487 . . . . . 6 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
25 elrel 5780 . . . . . 6 ((Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∧ 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
2622, 24, 25sylancr 599 . . . . 5 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
27 nfv 1949 . . . . . 6 Ⅎ𝑘(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
28 nfmpo2 7527 . . . . . . . 8 Ⅎ𝑘(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
29 nfcv 2926 . . . . . . . 8 Ⅎ𝑘𝑧
3028, 29nffv 6921 . . . . . . 7 Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
3130nfeq1 2941 . . . . . 6 Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
32 simprr 785 . . . . . . . . 9 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 = ⟨𝑗, 𝑘⟩)
3332fveq2d 6915 . . . . . . . 8 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩))
34 df-ov 7449 . . . . . . . . 9 (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩)
35 simprl 783 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
3632, 35eqeltrrd 2865 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
3736eldifad 4054 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
38 opeliunxp 5723 . . . . . . . . . . . 12 (⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
3937, 38sylib 221 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
4039simpld 500 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑗 ∈ 𝐴)
4139simprd 501 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑘 ∈ 𝐶)
4239, 5syldan 603 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑋 ∈ 𝐵)
431ovmpt4g 7594 . . . . . . . . . 10 ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
4440, 41, 42, 43syl3anc 1399 . . . . . . . . 9 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
4534, 44eqtr3id 2812 . . . . . . . 8 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩) = 𝑋)
46 eldifn 4071 . . . . . . . . . . . 12 (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → ¬ 𝑧 ∈ 𝑈)
4746ad2antrl 741 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ¬ 𝑧 ∈ 𝑈)
4832eleq1d 2849 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑧 ∈ 𝑈 ↔ ⟨𝑗, 𝑘⟩ ∈ 𝑈))
49 df-br 5107 . . . . . . . . . . . 12 (𝑗𝑈𝑘 ↔ ⟨𝑗, 𝑘⟩ ∈ 𝑈)
5048, 49bitr4di 292 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑧 ∈ 𝑈 ↔ 𝑗𝑈𝑘))
5147, 50mtbid 327 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ¬ 𝑗𝑈𝑘)
5239, 51jca 521 . . . . . . . . 9 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘))
53 gsum2d2.n . . . . . . . . 9 ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) → 𝑋 = 0 )
5452, 53syldan 603 . . . . . . . 8 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑋 = 0 )
5533, 45, 543eqtrd 2802 . . . . . . 7 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
5655expr 462 . . . . . 6 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
5727, 31, 56exlimd 2258 . . . . 5 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
5814, 18, 26, 57exlimimdd 2259 . . . 4 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
598, 58suppss 8242 . . 3 (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ⊆ 𝑈)
604, 59ssfid 9291 . 2 (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)
61 gsum2d2.a . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
62 gsum2d2.r . . . . 5 ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑊)
6362ralrimiva 3158 . . . 4 (𝜑 → ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊)
641mpoexxg 8116 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊) → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
6561, 63, 64syl2anc 596 . . 3 (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
66 gsum2d2.z . . . . 5 0 = (0g‘𝐺)
6766fvexi 6925 . . . 4 0 ∈ V
6867a1i 11 . . 3 (𝜑 → 0 ∈ V)
69 isfsupp 9388 . . 3 (((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V ∧ 0 ∈ V) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 ↔ (Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∧ ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)))
7065, 68, 69syl2anc 596 . 2 (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 ↔ (Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∧ ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)))
713, 60, 70mpbir2and 726 1 (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ∖ cdif 4048  {csn 4588  ⟨cop 4838  ∪ ciun 4954   class class class wbr 5106   × cxp 5654  Rel wrel 5661  Fun wfun 6555  ⟶wf 6557  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448   supp csupp 8207  Fincfn 9004   finSupp cfsupp 9384  Basecbs 17419  0gc0g 17642  CMndccmn 20027
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-supp 8208  df-1o 8507  df-en 9005  df-fin 9008  df-fsupp 9385
This theorem is used by:  gsum2d2  20221  gsumcom2  20222
  Copyright terms: Public domain W3C validator