Theorem scmsuppss 48363

Description: The support of a mapping of a scalar multiplication with a function of scalars is a subset of the support of the function of scalars. (Contributed by AV, 5-Apr-2019.)

Hypotheses

Ref	Expression
scmsuppss.s	⊢ 𝑆 = (Scalar‘𝑀)
scmsuppss.r	⊢ 𝑅 = (Base‘𝑆)

Assertion

Ref	Expression
scmsuppss	⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) supp (0g‘𝑀)) ⊆ (𝐴 supp (0g‘𝑆)))

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

Allowed substitution hint:   𝑆(𝑣)

Proof of Theorem scmsuppss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elmapi 8825	. . . . 5 ⊢ (𝐴 ∈ (𝑅 ↑m 𝑉) → 𝐴:𝑉⟶𝑅)
2		fdm 6700	. . . . . 6 ⊢ (𝐴:𝑉⟶𝑅 → dom 𝐴 = 𝑉)
3		eqidd 2731	. . . . . . . . . . . 12 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) = (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)))
4		fveq2 6861	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑥 → (𝐴‘𝑣) = (𝐴‘𝑥))
5		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑥 → 𝑣 = 𝑥)
6	4, 5	oveq12d 7408	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑥 → ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣) = ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥))
7	6	adantl 481	. . . . . . . . . . . 12 ⊢ (((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) ∧ 𝑣 = 𝑥) → ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣) = ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥))
8		simpr 484	. . . . . . . . . . . 12 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑉)
9		ovex 7423	. . . . . . . . . . . . 13 ⊢ ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) ∈ V
10	9	a1i 11	. . . . . . . . . . . 12 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) ∈ V)
11	3, 7, 8, 10	fvmptd 6978	. . . . . . . . . . 11 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) = ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥))
12	11	neeq1d 2985	. . . . . . . . . 10 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → (((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀) ↔ ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) ≠ (0g‘𝑀)))
13		oveq1 7397	. . . . . . . . . . . . 13 ⊢ ((𝐴‘𝑥) = (0g‘𝑆) → ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) = ((0g‘𝑆)( ·𝑠 ‘𝑀)𝑥))
14		simplrr 777	. . . . . . . . . . . . . 14 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → 𝑀 ∈ LMod)
15		elelpwi 4576	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → 𝑥 ∈ (Base‘𝑀))
16	15	expcom 413	. . . . . . . . . . . . . . . . 17 ⊢ (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑥 ∈ 𝑉 → 𝑥 ∈ (Base‘𝑀)))
17	16	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod) → (𝑥 ∈ 𝑉 → 𝑥 ∈ (Base‘𝑀)))
18	17	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) → (𝑥 ∈ 𝑉 → 𝑥 ∈ (Base‘𝑀)))
19	18	imp 406	. . . . . . . . . . . . . 14 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (Base‘𝑀))
20		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (Base‘𝑀) = (Base‘𝑀)
21		scmsuppss.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (Scalar‘𝑀)
22		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
23		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (0g‘𝑆) = (0g‘𝑆)
24		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (0g‘𝑀) = (0g‘𝑀)
25	20, 21, 22, 23, 24	lmod0vs 20808	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ LMod ∧ 𝑥 ∈ (Base‘𝑀)) → ((0g‘𝑆)( ·𝑠 ‘𝑀)𝑥) = (0g‘𝑀))
26	14, 19, 25	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → ((0g‘𝑆)( ·𝑠 ‘𝑀)𝑥) = (0g‘𝑀))
27	13, 26	sylan9eqr 2787	. . . . . . . . . . . 12 ⊢ (((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) ∧ (𝐴‘𝑥) = (0g‘𝑆)) → ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) = (0g‘𝑀))
28	27	ex 412	. . . . . . . . . . 11 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → ((𝐴‘𝑥) = (0g‘𝑆) → ((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) = (0g‘𝑀)))
29	28	necon3d 2947	. . . . . . . . . 10 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → (((𝐴‘𝑥)( ·𝑠 ‘𝑀)𝑥) ≠ (0g‘𝑀) → (𝐴‘𝑥) ≠ (0g‘𝑆)))
30	12, 29	sylbid 240	. . . . . . . . 9 ⊢ ((((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) ∧ 𝑥 ∈ 𝑉) → (((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀) → (𝐴‘𝑥) ≠ (0g‘𝑆)))
31	30	ss2rabdv 4042	. . . . . . . 8 ⊢ (((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) → {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ 𝑉 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
32		ovex 7423	. . . . . . . . . . . . 13 ⊢ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣) ∈ V
33		eqid 2730	. . . . . . . . . . . . 13 ⊢ (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) = (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))
34	32, 33	dmmpti 6665	. . . . . . . . . . . 12 ⊢ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) = 𝑉
35		rabeq 3423	. . . . . . . . . . . 12 ⊢ (dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) = 𝑉 → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} = {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)})
36	34, 35	mp1i 13	. . . . . . . . . . 11 ⊢ (dom 𝐴 = 𝑉 → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} = {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)})
37		rabeq 3423	. . . . . . . . . . 11 ⊢ (dom 𝐴 = 𝑉 → {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)} = {𝑥 ∈ 𝑉 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
38	36, 37	sseq12d 3983	. . . . . . . . . 10 ⊢ (dom 𝐴 = 𝑉 → ({𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)} ↔ {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ 𝑉 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)}))
39	38	adantr 480	. . . . . . . . 9 ⊢ ((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) → ({𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)} ↔ {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ 𝑉 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)}))
40	39	adantr 480	. . . . . . . 8 ⊢ (((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) → ({𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)} ↔ {𝑥 ∈ 𝑉 ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ 𝑉 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)}))
41	31, 40	mpbird 257	. . . . . . 7 ⊢ (((dom 𝐴 = 𝑉 ∧ 𝐴:𝑉⟶𝑅) ∧ (𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝑀 ∈ LMod)) → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
42	41	exp43 436	. . . . . 6 ⊢ (dom 𝐴 = 𝑉 → (𝐴:𝑉⟶𝑅 → (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑀 ∈ LMod → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)}))))
43	2, 42	mpcom 38	. . . . 5 ⊢ (𝐴:𝑉⟶𝑅 → (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑀 ∈ LMod → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})))
44	1, 43	syl 17	. . . 4 ⊢ (𝐴 ∈ (𝑅 ↑m 𝑉) → (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑀 ∈ LMod → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})))
45	44	com13 88	. . 3 ⊢ (𝑀 ∈ LMod → (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝐴 ∈ (𝑅 ↑m 𝑉) → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})))
46	45	3imp 1110	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)} ⊆ {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
47		funmpt 6557	. . . 4 ⊢ Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))
48	47	a1i 11	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)))
49		mptexg 7198	. . . 4 ⊢ (𝑉 ∈ 𝒫 (Base‘𝑀) → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∈ V)
50	49	3ad2ant2 1134	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∈ V)
51		fvexd 6876	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → (0g‘𝑀) ∈ V)
52		suppval1 8148	. . 3 ⊢ ((Fun (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∧ (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∈ V ∧ (0g‘𝑀) ∈ V) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) supp (0g‘𝑀)) = {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)})
53	48, 50, 51, 52	syl3anc 1373	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) supp (0g‘𝑀)) = {𝑥 ∈ dom (𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) ∣ ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣))‘𝑥) ≠ (0g‘𝑀)})
54		elmapfun 8842	. . . 4 ⊢ (𝐴 ∈ (𝑅 ↑m 𝑉) → Fun 𝐴)
55	54	3ad2ant3 1135	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → Fun 𝐴)
56		simp3 1138	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → 𝐴 ∈ (𝑅 ↑m 𝑉))
57		fvexd 6876	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → (0g‘𝑆) ∈ V)
58		suppval1 8148	. . 3 ⊢ ((Fun 𝐴 ∧ 𝐴 ∈ (𝑅 ↑m 𝑉) ∧ (0g‘𝑆) ∈ V) → (𝐴 supp (0g‘𝑆)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
59	55, 56, 57, 58	syl3anc 1373	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → (𝐴 supp (0g‘𝑆)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴‘𝑥) ≠ (0g‘𝑆)})
60	46, 53, 59	3sstr4d 4005	1 ⊢ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ 𝐴 ∈ (𝑅 ↑m 𝑉)) → ((𝑣 ∈ 𝑉 ↦ ((𝐴‘𝑣)( ·𝑠 ‘𝑀)𝑣)) supp (0g‘𝑀)) ⊆ (𝐴 supp (0g‘𝑆)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  {crab 3408  Vcvv 3450   ⊆ wss 3917  𝒫 cpw 4566   ↦ cmpt 5191  dom cdm 5641  Fun wfun 6508  ⟶wf 6510  ‘cfv 6514  (class class class)co 7390   supp csupp 8142   ↑_m cmap 8802  Basecbs 17186  Scalarcsca 17230   ·_𝑠 cvsca 17231  0_gc0g 17409  LModclmod 20773

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-supp 8143  df-map 8804  df-0g 17411  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-grp 18875  df-ring 20151  df-lmod 20775

This theorem is referenced by:  scmsuppfi  48366