Theorem gsum2d2lem 20006

Description: Lemma for gsum2d2 20007: 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.

Step	Hyp	Ref	Expression
1		eqid 2735	. . . 4 ⊢ (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) = (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
2	1	mpofun 7557	. . 3 ⊢ Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
3	2	a1i 11	. 2 ⊢ (𝜑 → Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋))
4		gsum2d2.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ Fin)
5		gsum2d2.f	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶)) → 𝑋 ∈ 𝐵)
6	5	ralrimivva 3200	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵)
7	1	fmpox 8091	. . . . 5 ⊢ (∀𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐶 𝑋 ∈ 𝐵 ↔ (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
8	6, 7	sylib 218	. . . 4 ⊢ (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋):∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)⟶𝐵)
9		nfv 1912	. . . . . 6 ⊢ Ⅎ𝑗𝜑
10		nfiu1 5032	. . . . . . . 8 ⊢ Ⅎ𝑗∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
11		nfcv 2903	. . . . . . . 8 ⊢ Ⅎ𝑗𝑈
12	10, 11	nfdif 4139	. . . . . . 7 ⊢ Ⅎ𝑗(∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
13	12	nfcri 2895	. . . . . 6 ⊢ Ⅎ𝑗 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)
14	9, 13	nfan 1897	. . . . 5 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
15		nfmpo1 7513	. . . . . . 7 ⊢ Ⅎ𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
16		nfcv 2903	. . . . . . 7 ⊢ Ⅎ𝑗𝑧
17	15, 16	nffv 6917	. . . . . 6 ⊢ Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
18	17	nfeq1 2919	. . . . 5 ⊢ Ⅎ𝑗((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
19		relxp 5707	. . . . . . . 8 ⊢ Rel ({𝑗} × 𝐶)
20	19	rgenw 3063	. . . . . . 7 ⊢ ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶)
21		reliun 5829	. . . . . . 7 ⊢ (Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ ∀𝑗 ∈ 𝐴 Rel ({𝑗} × 𝐶))
22	20, 21	mpbir 231	. . . . . 6 ⊢ Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)
23		eldifi 4141	. . . . . . 7 ⊢ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
24	23	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
25		elrel 5811	. . . . . 6 ⊢ ((Rel ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∧ 𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
26	22, 24, 25	sylancr 587	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ∃𝑗∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩)
27		nfv 1912	. . . . . 6 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
28		nfmpo2 7514	. . . . . . . 8 ⊢ Ⅎ𝑘(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)
29		nfcv 2903	. . . . . . . 8 ⊢ Ⅎ𝑘𝑧
30	28, 29	nffv 6917	. . . . . . 7 ⊢ Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧)
31	30	nfeq1 2919	. . . . . 6 ⊢ Ⅎ𝑘((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0
32		simprr 773	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 = ⟨𝑗, 𝑘⟩)
33	32	fveq2d 6911	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩))
34		df-ov 7434	. . . . . . . . 9 ⊢ (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩)
35		simprl 771	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
36	32, 35	eqeltrrd 2840	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈))
37	36	eldifad 3975	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶))
38		opeliunxp 5756	. . . . . . . . . . . 12 ⊢ (⟨𝑗, 𝑘⟩ ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ↔ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
39	37, 38	sylib 218	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶))
40	39	simpld 494	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑗 ∈ 𝐴)
41	39	simprd 495	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑘 ∈ 𝐶)
42	39, 5	syldan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑋 ∈ 𝐵)
43	1	ovmpt4g 7580	. . . . . . . . . 10 ⊢ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
44	40, 41, 42, 43	syl3anc 1370	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑗(𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)𝑘) = 𝑋)
45	34, 44	eqtr3id 2789	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘⟨𝑗, 𝑘⟩) = 𝑋)
46		eldifn 4142	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) → ¬ 𝑧 ∈ 𝑈)
47	46	ad2antrl 728	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ¬ 𝑧 ∈ 𝑈)
48	32	eleq1d 2824	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑧 ∈ 𝑈 ↔ ⟨𝑗, 𝑘⟩ ∈ 𝑈))
49		df-br 5149	. . . . . . . . . . . 12 ⊢ (𝑗𝑈𝑘 ↔ ⟨𝑗, 𝑘⟩ ∈ 𝑈)
50	48, 49	bitr4di 289	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → (𝑧 ∈ 𝑈 ↔ 𝑗𝑈𝑘))
51	47, 50	mtbid 324	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ¬ 𝑗𝑈𝑘)
52	39, 51	jca 511	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘))
53		gsum2d2.n	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐶) ∧ ¬ 𝑗𝑈𝑘)) → 𝑋 = 0 )
54	52, 53	syldan 591	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → 𝑋 = 0 )
55	33, 45, 54	3eqtrd 2779	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈) ∧ 𝑧 = ⟨𝑗, 𝑘⟩)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
56	55	expr 456	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
57	27, 31, 56	exlimd 2216	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → (∃𝑘 𝑧 = ⟨𝑗, 𝑘⟩ → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 ))
58	14, 18, 26, 57	exlimimdd 2217	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐶) ∖ 𝑈)) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋)‘𝑧) = 0 )
59	8, 58	suppss 8218	. . 3 ⊢ (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ⊆ 𝑈)
60	4, 59	ssfid 9299	. 2 ⊢ (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)
61		gsum2d2.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
62		gsum2d2.r	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑊)
63	62	ralrimiva 3144	. . . 4 ⊢ (𝜑 → ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊)
64	1	mpoexxg 8099	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑗 ∈ 𝐴 𝐶 ∈ 𝑊) → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
65	61, 63, 64	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V)
66		gsum2d2.z	. . . . 5 ⊢ 0 = (0g‘𝐺)
67	66	fvexi 6921	. . . 4 ⊢ 0 ∈ V
68	67	a1i 11	. . 3 ⊢ (𝜑 → 0 ∈ V)
69		isfsupp 9403	. . 3 ⊢ (((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∈ V ∧ 0 ∈ V) → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 ↔ (Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∧ ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)))
70	65, 68, 69	syl2anc 584	. 2 ⊢ (𝜑 → ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 ↔ (Fun (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) ∧ ((𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) supp 0 ) ∈ Fin)))
71	3, 60, 70	mpbir2and 713	1 ⊢ (𝜑 → (𝑗 ∈ 𝐴, 𝑘 ∈ 𝐶 ↦ 𝑋) finSupp 0 )

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1776   ∈ wcel 2106  ∀wral 3059  Vcvv 3478   ∖ cdif 3960  {csn 4631  ⟨cop 4637  ∪ ciun 4996   class class class wbr 5148   × cxp 5687  Rel wrel 5694  Fun wfun 6557  ⟶wf 6559  ‘cfv 6563  (class class class)co 7431   ∈ cmpo 7433   supp csupp 8184  Fincfn 8984   finSupp cfsupp 9399  Basecbs 17245  0_gc0g 17486  CMndccmn 19813

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-supp 8185  df-1o 8505  df-en 8985  df-fin 8988  df-fsupp 9400

This theorem is referenced by:  gsum2d2  20007  gsumcom2  20008