Theorem snlindsntor 48727

Description: A singleton is linearly independent iff it does not contain a torsion element. According to Wikipedia ("Torsion (algebra)", 15-Apr-2019, https://en.wikipedia.org/wiki/Torsion_(algebra)): "An element m of a module M over a ring R is called a torsion element of the module if there exists a regular element r of the ring (an element that is neither a left nor a right zero divisor) that annihilates m, i.e., (𝑟 · 𝑚) = 0. In an integral domain (a commutative ring without zero divisors), every nonzero element is regular, so a torsion element of a module over an integral domain is one annihilated by a nonzero element of the integral domain." Analogously, the definition in [Lang] p. 147 states that "An element x of [a module] E [over a ring R] is called a torsion element if there exists 𝑎 ∈ 𝑅, 𝑎 ≠ 0, such that 𝑎 · 𝑥 = 0. This definition includes the zero element of the module. Some authors, however, exclude the zero element from the definition of torsion elements. (Contributed by AV, 14-Apr-2019.) (Revised by AV, 27-Apr-2019.)

Hypotheses

Ref	Expression
snlindsntor.b	⊢ 𝐵 = (Base‘𝑀)
snlindsntor.r	⊢ 𝑅 = (Scalar‘𝑀)
snlindsntor.s	⊢ 𝑆 = (Base‘𝑅)
snlindsntor.0	⊢ 0 = (0g‘𝑅)
snlindsntor.z	⊢ 𝑍 = (0g‘𝑀)
snlindsntor.t	⊢ · = ( ·𝑠 ‘𝑀)

Assertion

Ref	Expression
snlindsntor	⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ (𝑆 ∖ { 0 })(𝑠 · 𝑋) ≠ 𝑍 ↔ {𝑋} linIndS 𝑀))

Distinct variable groups:   𝐵,𝑠   𝑀,𝑠   𝑆,𝑠   𝑋,𝑠   𝑍,𝑠   · ,𝑠   0 ,𝑠

Allowed substitution hint:   𝑅(𝑠)

Proof of Theorem snlindsntor

Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ne 2933	. . . . 5 ⊢ ((𝑠 · 𝑋) ≠ 𝑍 ↔ ¬ (𝑠 · 𝑋) = 𝑍)
2	1	ralbii 3082	. . . 4 ⊢ (∀𝑠 ∈ (𝑆 ∖ { 0 })(𝑠 · 𝑋) ≠ 𝑍 ↔ ∀𝑠 ∈ (𝑆 ∖ { 0 }) ¬ (𝑠 · 𝑋) = 𝑍)
3		raldifsni 4751	. . . 4 ⊢ (∀𝑠 ∈ (𝑆 ∖ { 0 }) ¬ (𝑠 · 𝑋) = 𝑍 ↔ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))
4	2, 3	bitri 275	. . 3 ⊢ (∀𝑠 ∈ (𝑆 ∖ { 0 })(𝑠 · 𝑋) ≠ 𝑍 ↔ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))
5		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → 𝑀 ∈ LMod)
6	5	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → 𝑀 ∈ LMod)
7	6	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑀 ∈ LMod)
8		snlindsntor.s	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = (Base‘𝑅)
9		snlindsntor.r	. . . . . . . . . . . . . . . . 17 ⊢ 𝑅 = (Scalar‘𝑀)
10	9	fveq2i 6837	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑅) = (Base‘(Scalar‘𝑀))
11	8, 10	eqtri 2759	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (Base‘(Scalar‘𝑀))
12	11	oveq1i 7368	. . . . . . . . . . . . . 14 ⊢ (𝑆 ↑m {𝑋}) = ((Base‘(Scalar‘𝑀)) ↑m {𝑋})
13	12	eleq2i 2828	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (𝑆 ↑m {𝑋}) ↔ 𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m {𝑋}))
14	13	biimpi 216	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝑆 ↑m {𝑋}) → 𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m {𝑋}))
15	14	adantl 481	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m {𝑋}))
16		snelpwi 5392	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ (Base‘𝑀) → {𝑋} ∈ 𝒫 (Base‘𝑀))
17		snlindsntor.b	. . . . . . . . . . . . 13 ⊢ 𝐵 = (Base‘𝑀)
18	16, 17	eleq2s 2854	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ 𝐵 → {𝑋} ∈ 𝒫 (Base‘𝑀))
19	18	ad3antlr 731	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → {𝑋} ∈ 𝒫 (Base‘𝑀))
20		lincval 48665	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ LMod ∧ 𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m {𝑋}) ∧ {𝑋} ∈ 𝒫 (Base‘𝑀)) → (𝑓( linC ‘𝑀){𝑋}) = (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))))
21	7, 15, 19, 20	syl3anc 1373	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → (𝑓( linC ‘𝑀){𝑋}) = (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))))
22	21	eqeq1d 2738	. . . . . . . . 9 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 ↔ (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = 𝑍))
23	22	anbi2d 630	. . . . . . . 8 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) ↔ (𝑓 finSupp 0 ∧ (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = 𝑍)))
24		lmodgrp 20818	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ LMod → 𝑀 ∈ Grp)
25	24	grpmndd 18876	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ LMod → 𝑀 ∈ Mnd)
26	25	ad3antrrr 730	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑀 ∈ Mnd)
27		simpllr 775	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑋 ∈ 𝐵)
28		elmapi 8786	. . . . . . . . . . . . . 14 ⊢ (𝑓 ∈ (𝑆 ↑m {𝑋}) → 𝑓:{𝑋}⟶𝑆)
29	6	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))) → 𝑀 ∈ LMod)
30		snidg 4617	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ {𝑋})
31	30	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ {𝑋})
32	31	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → 𝑋 ∈ {𝑋})
33		ffvelcdm 7026	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ 𝑋 ∈ {𝑋}) → (𝑓‘𝑋) ∈ 𝑆)
34	32, 33	sylan2 593	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))) → (𝑓‘𝑋) ∈ 𝑆)
35		simprlr 779	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))) → 𝑋 ∈ 𝐵)
36		eqid 2736	. . . . . . . . . . . . . . . . 17 ⊢ ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
37	17, 9, 36, 8	lmodvscl 20829	. . . . . . . . . . . . . . . 16 ⊢ ((𝑀 ∈ LMod ∧ (𝑓‘𝑋) ∈ 𝑆 ∧ 𝑋 ∈ 𝐵) → ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵)
38	29, 34, 35, 37	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ))) → ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵)
39	38	expcom 413	. . . . . . . . . . . . . 14 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → (𝑓:{𝑋}⟶𝑆 → ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵))
40	28, 39	syl5com 31	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (𝑆 ↑m {𝑋}) → (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵))
41	40	impcom 407	. . . . . . . . . . . 12 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵)
42		fveq2 6834	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑋 → (𝑓‘𝑥) = (𝑓‘𝑋))
43		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋)
44	42, 43	oveq12d 7376	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥) = ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋))
45	17, 44	gsumsn 19883	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ 𝐵 ∧ ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ 𝐵) → (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋))
46	26, 27, 41, 45	syl3anc 1373	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋))
47	46	eqeq1d 2738	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = 𝑍 ↔ ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍))
48	30, 33	sylan2 593	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:{𝑋}⟶𝑆 ∧ 𝑋 ∈ 𝐵) → (𝑓‘𝑋) ∈ 𝑆)
49	48	expcom 413	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ 𝐵 → (𝑓:{𝑋}⟶𝑆 → (𝑓‘𝑋) ∈ 𝑆))
50	49	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (𝑓:{𝑋}⟶𝑆 → (𝑓‘𝑋) ∈ 𝑆))
51		snlindsntor.t	. . . . . . . . . . . . . . . . 17 ⊢ · = ( ·𝑠 ‘𝑀)
52	51	oveqi 7371	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑋) · 𝑋) = ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋)
53	52	eqeq1i 2741	. . . . . . . . . . . . . . 15 ⊢ (((𝑓‘𝑋) · 𝑋) = 𝑍 ↔ ((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍)
54		oveq1 7365	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = (𝑓‘𝑋) → (𝑠 · 𝑋) = ((𝑓‘𝑋) · 𝑋))
55	54	eqeq1d 2738	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑓‘𝑋) → ((𝑠 · 𝑋) = 𝑍 ↔ ((𝑓‘𝑋) · 𝑋) = 𝑍))
56		eqeq1 2740	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = (𝑓‘𝑋) → (𝑠 = 0 ↔ (𝑓‘𝑋) = 0 ))
57	55, 56	imbi12d 344	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = (𝑓‘𝑋) → (((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) ↔ (((𝑓‘𝑋) · 𝑋) = 𝑍 → (𝑓‘𝑋) = 0 )))
58	57	rspcva 3574	. . . . . . . . . . . . . . 15 ⊢ (((𝑓‘𝑋) ∈ 𝑆 ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → (((𝑓‘𝑋) · 𝑋) = 𝑍 → (𝑓‘𝑋) = 0 ))
59	53, 58	biimtrrid 243	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑋) ∈ 𝑆 ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → (((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍 → (𝑓‘𝑋) = 0 ))
60	59	ex 412	. . . . . . . . . . . . 13 ⊢ ((𝑓‘𝑋) ∈ 𝑆 → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) → (((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍 → (𝑓‘𝑋) = 0 )))
61	28, 50, 60	syl56 36	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (𝑓 ∈ (𝑆 ↑m {𝑋}) → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) → (((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍 → (𝑓‘𝑋) = 0 ))))
62	61	com23 86	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) → (𝑓 ∈ (𝑆 ↑m {𝑋}) → (((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍 → (𝑓‘𝑋) = 0 ))))
63	62	imp31 417	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → (((𝑓‘𝑋)( ·𝑠 ‘𝑀)𝑋) = 𝑍 → (𝑓‘𝑋) = 0 ))
64	47, 63	sylbid 240	. . . . . . . . 9 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = 𝑍 → (𝑓‘𝑋) = 0 ))
65	64	adantld 490	. . . . . . . 8 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓 finSupp 0 ∧ (𝑀 Σg (𝑥 ∈ {𝑋} ↦ ((𝑓‘𝑥)( ·𝑠 ‘𝑀)𝑥))) = 𝑍) → (𝑓‘𝑋) = 0 ))
66	23, 65	sylbid 240	. . . . . . 7 ⊢ ((((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ))
67	66	ralrimiva 3128	. . . . . 6 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )) → ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ))
68	67	ex 412	. . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) → ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 )))
69		impexp 450	. . . . . . . 8 ⊢ (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) ↔ (𝑓 finSupp 0 → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )))
70	28	adantl 481	. . . . . . . . . 10 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑓:{𝑋}⟶𝑆)
71		snfi 8980	. . . . . . . . . . 11 ⊢ {𝑋} ∈ Fin
72	71	a1i 11	. . . . . . . . . 10 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → {𝑋} ∈ Fin)
73		snlindsntor.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝑅)
74	73	fvexi 6848	. . . . . . . . . . 11 ⊢ 0 ∈ V
75	74	a1i 11	. . . . . . . . . 10 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 0 ∈ V)
76	70, 72, 75	fdmfifsupp 9278	. . . . . . . . 9 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → 𝑓 finSupp 0 )
77		pm2.27 42	. . . . . . . . 9 ⊢ (𝑓 finSupp 0 → ((𝑓 finSupp 0 → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )) → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )))
78	76, 77	syl 17	. . . . . . . 8 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → ((𝑓 finSupp 0 → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )) → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )))
79	69, 78	biimtrid 242	. . . . . . 7 ⊢ (((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑓 ∈ (𝑆 ↑m {𝑋})) → (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) → ((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )))
80	79	ralimdva 3148	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) → ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 )))
81		snlindsntor.z	. . . . . . 7 ⊢ 𝑍 = (0g‘𝑀)
82	17, 9, 8, 73, 81, 51	snlindsntorlem 48726	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓( linC ‘𝑀){𝑋}) = 𝑍 → (𝑓‘𝑋) = 0 ) → ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )))
83	80, 82	syld 47	. . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) → ∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 )))
84	68, 83	impbid 212	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) ↔ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 )))
85		fveqeq2 6843	. . . . . . . . 9 ⊢ (𝑦 = 𝑋 → ((𝑓‘𝑦) = 0 ↔ (𝑓‘𝑋) = 0 ))
86	85	ralsng 4632	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐵 → (∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ↔ (𝑓‘𝑋) = 0 ))
87	86	adantl 481	. . . . . . 7 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ↔ (𝑓‘𝑋) = 0 ))
88	87	bicomd 223	. . . . . 6 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ((𝑓‘𝑋) = 0 ↔ ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))
89	88	imbi2d 340	. . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) ↔ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 )))
90	89	ralbidv 3159	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → (𝑓‘𝑋) = 0 ) ↔ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 )))
91		snelpwi 5392	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → {𝑋} ∈ 𝒫 𝐵)
92	91	adantl 481	. . . . 5 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → {𝑋} ∈ 𝒫 𝐵)
93	92	biantrurd 532	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ) ↔ ({𝑋} ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))))
94	84, 90, 93	3bitrd 305	. . 3 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ 𝑆 ((𝑠 · 𝑋) = 𝑍 → 𝑠 = 0 ) ↔ ({𝑋} ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))))
95	4, 94	bitrid 283	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ (𝑆 ∖ { 0 })(𝑠 · 𝑋) ≠ 𝑍 ↔ ({𝑋} ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))))
96		snex 5381	. . 3 ⊢ {𝑋} ∈ V
97	17, 81, 9, 8, 73	islininds 48702	. . 3 ⊢ (({𝑋} ∈ V ∧ 𝑀 ∈ LMod) → ({𝑋} linIndS 𝑀 ↔ ({𝑋} ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))))
98	96, 5, 97	sylancr 587	. 2 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ({𝑋} linIndS 𝑀 ↔ ({𝑋} ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝑆 ↑m {𝑋})((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀){𝑋}) = 𝑍) → ∀𝑦 ∈ {𝑋} (𝑓‘𝑦) = 0 ))))
99	95, 98	bitr4d 282	1 ⊢ ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (∀𝑠 ∈ (𝑆 ∖ { 0 })(𝑠 · 𝑋) ≠ 𝑍 ↔ {𝑋} linIndS 𝑀))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051  Vcvv 3440   ∖ cdif 3898  𝒫 cpw 4554  {csn 4580   class class class wbr 5098   ↦ cmpt 5179  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358   ↑_m cmap 8763  Fincfn 8883   finSupp cfsupp 9264  Basecbs 17136  Scalarcsca 17180   ·_𝑠 cvsca 17181  0_gc0g 17359   Σ_g cgsu 17360  Mndcmnd 18659  LModclmod 20811   linC clinc 48660   linIndS clininds 48696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  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-isom 6501  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-supp 8103  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-er 8635  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fsupp 9265  df-oi 9415  df-card 9851  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-nn 12146  df-n0 12402  df-z 12489  df-uz 12752  df-fz 13424  df-fzo 13571  df-seq 13925  df-hash 14254  df-0g 17361  df-gsum 17362  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-grp 18866  df-mulg 18998  df-cntz 19246  df-lmod 20813  df-linc 48662  df-lininds 48698

This theorem is referenced by:  lindssnlvec  48742