begin
theorem
theorem
theorem Th3:
theorem Th4:
begin
:: deftheorem LMOD_6:def 1 :
canceled;
:: deftheorem Def2 defines trivial LMOD_6:def 2 :
for K being Ring holds
( K is trivial iff 0. K = 1_ K );
theorem Th5:
theorem
theorem
begin
:: deftheorem defines @ LMOD_6:def 3 :
for K being Ring
for V being LeftMod of K
for W being strict Subspace of V holds @ W = W;
theorem
canceled;
theorem Th9:
:: deftheorem LMOD_6:def 4 :
canceled;
:: deftheorem defines @ LMOD_6:def 5 :
for K being Ring
for V being LeftMod of K
for W being Subspace of V
for A being Subset of W holds @ A = A;
theorem
theorem
theorem Th12:
theorem Th13:
theorem
canceled;
theorem
begin
:: deftheorem defines <: LMOD_6:def 6 :
for K being Ring
for V being LeftMod of K
for a being Vector of V holds <:a:> = Lin {a};
begin
:: deftheorem Def7 defines c= LMOD_6:def 7 :
for K being Ring
for M, N being LeftMod of K holds
( M c= N iff M is Subspace of N );
theorem Th16:
theorem
for
K being
Ring for
r being
Scalar of
K for
M,
N being
LeftMod of
K for
m1,
m2,
m being
Vector of
M for
n1,
n2,
n being
Vector of
N st
M c= N holds
(
0. M = 0. N & (
m1 = n1 &
m2 = n2 implies
m1 + m2 = n1 + n2 ) & (
m = n implies
r * m = r * n ) & (
m = n implies
- n = - m ) & (
m1 = n1 &
m2 = n2 implies
m1 - m2 = n1 - n2 ) &
0. N in M &
0. M in N & (
n1 in M &
n2 in M implies
n1 + n2 in M ) & (
n in M implies
r * n in M ) & (
n in M implies
- n in M ) & (
n1 in M &
n2 in M implies
n1 - n2 in M ) )
theorem
theorem
canceled;
theorem
canceled;
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem
theorem Th40:
theorem Th41:
theorem Th42:
theorem
theorem