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

Theorem gsum2d2lem 20167
Description: Lemma for gsum2d2 20168: 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 2761 . . . 4 (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) = (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
21mpofun 7536 . . 3 Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
32a1i 11 . 2 (𝜑 → Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋))
4 gsum2d2.u . . 3 (𝜑 → 𝑈 ∈ Fin)
5 gsum2d2.f . . . . . 6 ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵)
65ralrimivva 3206 . . . . 5 (𝜑 → ∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵)
71fmpox 8067 . . . . 5 (∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵 ↔ (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
86, 7sylib 221 . . . 4 (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
9 nfv 1947 . . . . . 6 Ⅎ𝑗𝜑
10 nfiu1 4986 . . . . . . . 8 Ⅎ𝑗∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
11 nfcv 2923 . . . . . . . 8 Ⅎ𝑗𝑈
1210, 11nfdif 4077 . . . . . . 7 Ⅎ𝑗(∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
1312nfcri 2915 . . . . . 6 Ⅎ𝑗 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
149, 13nfan 1932 . . . . 5 Ⅎ𝑗(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
15 nfmpo1 7492 . . . . . . 7 Ⅎ𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
16 nfcv 2923 . . . . . . 7 Ⅎ𝑗𝑧
1715, 16nffv 6887 . . . . . 6 Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
1817nfeq1 2938 . . . . 5 Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
19 relxp 5669 . . . . . . . 8 Rel ({𝑗} × 𝐶)
2019rgenw 3081 . . . . . . 7 ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶)
21 reliun 5794 . . . . . . 7 (Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶))
2220, 21mpbir 234 . . . . . 6 Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
23 eldifi 4078 . . . . . . 7 (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
2423adantl 487 . . . . . 6 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
25 elrel 5774 . . . . . 6 ((Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∧ 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
2622, 24, 25sylancr 599 . . . . 5 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
27 nfv 1947 . . . . . 6 Ⅎ𝑘(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
28 nfmpo2 7493 . . . . . . . 8 Ⅎ𝑘(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
29 nfcv 2923 . . . . . . . 8 Ⅎ𝑘𝑧
3028, 29nffv 6887 . . . . . . 7 Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
3130nfeq1 2938 . . . . . 6 Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
32 simprr 785 . . . . . . . . 9 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 = ⟨𝑗, 𝑘⟩)
3332fveq2d 6881 . . . . . . . 8 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩))
34 df-ov 7415 . . . . . . . . 9 (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩)
35 simprl 783 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
3632, 35eqeltrrd 2862 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
3736eldifad 3911 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
38 opeliunxp 5718 . . . . . . . . . . . 12 (⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
3937, 38sylib 221 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
4039simpld 500 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑗 ∈ 𝐴)
4139simprd 501 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑘 ∈ 𝐶)
4239, 5syldan 603 . . . . . . . . . 10 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑋 ∈ 𝐵)
431ovmpt4g 7559 . . . . . . . . . 10 ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
4440, 41, 42, 43syl3anc 1398 . . . . . . . . 9 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
4534, 44eqtr3id 2810 . . . . . . . 8 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩) = 𝑋)
46 eldifn 4079 . . . . . . . . . . . 12 (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → ¬ 𝑧 ∈ 𝑈)
4746ad2antrl 741 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ¬ 𝑧 ∈ 𝑈)
4832eleq1d 2846 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑧 ∈ 𝑈 ↔ ⟨𝑗, 𝑘⟩ ∈ 𝑈))
49 df-br 5104 . . . . . . . . . . . 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 2800 . . . . . . 7 ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
5655expr 462 . . . . . 6 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
5727, 31, 56exlimd 2255 . . . . 5 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
5814, 18, 26, 57exlimimdd 2256 . . . 4 ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
598, 58suppss 8195 . . 3 (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ⊆ 𝑈)
604, 59ssfid 9244 . 2 (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)
61 gsum2d2.a . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
62 gsum2d2.r . . . . 5 ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑊)
6362ralrimiva 3155 . . . 4 (𝜑 → ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊)
641mpoexxg 8077 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊) → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
6561, 63, 64syl2anc 596 . . 3 (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
66 gsum2d2.z . . . . 5 0 = (0g‘𝐺)
6766fvexi 6891 . . . 4 0 ∈ V
6867a1i 11 . . 3 (𝜑 → 0 ∈ V)
69 isfsupp 9341 . . 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 2145  ∀wral 3077  Vcvv 3451   ∖ cdif 3896  {csn 4584  ⟨cop 4590  ∪ ciun 4951   class class class wbr 5103   × cxp 5649  Rel wrel 5656  Fun wfun 6525  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414   supp csupp 8161  Fincfn 8957   finSupp cfsupp 9337  Basecbs 17367  0gc0g 17590  CMndccmn 19974
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-supp 8162  df-1o 8460  df-en 8958  df-fin 8961  df-fsupp 9338
This theorem is used by:  gsum2d2  20168  gsumcom2  20169
  Copyright terms: Public domain W3C validator