Metamath Proof Explorer


Theorem snlindsntor

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 atorsion 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., ( r .x. m ) = 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 atorsion element if there exists a e. R , a =/= 0 , such that a .x. x = 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)

Ref Expression
Hypotheses snlindsntor.b B = Base M
snlindsntor.r R = Scalar M
snlindsntor.s S = Base R
snlindsntor.0 0 ˙ = 0 R
snlindsntor.z Z = 0 M
snlindsntor.t · ˙ = M
Assertion snlindsntor M LMod X B s S 0 ˙ s · ˙ X Z X linIndS M

Proof

Step Hyp Ref Expression
1 snlindsntor.b B = Base M
2 snlindsntor.r R = Scalar M
3 snlindsntor.s S = Base R
4 snlindsntor.0 0 ˙ = 0 R
5 snlindsntor.z Z = 0 M
6 snlindsntor.t · ˙ = M
7 df-ne s · ˙ X Z ¬ s · ˙ X = Z
8 7 ralbii s S 0 ˙ s · ˙ X Z s S 0 ˙ ¬ s · ˙ X = Z
9 raldifsni s S 0 ˙ ¬ s · ˙ X = Z s S s · ˙ X = Z s = 0 ˙
10 8 9 bitri s S 0 ˙ s · ˙ X Z s S s · ˙ X = Z s = 0 ˙
11 simpl M LMod X B M LMod
12 11 adantr M LMod X B s S s · ˙ X = Z s = 0 ˙ M LMod
13 12 adantr M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X M LMod
14 2 fveq2i Base R = Base Scalar M
15 3 14 eqtri S = Base Scalar M
16 15 oveq1i S X = Base Scalar M X
17 16 eleq2i f S X f Base Scalar M X
18 17 bilani M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f Base Scalar M X
19 snelpwi X Base M X 𝒫 Base M
20 19 1 eleq2s X B X 𝒫 Base M
21 20 ad3antlr M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X X 𝒫 Base M
22 lincval M LMod f Base Scalar M X X 𝒫 Base M f linC M X = M x X f x M x
23 13 18 21 22 syl3anc M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f linC M X = M x X f x M x
24 23 eqeq1d M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f linC M X = Z M x X f x M x = Z
25 24 anbi2d M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z finSupp 0 ˙ f M x X f x M x = Z
26 lmodgrp M LMod M Grp
27 26 grpmndd M LMod M Mnd
28 27 ad3antrrr M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X M Mnd
29 simpllr M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X X B
30 elmapi f S X f : X S
31 12 adantl f : X S M LMod X B s S s · ˙ X = Z s = 0 ˙ M LMod
32 snidg X B X X
33 32 adantl M LMod X B X X
34 33 adantr M LMod X B s S s · ˙ X = Z s = 0 ˙ X X
35 ffvelcdm f : X S X X f X S
36 34 35 sylan2 f : X S M LMod X B s S s · ˙ X = Z s = 0 ˙ f X S
37 simprlr f : X S M LMod X B s S s · ˙ X = Z s = 0 ˙ X B
38 eqid M = M
39 1 2 38 3 lmodvscl M LMod f X S X B f X M X B
40 31 36 37 39 syl3anc f : X S M LMod X B s S s · ˙ X = Z s = 0 ˙ f X M X B
41 40 expcom M LMod X B s S s · ˙ X = Z s = 0 ˙ f : X S f X M X B
42 30 41 syl5com f S X M LMod X B s S s · ˙ X = Z s = 0 ˙ f X M X B
43 42 impcom M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f X M X B
44 fveq2 x = X f x = f X
45 id x = X x = X
46 44 45 oveq12d x = X f x M x = f X M X
47 1 46 gsumsn M Mnd X B f X M X B M x X f x M x = f X M X
48 28 29 43 47 syl3anc M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X M x X f x M x = f X M X
49 48 eqeq1d M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X M x X f x M x = Z f X M X = Z
50 32 35 sylan2 f : X S X B f X S
51 50 expcom X B f : X S f X S
52 51 adantl M LMod X B f : X S f X S
53 6 oveqi f X · ˙ X = f X M X
54 53 eqeq1i f X · ˙ X = Z f X M X = Z
55 oveq1 s = f X s · ˙ X = f X · ˙ X
56 55 eqeq1d s = f X s · ˙ X = Z f X · ˙ X = Z
57 eqeq1 s = f X s = 0 ˙ f X = 0 ˙
58 56 57 imbi12d s = f X s · ˙ X = Z s = 0 ˙ f X · ˙ X = Z f X = 0 ˙
59 58 rspcva f X S s S s · ˙ X = Z s = 0 ˙ f X · ˙ X = Z f X = 0 ˙
60 54 59 biimtrrid f X S s S s · ˙ X = Z s = 0 ˙ f X M X = Z f X = 0 ˙
61 60 ex f X S s S s · ˙ X = Z s = 0 ˙ f X M X = Z f X = 0 ˙
62 30 52 61 syl56 M LMod X B f S X s S s · ˙ X = Z s = 0 ˙ f X M X = Z f X = 0 ˙
63 62 com23 M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f X M X = Z f X = 0 ˙
64 63 imp31 M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X f X M X = Z f X = 0 ˙
65 49 64 sylbid M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X M x X f x M x = Z f X = 0 ˙
66 65 adantld M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f M x X f x M x = Z f X = 0 ˙
67 25 66 sylbid M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙
68 67 ralrimiva M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙
69 68 ex M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙
70 impexp finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ finSupp 0 ˙ f f linC M X = Z f X = 0 ˙
71 30 adantl M LMod X B f S X f : X S
72 snfi X Fin
73 72 a1i M LMod X B f S X X Fin
74 4 fvexi 0 ˙ V
75 74 a1i M LMod X B f S X 0 ˙ V
76 71 73 75 fdmfifsupp M LMod X B f S X finSupp 0 ˙ f
77 pm2.27 finSupp 0 ˙ f finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ f linC M X = Z f X = 0 ˙
78 76 77 syl M LMod X B f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ f linC M X = Z f X = 0 ˙
79 70 78 biimtrid M LMod X B f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ f linC M X = Z f X = 0 ˙
80 79 ralimdva M LMod X B f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ f S X f linC M X = Z f X = 0 ˙
81 1 2 3 4 5 6 snlindsntorlem M LMod X B f S X f linC M X = Z f X = 0 ˙ s S s · ˙ X = Z s = 0 ˙
82 80 81 syld M LMod X B f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ s S s · ˙ X = Z s = 0 ˙
83 69 82 impbid M LMod X B s S s · ˙ X = Z s = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙
84 fveqeq2 y = X f y = 0 ˙ f X = 0 ˙
85 84 ralsng X B y X f y = 0 ˙ f X = 0 ˙
86 85 adantl M LMod X B y X f y = 0 ˙ f X = 0 ˙
87 86 bicomd M LMod X B f X = 0 ˙ y X f y = 0 ˙
88 87 imbi2d M LMod X B finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
89 88 ralbidv M LMod X B f S X finSupp 0 ˙ f f linC M X = Z f X = 0 ˙ f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
90 snelpwi X B X 𝒫 B
91 90 adantl M LMod X B X 𝒫 B
92 91 biantrurd M LMod X B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙ X 𝒫 B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
93 83 89 92 3bitrd M LMod X B s S s · ˙ X = Z s = 0 ˙ X 𝒫 B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
94 10 93 bitrid M LMod X B s S 0 ˙ s · ˙ X Z X 𝒫 B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
95 snex X V
96 1 5 2 3 4 islininds X V M LMod X linIndS M X 𝒫 B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
97 95 11 96 sylancr M LMod X B X linIndS M X 𝒫 B f S X finSupp 0 ˙ f f linC M X = Z y X f y = 0 ˙
98 94 97 bitr4d M LMod X B s S 0 ˙ s · ˙ X Z X linIndS M