:: LMOD_6 semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

notation
let K be Ring;
let V be LeftMod of K;
synonym Submodules V for Subspaces V;
end;

theorem :: LMOD_6:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for K being Ring
for M1, M2 being LeftMod of K st M1 = VectSpStr(# the carrier of M2,the add of M2,the Zero of M2,the lmult of M2 #) holds
( x in M1 iff x in M2 )
proof end;

theorem :: LMOD_6:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for r being Scalar of K
for V being LeftMod of K
for a being Vector of V
for v being Vector of VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) st a = v holds
r * a = r * v
proof end;

theorem Th3: :: LMOD_6:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K holds VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) is strict Subspace of V
proof end;

theorem Th4: :: LMOD_6:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K holds V is Subspace of (Omega). V
proof end;

definition
let K be Ring;
canceled;
redefine attr K is trivial means :Def2: :: LMOD_6:def 2
0. K = 1. K;
compatibility
( K is trivial iff 0. K = 1. K )
proof end;
end;

:: 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: :: LMOD_6:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K st K is trivial holds
( ( for r being Scalar of K holds r = 0. K ) & ( for a being Vector of V holds a = 0. V ) )
proof end;

theorem :: LMOD_6:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K st K is trivial holds
V is trivial
proof end;

theorem :: LMOD_6:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K holds
( V is trivial iff VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) = (0). V )
proof end;

definition
let K be Ring;
let V be LeftMod of K;
let W be strict Subspace of V;
func @ W -> Element of Submodules V equals :: LMOD_6:def 3
W;
coherence
W is Element of Submodules V
by VECTSP_5:def 3;
end;

:: 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 :: LMOD_6:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem Th9: :: LMOD_6:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W being Subspace of V
for A being Subset of W holds A is Subset of V
proof end;

definition
let K be Ring;
let V be LeftMod of K;
let W be Subspace of V;
let A be Subset of W;
canceled;
func @ A -> Subset of V equals :: LMOD_6:def 5
A;
coherence
A is Subset of V
by Th9;
end;

:: 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;

registration
let K be Ring;
let V be LeftMod of K;
let W be Subspace of V;
let A be non empty Subset of W;
cluster @ A -> non empty ;
coherence
not @ A is empty
;
end;

theorem Th10: :: LMOD_6:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for K being Ring
for V being LeftMod of K holds
( x in [#] V iff x in V )
proof end;

theorem :: LMOD_6:11  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for K being Ring
for V being LeftMod of K
for W being Subspace of V holds
( x in @ ([#] W) iff x in W ) by Th10;

theorem Th12: :: LMOD_6:12  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for A being Subset of V holds A c= [#] (Lin A)
proof end;

theorem Th13: :: LMOD_6:13  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for A being Subset of V
for l being Linear_Combination of A st A <> {} & A is lineary-closed holds
Sum l in A
proof end;

theorem :: LMOD_6:14  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: LMOD_6:15  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for A being Subset of V st 0. V in A & A is lineary-closed holds
A = [#] (Lin A)
proof end;

definition
let K be Ring;
let V be LeftMod of K;
let a be Vector of V;
:: original: {
redefine func {a} -> Subset of V;
coherence
{a} is Subset of V
proof end;
end;

definition
let K be Ring;
let V be LeftMod of K;
let a be Vector of V;
func <:a:> -> strict Subspace of V equals :: LMOD_6:def 6
Lin {a};
correctness
coherence
Lin {a} is strict Subspace of V
;
;
end;

:: 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};

definition
let K be Ring;
let M, N be LeftMod of K;
pred M c= N means :Def7: :: LMOD_6:def 7
M is Subspace of N;
reflexivity
for M being LeftMod of K holds M is Subspace of M
by VECTSP_4:32;
end;

:: 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: :: LMOD_6:16  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x being set
for K being Ring
for M, N being LeftMod of K st M c= N holds
( ( x in M implies x in N ) & ( x is Vector of M implies x is Vector of N ) )
proof end;

theorem :: LMOD_6:17  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
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 ) )
proof end;

theorem :: LMOD_6:18  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for M1, N, M2 being LeftMod of K st M1 c= N & M2 c= N holds
( 0. M1 = 0. M2 & 0. M1 in M2 & ( the carrier of M1 c= the carrier of M2 implies M1 c= M2 ) & ( ( for n being Vector of N st n in M1 holds
n in M2 ) implies M1 c= M2 ) & ( the carrier of M1 = the carrier of M2 & M1 is strict & M2 is strict implies M1 = M2 ) & (0). M1 c= M2 )
proof end;

theorem :: LMOD_6:19  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: LMOD_6:20  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: LMOD_6:21  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V, M being strict LeftMod of K st V c= M & M c= V holds
V = M
proof end;

theorem :: LMOD_6:22  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V, M, N being LeftMod of K st V c= M & M c= N holds
V c= N
proof end;

theorem :: LMOD_6:23  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for M, N being LeftMod of K st M c= N holds
(0). M c= N
proof end;

theorem :: LMOD_6:24  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for M, N being LeftMod of K st M c= N holds
(0). N c= M
proof end;

theorem :: LMOD_6:25  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for M, N being LeftMod of K st M c= N holds
M c= (Omega). N
proof end;

theorem :: LMOD_6:26  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds
( W1 c= W1 + W2 & W2 c= W1 + W2 )
proof end;

theorem :: LMOD_6:27  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds
( W1 /\ W2 c= W1 & W1 /\ W2 c= W2 )
proof end;

theorem :: LMOD_6:28  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V st W1 c= W2 holds
W1 /\ W3 c= W2 /\ W3
proof end;

theorem :: LMOD_6:29  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W3, W2 being Subspace of V st W1 c= W3 holds
W1 /\ W2 c= W3
proof end;

theorem :: LMOD_6:30  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V st W1 c= W2 & W1 c= W3 holds
W1 c= W2 /\ W3
proof end;

theorem :: LMOD_6:31  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds W1 /\ W2 c= W1 + W2
proof end;

theorem :: LMOD_6:32  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V holds (W1 /\ W2) + (W2 /\ W3) c= W2 /\ (W1 + W3)
proof end;

theorem :: LMOD_6:33  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V st W1 c= W2 holds
W2 /\ (W1 + W3) = (W1 /\ W2) + (W2 /\ W3)
proof end;

theorem :: LMOD_6:34  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W2, W1, W3 being Subspace of V holds W2 + (W1 /\ W3) c= (W1 + W2) /\ (W2 + W3)
proof end;

theorem :: LMOD_6:35  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V st W1 c= W2 holds
W2 + (W1 /\ W3) = (W1 + W2) /\ (W2 + W3)
proof end;

theorem :: LMOD_6:36  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2, W3 being Subspace of V st W1 c= W2 holds
W1 c= W2 + W3
proof end;

theorem :: LMOD_6:37  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W3, W2 being Subspace of V st W1 c= W3 & W2 c= W3 holds
W1 + W2 c= W3
proof end;

theorem :: LMOD_6:38  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for A, B being Subset of V st A c= B holds
Lin A c= Lin B
proof end;

theorem :: LMOD_6:39  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for A, B being Subset of V holds Lin (A /\ B) c= (Lin A) /\ (Lin B)
proof end;

theorem Th40: :: LMOD_6:40  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for M1, M2 being LeftMod of K st M1 c= M2 holds
[#] M1 c= [#] M2
proof end;

theorem Th41: :: LMOD_6:41  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds
( W1 c= W2 iff for a being Vector of V st a in W1 holds
a in W2 )
proof end;

theorem Th42: :: LMOD_6:42  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds
( W1 c= W2 iff [#] W1 c= [#] W2 )
proof end;

theorem :: LMOD_6:43  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W1, W2 being Subspace of V holds
( W1 c= W2 iff @ ([#] W1) c= @ ([#] W2) ) by Th42;

theorem :: LMOD_6:44  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for K being Ring
for V being LeftMod of K
for W, W1, W2 being Subspace of V holds
( (0). W c= V & (0). V c= W & (0). W1 c= W2 )
proof end;