Theorem rmfsupp2 33314

Description: A mapping of a multiplication of a constant with a function into a ring is finitely supported if the function is finitely supported. (Contributed by Thierry Arnoux, 3-Jun-2023.)

Hypotheses

Ref	Expression
rmfsuppf2.r	⊢ 𝑅 = (Base‘𝑀)
rmfsupp2.m	⊢ (𝜑 → 𝑀 ∈ Ring)
rmfsupp2.v	⊢ (𝜑 → 𝑉 ∈ 𝑋)
rmfsupp2.c	⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → 𝐶 ∈ 𝑅)
rmfsupp2.a	⊢ (𝜑 → 𝐴:𝑉⟶𝑅)
rmfsupp2.1	⊢ (𝜑 → 𝐴 finSupp (0g‘𝑀))

Assertion

Ref	Expression
rmfsupp2	⊢ (𝜑 → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) finSupp (0g‘𝑀))

Distinct variable groups:   𝑣,𝐴   𝑣,𝑀   𝑣,𝑅   𝑣,𝑉   𝜑,𝑣

Allowed substitution hints:   𝐶(𝑣)   𝑋(𝑣)

Proof of Theorem rmfsupp2

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funmpt 6530	. . 3 ⊢ Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))
2	1	a1i 11	. 2 ⊢ (𝜑 → Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)))
3		rmfsupp2.v	. . . . 5 ⊢ (𝜑 → 𝑉 ∈ 𝑋)
4	3	mptexd 7172	. . . 4 ⊢ (𝜑 → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∈ V)
5		rmfsupp2.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ Ring)
6		ringgrp 20210	. . . . 5 ⊢ (𝑀 ∈ Ring → 𝑀 ∈ Grp)
7		rmfsuppf2.r	. . . . . 6 ⊢ 𝑅 = (Base‘𝑀)
8		eqid 2737	. . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀)
9	7, 8	grpidcl 18932	. . . . 5 ⊢ (𝑀 ∈ Grp → (0g‘𝑀) ∈ 𝑅)
10	5, 6, 9	3syl 18	. . . 4 ⊢ (𝜑 → (0g‘𝑀) ∈ 𝑅)
11		suppval1 8109	. . . 4 ⊢ ((Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∧ (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∈ V ∧ (0g‘𝑀) ∈ 𝑅) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) supp (0g‘𝑀)) = {𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) ≠ (0g‘𝑀)})
12	2, 4, 10, 11	syl3anc 1374	. . 3 ⊢ (𝜑 → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) supp (0g‘𝑀)) = {𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) ≠ (0g‘𝑀)})
13		ovex 7393	. . . . . . 7 ⊢ ((𝐴‘𝑣)(.r‘𝑀)𝐶) ∈ V
14		eqid 2737	. . . . . . 7 ⊢ (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) = (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))
15	13, 14	dmmpti 6636	. . . . . 6 ⊢ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) = 𝑉
16	15	a1i 11	. . . . 5 ⊢ (𝜑 → dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) = 𝑉)
17		ovex 7393	. . . . . . . . 9 ⊢ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ∈ V
18		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑣𝑢
19		nfcv 2899	. . . . . . . . . . 11 ⊢ Ⅎ𝑣(𝐴‘𝑢)
20		nfcv 2899	. . . . . . . . . . 11 ⊢ Ⅎ𝑣(.r‘𝑀)
21		nfcsb1v 3862	. . . . . . . . . . 11 ⊢ Ⅎ𝑣⦋𝑢 / 𝑣⦌𝐶
22	19, 20, 21	nfov 7390	. . . . . . . . . 10 ⊢ Ⅎ𝑣((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶)
23		fveq2 6834	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑢 → (𝐴‘𝑣) = (𝐴‘𝑢))
24		csbeq1a 3852	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑢 → 𝐶 = ⦋𝑢 / 𝑣⦌𝐶)
25	23, 24	oveq12d 7378	. . . . . . . . . 10 ⊢ (𝑣 = 𝑢 → ((𝐴‘𝑣)(.r‘𝑀)𝐶) = ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
26	18, 22, 25, 14	fvmptf 6963	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝑉 ∧ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ∈ V) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) = ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
27	17, 26	mpan2 692	. . . . . . . 8 ⊢ (𝑢 ∈ 𝑉 → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) = ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
28	27, 15	eleq2s 2855	. . . . . . 7 ⊢ (𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) = ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
29	28	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) = ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
30	29	neeq1d 2992	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))) → (((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) ≠ (0g‘𝑀) ↔ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)))
31	16, 30	rabeqbidva 3406	. . . 4 ⊢ (𝜑 → {𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) ≠ (0g‘𝑀)} = {𝑢 ∈ 𝑉 ∣ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)})
32		rmfsupp2.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴:𝑉⟶𝑅)
33	32	fdmd 6672	. . . . . . 7 ⊢ (𝜑 → dom 𝐴 = 𝑉)
34	33	rabeqdv 3405	. . . . . 6 ⊢ (𝜑 → {𝑢 ∈ dom 𝐴 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)} = {𝑢 ∈ 𝑉 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)})
35	32	ffund 6666	. . . . . . . 8 ⊢ (𝜑 → Fun 𝐴)
36	7	fvexi 6848	. . . . . . . . . . 11 ⊢ 𝑅 ∈ V
37	36	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ V)
38	37, 3	elmapd 8780	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ (𝑅 ↑m 𝑉) ↔ 𝐴:𝑉⟶𝑅))
39	32, 38	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ (𝑅 ↑m 𝑉))
40		suppval1 8109	. . . . . . . 8 ⊢ ((Fun 𝐴 ∧ 𝐴 ∈ (𝑅 ↑m 𝑉) ∧ (0g‘𝑀) ∈ 𝑅) → (𝐴 supp (0g‘𝑀)) = {𝑢 ∈ dom 𝐴 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)})
41	35, 39, 10, 40	syl3anc 1374	. . . . . . 7 ⊢ (𝜑 → (𝐴 supp (0g‘𝑀)) = {𝑢 ∈ dom 𝐴 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)})
42		rmfsupp2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 finSupp (0g‘𝑀))
43	42	fsuppimpd 9275	. . . . . . 7 ⊢ (𝜑 → (𝐴 supp (0g‘𝑀)) ∈ Fin)
44	41, 43	eqeltrrd 2838	. . . . . 6 ⊢ (𝜑 → {𝑢 ∈ dom 𝐴 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)} ∈ Fin)
45	34, 44	eqeltrrd 2838	. . . . 5 ⊢ (𝜑 → {𝑢 ∈ 𝑉 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)} ∈ Fin)
46		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → (𝐴‘𝑢) = (0g‘𝑀))
47	46	oveq1d 7375	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) = ((0g‘𝑀)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶))
48	5	ad2antrr 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → 𝑀 ∈ Ring)
49		simplr 769	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → 𝑢 ∈ 𝑉)
50		rmfsupp2.c	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → 𝐶 ∈ 𝑅)
51	50	ralrimiva 3130	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑣 ∈ 𝑉 𝐶 ∈ 𝑅)
52	51	ad2antrr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → ∀𝑣 ∈ 𝑉 𝐶 ∈ 𝑅)
53		rspcsbela 4379	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ 𝑉 ∧ ∀𝑣 ∈ 𝑉 𝐶 ∈ 𝑅) → ⦋𝑢 / 𝑣⦌𝐶 ∈ 𝑅)
54	49, 52, 53	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → ⦋𝑢 / 𝑣⦌𝐶 ∈ 𝑅)
55		eqid 2737	. . . . . . . . . . 11 ⊢ (.r‘𝑀) = (.r‘𝑀)
56	7, 55, 8	ringlz 20265	. . . . . . . . . 10 ⊢ ((𝑀 ∈ Ring ∧ ⦋𝑢 / 𝑣⦌𝐶 ∈ 𝑅) → ((0g‘𝑀)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) = (0g‘𝑀))
57	48, 54, 56	syl2anc 585	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → ((0g‘𝑀)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) = (0g‘𝑀))
58	47, 57	eqtrd 2772	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑉) ∧ (𝐴‘𝑢) = (0g‘𝑀)) → ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) = (0g‘𝑀))
59	58	ex 412	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑉) → ((𝐴‘𝑢) = (0g‘𝑀) → ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) = (0g‘𝑀)))
60	59	necon3d 2954	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑉) → (((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀) → (𝐴‘𝑢) ≠ (0g‘𝑀)))
61	60	ss2rabdv 4016	. . . . 5 ⊢ (𝜑 → {𝑢 ∈ 𝑉 ∣ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)} ⊆ {𝑢 ∈ 𝑉 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)})
62		ssfi 9100	. . . . 5 ⊢ (({𝑢 ∈ 𝑉 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)} ∈ Fin ∧ {𝑢 ∈ 𝑉 ∣ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)} ⊆ {𝑢 ∈ 𝑉 ∣ (𝐴‘𝑢) ≠ (0g‘𝑀)}) → {𝑢 ∈ 𝑉 ∣ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)} ∈ Fin)
63	45, 61, 62	syl2anc 585	. . . 4 ⊢ (𝜑 → {𝑢 ∈ 𝑉 ∣ ((𝐴‘𝑢)(.r‘𝑀)⦋𝑢 / 𝑣⦌𝐶) ≠ (0g‘𝑀)} ∈ Fin)
64	31, 63	eqeltrd 2837	. . 3 ⊢ (𝜑 → {𝑢 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶))‘𝑢) ≠ (0g‘𝑀)} ∈ Fin)
65	12, 64	eqeltrd 2837	. 2 ⊢ (𝜑 → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) supp (0g‘𝑀)) ∈ Fin)
66		isfsupp 9271	. . 3 ⊢ (((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∈ V ∧ (0g‘𝑀) ∈ 𝑅) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) finSupp (0g‘𝑀) ↔ (Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∧ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) supp (0g‘𝑀)) ∈ Fin)))
67	4, 10, 66	syl2anc 585	. 2 ⊢ (𝜑 → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) finSupp (0g‘𝑀) ↔ (Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) ∧ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) supp (0g‘𝑀)) ∈ Fin)))
68	2, 65, 67	mpbir2and 714	1 ⊢ (𝜑 → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)(.r‘𝑀)𝐶)) finSupp (0g‘𝑀))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  {crab 3390  Vcvv 3430  ⦋csb 3838   ⊆ wss 3890   class class class wbr 5086   ↦ cmpt 5167  dom cdm 5624  Fun wfun 6486  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360   supp csupp 8103   ↑_m cmap 8766  Fincfn 8886   finSupp cfsupp 9267  Basecbs 17170  ._rcmulr 17212  0_gc0g 17393  Grpcgrp 18900  Ringcrg 20205

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-supp 8104  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-fsupp 9268  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-plusg 17224  df-0g 17395  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-grp 18903  df-minusg 18904  df-cmn 19748  df-abl 19749  df-mgp 20113  df-rng 20125  df-ur 20154  df-ring 20207

This theorem is referenced by:  evlextv  33701  fedgmullem1  33789