let K be Ring; :: thesis: 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 ) )

let r be Scalar of K; :: thesis: 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 ) )

let M, N be LeftMod of K; :: thesis: 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 ) )

let m1, m2, m be Vector of M; :: thesis: 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 ) )

let n1, n2, n be Vector of N; :: thesis: ( M c= N implies ( 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 ) ) )
assume A1: M c= N ; :: thesis: ( 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 ) )
thus 0. M = 0. N :: thesis: ( ( 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
reconsider M' = M as Subspace of N by A1, Def7;
0. M' = 0. N by VECTSP_4:19;
hence 0. M = 0. N ; :: thesis: verum
end;
thus ( m1 = n1 & m2 = n2 implies m1 + m2 = n1 + n2 ) :: thesis: ( ( 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
assume A2: ( m1 = n1 & m2 = n2 ) ; :: thesis: m1 + m2 = n1 + n2
reconsider M' = M as Subspace of N by A1, Def7;
reconsider m1' = m1, m2' = m2 as Vector of M' ;
( m1' = n1 & m2' = n2 ) by A2;
hence m1 + m2 = n1 + n2 by VECTSP_4:21; :: thesis: verum
end;
thus ( m = n implies r * m = r * n ) :: thesis: ( ( 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
assume A3: m = n ; :: thesis: r * m = r * n
reconsider M' = M as Subspace of N by A1, Def7;
reconsider m' = m as Vector of M' ;
m' = n by A3;
hence r * m = r * n by VECTSP_4:22; :: thesis: verum
end;
thus ( m = n implies - n = - m ) :: thesis: ( ( 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
assume A4: m = n ; :: thesis: - n = - m
reconsider M' = M as Subspace of N by A1, Def7;
reconsider m' = m as Vector of M' ;
m' = n by A4;
hence - n = - m by VECTSP_4:23; :: thesis: verum
end;
thus ( m1 = n1 & m2 = n2 implies m1 - m2 = n1 - n2 ) :: thesis: ( 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
assume A5: ( m1 = n1 & m2 = n2 ) ; :: thesis: m1 - m2 = n1 - n2
reconsider M' = M as Subspace of N by A1, Def7;
reconsider m1' = m1, m2' = m2 as Vector of M' ;
( m1' = n1 & m2' = n2 ) by A5;
hence m1 - m2 = n1 - n2 by VECTSP_4:24; :: thesis: verum
end;
thus 0. N in M :: thesis: ( 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
reconsider M' = M as Subspace of N by A1, Def7;
0. N in M' by VECTSP_4:25;
hence 0. N in M ; :: thesis: verum
end;
thus 0. M in N :: thesis: ( ( 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
reconsider M' = M as Subspace of N by A1, Def7;
0. M' in N by VECTSP_4:27;
hence 0. M in N ; :: thesis: verum
end;
thus ( n1 in M & n2 in M implies n1 + n2 in M ) :: thesis: ( ( 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
assume A6: ( n1 in M & n2 in M ) ; :: thesis: n1 + n2 in M
reconsider M' = M as Subspace of N by A1, Def7;
( n1 in M' & n2 in M' ) by A6;
hence n1 + n2 in M by VECTSP_4:28; :: thesis: verum
end;
thus ( n in M implies r * n in M ) :: thesis: ( ( n in M implies - n in M ) & ( n1 in M & n2 in M implies n1 - n2 in M ) )
proof
assume A7: n in M ; :: thesis: r * n in M
reconsider M' = M as Subspace of N by A1, Def7;
n in M' by A7;
hence r * n in M by VECTSP_4:29; :: thesis: verum
end;
thus ( n in M implies - n in M ) :: thesis: ( n1 in M & n2 in M implies n1 - n2 in M )
proof
assume A8: n in M ; :: thesis: - n in M
reconsider M' = M as Subspace of N by A1, Def7;
n in M' by A8;
hence - n in M by VECTSP_4:30; :: thesis: verum
end;
thus ( n1 in M & n2 in M implies n1 - n2 in M ) :: thesis: verum
proof
assume A9: ( n1 in M & n2 in M ) ; :: thesis: n1 - n2 in M
reconsider M' = M as Subspace of N by A1, Def7;
( n1 in M' & n2 in M' ) by A9;
hence n1 - n2 in M by VECTSP_4:31; :: thesis: verum
end;