Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lindsrng01 Structured version   Visualization version   GIF version

Theorem lindsrng01 44668
 Description: Any subset of a module is always linearly independent if the underlying ring has at most one element. Since the underlying ring cannot be the empty set (see lmodsn0 19623), this means that the underlying ring has only one element, so it is a zero ring. (Contributed by AV, 14-Apr-2019.) (Revised by AV, 27-Apr-2019.)
Hypotheses
Ref Expression
lindsrng01.b 𝐵 = (Base‘𝑀)
lindsrng01.r 𝑅 = (Scalar‘𝑀)
lindsrng01.e 𝐸 = (Base‘𝑅)
Assertion
Ref Expression
lindsrng01 ((𝑀 ∈ LMod ∧ ((♯‘𝐸) = 0 ∨ (♯‘𝐸) = 1) ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 linIndS 𝑀)

Proof of Theorem lindsrng01
Dummy variables 𝑓 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lindsrng01.r . . . . . . . . 9 𝑅 = (Scalar‘𝑀)
2 lindsrng01.e . . . . . . . . 9 𝐸 = (Base‘𝑅)
31, 2lmodsn0 19623 . . . . . . . 8 (𝑀 ∈ LMod → 𝐸 ≠ ∅)
42fvexi 6660 . . . . . . . . . 10 𝐸 ∈ V
5 hasheq0 13709 . . . . . . . . . 10 (𝐸 ∈ V → ((♯‘𝐸) = 0 ↔ 𝐸 = ∅))
64, 5ax-mp 5 . . . . . . . . 9 ((♯‘𝐸) = 0 ↔ 𝐸 = ∅)
7 eqneqall 3017 . . . . . . . . . 10 (𝐸 = ∅ → (𝐸 ≠ ∅ → 𝑆 linIndS 𝑀))
87com12 32 . . . . . . . . 9 (𝐸 ≠ ∅ → (𝐸 = ∅ → 𝑆 linIndS 𝑀))
96, 8syl5bi 244 . . . . . . . 8 (𝐸 ≠ ∅ → ((♯‘𝐸) = 0 → 𝑆 linIndS 𝑀))
103, 9syl 17 . . . . . . 7 (𝑀 ∈ LMod → ((♯‘𝐸) = 0 → 𝑆 linIndS 𝑀))
1110adantr 483 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → ((♯‘𝐸) = 0 → 𝑆 linIndS 𝑀))
1211com12 32 . . . . 5 ((♯‘𝐸) = 0 → ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 linIndS 𝑀))
131lmodring 19618 . . . . . . . . 9 (𝑀 ∈ LMod → 𝑅 ∈ Ring)
1413adantr 483 . . . . . . . 8 ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑅 ∈ Ring)
15 eqid 2820 . . . . . . . . 9 (0g𝑅) = (0g𝑅)
162, 150ring 20019 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (♯‘𝐸) = 1) → 𝐸 = {(0g𝑅)})
1714, 16sylan 582 . . . . . . 7 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → 𝐸 = {(0g𝑅)})
18 simpr 487 . . . . . . . . . 10 ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 ∈ 𝒫 𝐵)
1918adantr 483 . . . . . . . . 9 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → 𝑆 ∈ 𝒫 𝐵)
2019adantl 484 . . . . . . . 8 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → 𝑆 ∈ 𝒫 𝐵)
21 snex 5308 . . . . . . . . . . . . . 14 {(0g𝑅)} ∈ V
2219, 21jctil 522 . . . . . . . . . . . . 13 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → ({(0g𝑅)} ∈ V ∧ 𝑆 ∈ 𝒫 𝐵))
2322adantl 484 . . . . . . . . . . . 12 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → ({(0g𝑅)} ∈ V ∧ 𝑆 ∈ 𝒫 𝐵))
24 elmapg 8397 . . . . . . . . . . . 12 (({(0g𝑅)} ∈ V ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑓 ∈ ({(0g𝑅)} ↑m 𝑆) ↔ 𝑓:𝑆⟶{(0g𝑅)}))
2523, 24syl 17 . . . . . . . . . . 11 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑓 ∈ ({(0g𝑅)} ↑m 𝑆) ↔ 𝑓:𝑆⟶{(0g𝑅)}))
26 fvex 6659 . . . . . . . . . . . . . 14 (0g𝑅) ∈ V
2726fconst2 6943 . . . . . . . . . . . . 13 (𝑓:𝑆⟶{(0g𝑅)} ↔ 𝑓 = (𝑆 × {(0g𝑅)}))
28 fconstmpt 5590 . . . . . . . . . . . . . 14 (𝑆 × {(0g𝑅)}) = (𝑥𝑆 ↦ (0g𝑅))
2928eqeq2i 2833 . . . . . . . . . . . . 13 (𝑓 = (𝑆 × {(0g𝑅)}) ↔ 𝑓 = (𝑥𝑆 ↦ (0g𝑅)))
3027, 29bitri 277 . . . . . . . . . . . 12 (𝑓:𝑆⟶{(0g𝑅)} ↔ 𝑓 = (𝑥𝑆 ↦ (0g𝑅)))
31 eqidd 2821 . . . . . . . . . . . . . . . 16 (((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) ∧ 𝑣𝑆) → (𝑥𝑆 ↦ (0g𝑅)) = (𝑥𝑆 ↦ (0g𝑅)))
32 eqidd 2821 . . . . . . . . . . . . . . . 16 ((((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) ∧ 𝑣𝑆) ∧ 𝑥 = 𝑣) → (0g𝑅) = (0g𝑅))
33 simpr 487 . . . . . . . . . . . . . . . 16 (((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) ∧ 𝑣𝑆) → 𝑣𝑆)
34 fvexd 6661 . . . . . . . . . . . . . . . 16 (((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) ∧ 𝑣𝑆) → (0g𝑅) ∈ V)
3531, 32, 33, 34fvmptd 6751 . . . . . . . . . . . . . . 15 (((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) ∧ 𝑣𝑆) → ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅))
3635ralrimiva 3169 . . . . . . . . . . . . . 14 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → ∀𝑣𝑆 ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅))
3736a1d 25 . . . . . . . . . . . . 13 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (((𝑥𝑆 ↦ (0g𝑅)) finSupp (0g𝑅) ∧ ((𝑥𝑆 ↦ (0g𝑅))( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅)))
38 breq1 5045 . . . . . . . . . . . . . . 15 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → (𝑓 finSupp (0g𝑅) ↔ (𝑥𝑆 ↦ (0g𝑅)) finSupp (0g𝑅)))
39 oveq1 7140 . . . . . . . . . . . . . . . 16 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → (𝑓( linC ‘𝑀)𝑆) = ((𝑥𝑆 ↦ (0g𝑅))( linC ‘𝑀)𝑆))
4039eqeq1d 2822 . . . . . . . . . . . . . . 15 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → ((𝑓( linC ‘𝑀)𝑆) = (0g𝑀) ↔ ((𝑥𝑆 ↦ (0g𝑅))( linC ‘𝑀)𝑆) = (0g𝑀)))
4138, 40anbi12d 632 . . . . . . . . . . . . . 14 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → ((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) ↔ ((𝑥𝑆 ↦ (0g𝑅)) finSupp (0g𝑅) ∧ ((𝑥𝑆 ↦ (0g𝑅))( linC ‘𝑀)𝑆) = (0g𝑀))))
42 fveq1 6645 . . . . . . . . . . . . . . . 16 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → (𝑓𝑣) = ((𝑥𝑆 ↦ (0g𝑅))‘𝑣))
4342eqeq1d 2822 . . . . . . . . . . . . . . 15 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → ((𝑓𝑣) = (0g𝑅) ↔ ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅)))
4443ralbidv 3184 . . . . . . . . . . . . . 14 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → (∀𝑣𝑆 (𝑓𝑣) = (0g𝑅) ↔ ∀𝑣𝑆 ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅)))
4541, 44imbi12d 347 . . . . . . . . . . . . 13 (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → (((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)) ↔ (((𝑥𝑆 ↦ (0g𝑅)) finSupp (0g𝑅) ∧ ((𝑥𝑆 ↦ (0g𝑅))( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 ((𝑥𝑆 ↦ (0g𝑅))‘𝑣) = (0g𝑅))))
4637, 45syl5ibrcom 249 . . . . . . . . . . . 12 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑓 = (𝑥𝑆 ↦ (0g𝑅)) → ((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅))))
4730, 46syl5bi 244 . . . . . . . . . . 11 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑓:𝑆⟶{(0g𝑅)} → ((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅))))
4825, 47sylbid 242 . . . . . . . . . 10 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑓 ∈ ({(0g𝑅)} ↑m 𝑆) → ((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅))))
4948ralrimiv 3168 . . . . . . . . 9 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → ∀𝑓 ∈ ({(0g𝑅)} ↑m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)))
50 oveq1 7140 . . . . . . . . . . 11 (𝐸 = {(0g𝑅)} → (𝐸m 𝑆) = ({(0g𝑅)} ↑m 𝑆))
5150raleqdv 3398 . . . . . . . . . 10 (𝐸 = {(0g𝑅)} → (∀𝑓 ∈ (𝐸m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)) ↔ ∀𝑓 ∈ ({(0g𝑅)} ↑m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅))))
5251adantr 483 . . . . . . . . 9 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (∀𝑓 ∈ (𝐸m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)) ↔ ∀𝑓 ∈ ({(0g𝑅)} ↑m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅))))
5349, 52mpbird 259 . . . . . . . 8 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → ∀𝑓 ∈ (𝐸m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)))
54 simpl 485 . . . . . . . . . . 11 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → (𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵))
5554ancomd 464 . . . . . . . . . 10 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → (𝑆 ∈ 𝒫 𝐵𝑀 ∈ LMod))
5655adantl 484 . . . . . . . . 9 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑆 ∈ 𝒫 𝐵𝑀 ∈ LMod))
57 lindsrng01.b . . . . . . . . . 10 𝐵 = (Base‘𝑀)
58 eqid 2820 . . . . . . . . . 10 (0g𝑀) = (0g𝑀)
5957, 58, 1, 2, 15islininds 44646 . . . . . . . . 9 ((𝑆 ∈ 𝒫 𝐵𝑀 ∈ LMod) → (𝑆 linIndS 𝑀 ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)))))
6056, 59syl 17 . . . . . . . 8 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → (𝑆 linIndS 𝑀 ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸m 𝑆)((𝑓 finSupp (0g𝑅) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g𝑀)) → ∀𝑣𝑆 (𝑓𝑣) = (0g𝑅)))))
6120, 53, 60mpbir2and 711 . . . . . . 7 ((𝐸 = {(0g𝑅)} ∧ ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1)) → 𝑆 linIndS 𝑀)
6217, 61mpancom 686 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) ∧ (♯‘𝐸) = 1) → 𝑆 linIndS 𝑀)
6362expcom 416 . . . . 5 ((♯‘𝐸) = 1 → ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 linIndS 𝑀))
6412, 63jaoi 853 . . . 4 (((♯‘𝐸) = 0 ∨ (♯‘𝐸) = 1) → ((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 linIndS 𝑀))
6564expd 418 . . 3 (((♯‘𝐸) = 0 ∨ (♯‘𝐸) = 1) → (𝑀 ∈ LMod → (𝑆 ∈ 𝒫 𝐵𝑆 linIndS 𝑀)))
6665com12 32 . 2 (𝑀 ∈ LMod → (((♯‘𝐸) = 0 ∨ (♯‘𝐸) = 1) → (𝑆 ∈ 𝒫 𝐵𝑆 linIndS 𝑀)))
67663imp 1107 1 ((𝑀 ∈ LMod ∧ ((♯‘𝐸) = 0 ∨ (♯‘𝐸) = 1) ∧ 𝑆 ∈ 𝒫 𝐵) → 𝑆 linIndS 𝑀)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   ≠ wne 3006  ∀wral 3125  Vcvv 3473  ∅c0 4269  𝒫 cpw 4515  {csn 4543   class class class wbr 5042   ↦ cmpt 5122   × cxp 5529  ⟶wf 6327  ‘cfv 6331  (class class class)co 7133   ↑m cmap 8384   finSupp cfsupp 8811  0cc0 10515  1c1 10516  ♯chash 13675  Basecbs 16462  Scalarcsca 16547  0gc0g 16692  Ringcrg 19276  LModclmod 19610   linC clinc 44604   linIndS clininds 44640 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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439  ax-cnex 10571  ax-resscn 10572  ax-1cn 10573  ax-icn 10574  ax-addcl 10575  ax-addrcl 10576  ax-mulcl 10577  ax-mulrcl 10578  ax-mulcom 10579  ax-addass 10580  ax-mulass 10581  ax-distr 10582  ax-i2m1 10583  ax-1ne0 10584  ax-1rid 10585  ax-rnegex 10586  ax-rrecex 10587  ax-cnre 10588  ax-pre-lttri 10589  ax-pre-lttrn 10590  ax-pre-ltadd 10591  ax-pre-mulgt0 10592 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-nel 3111  df-ral 3130  df-rex 3131  df-reu 3132  df-rmo 3133  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-tp 4548  df-op 4550  df-uni 4815  df-int 4853  df-iun 4897  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5436  df-eprel 5441  df-po 5450  df-so 5451  df-fr 5490  df-we 5492  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-pred 6124  df-ord 6170  df-on 6171  df-lim 6172  df-suc 6173  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-riota 7091  df-ov 7136  df-oprab 7137  df-mpo 7138  df-om 7559  df-1st 7667  df-2nd 7668  df-wrecs 7925  df-recs 7986  df-rdg 8024  df-1o 8080  df-er 8267  df-map 8386  df-en 8488  df-dom 8489  df-sdom 8490  df-fin 8491  df-card 9346  df-pnf 10655  df-mnf 10656  df-xr 10657  df-ltxr 10658  df-le 10659  df-sub 10850  df-neg 10851  df-nn 11617  df-n0 11877  df-z 11961  df-uz 12223  df-fz 12877  df-hash 13676  df-0g 16694  df-mgm 17831  df-sgrp 17880  df-mnd 17891  df-grp 18085  df-ring 19278  df-lmod 19612  df-lininds 44642 This theorem is referenced by:  lindszr  44669
 Copyright terms: Public domain W3C validator