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

Lm1: for GF being non empty Abelian add-associative right_zeroed right_complementable associative commutative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a, b being Element of GF
for v being Element of V holds (a - b) * v = (a * v) - (b * v)
proof end;

definition
let GF be non empty HGrStr ;
let V be non empty VectSpStr of GF;
let V1 be Subset of V;
attr V1 is lineary-closed means :Def1: :: VECTSP_4:def 1
( ( for v, u being Element of V st v in V1 & u in V1 holds
v + u in V1 ) & ( for a being Element of GF
for v being Element of V st v in V1 holds
a * v in V1 ) );
end;

:: deftheorem Def1 defines lineary-closed VECTSP_4:def 1 :
for GF being non empty HGrStr
for V being non empty VectSpStr of GF
for V1 being Subset of V holds
( V1 is lineary-closed iff ( ( for v, u being Element of V st v in V1 & u in V1 holds
v + u in V1 ) & ( for a being Element of GF
for v being Element of V st v in V1 holds
a * v in V1 ) ) );

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

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

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

theorem Th4: :: VECTSP_4:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 <> {} & V1 is lineary-closed holds
0. V in V1
proof end;

theorem Th5: :: VECTSP_4:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 is lineary-closed holds
for v being Element of V st v in V1 holds
- v in V1
proof end;

theorem :: VECTSP_4:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 is lineary-closed holds
for v, u being Element of V st v in V1 & u in V1 holds
v - u in V1
proof end;

theorem Th7: :: VECTSP_4:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds {(0. V)} is lineary-closed
proof end;

theorem :: VECTSP_4:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st the carrier of V = V1 holds
V1 is lineary-closed
proof end;

theorem :: VECTSP_4:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1, V2, V3 being Subset of V st V1 is lineary-closed & V2 is lineary-closed & V3 = { (v + u) where v, u is Element of V : ( v in V1 & u in V2 ) } holds
V3 is lineary-closed
proof end;

theorem :: VECTSP_4:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1, V2 being Subset of V st V1 is lineary-closed & V2 is lineary-closed holds
V1 /\ V2 is lineary-closed
proof end;

definition
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
mode Subspace of V -> non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF means :Def2: :: VECTSP_4:def 2
( the carrier of it c= the carrier of V & the Zero of it = the Zero of V & the add of it = the add of V || the carrier of it & the lmult of it = the lmult of V | [:the carrier of GF,the carrier of it:] );
existence
ex b1 being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF st
( the carrier of b1 c= the carrier of V & the Zero of b1 = the Zero of V & the add of b1 = the add of V || the carrier of b1 & the lmult of b1 = the lmult of V | [:the carrier of GF,the carrier of b1:] )
proof end;
end;

:: deftheorem Def2 defines Subspace VECTSP_4:def 2 :
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V, b3 being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds
( b3 is Subspace of V iff ( the carrier of b3 c= the carrier of V & the Zero of b3 = the Zero of V & the add of b3 = the add of V || the carrier of b3 & the lmult of b3 = the lmult of V | [:the carrier of GF,the carrier of b3:] ) );

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

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

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

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

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

theorem :: VECTSP_4: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 GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V st x in W1 & W1 is Subspace of W2 holds
x in W2
proof end;

theorem Th17: :: VECTSP_4:17  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 GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V st x in W holds
x in V
proof end;

theorem Th18: :: VECTSP_4:18  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for w being Element of W holds w is Element of V
proof end;

theorem Th19: :: VECTSP_4:19  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds 0. W = 0. V by Def2;

theorem :: VECTSP_4:20  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V holds 0. W1 = 0. W2
proof end;

theorem Th21: :: VECTSP_4:21  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V
for w1, w2 being Element of W st w1 = v & w2 = u holds
w1 + w2 = v + u
proof end;

theorem Th22: :: VECTSP_4:22  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V
for w being Element of W st w = v holds
a * w = a * v
proof end;

theorem Th23: :: VECTSP_4:23  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V
for w being Element of W st w = v holds
- v = - w
proof end;

theorem Th24: :: VECTSP_4:24  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V
for w1, w2 being Element of W st w1 = v & w2 = u holds
w1 - w2 = v - u
proof end;

Lm2: for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for V1 being Subset of V st the carrier of W = V1 holds
V1 is lineary-closed
proof end;

theorem Th25: :: VECTSP_4:25  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds 0. V in W
proof end;

theorem :: VECTSP_4:26  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V holds 0. W1 in W2
proof end;

theorem :: VECTSP_4:27  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds 0. W in V
proof end;

theorem Th28: :: VECTSP_4:28  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V st u in W & v in W holds
u + v in W
proof end;

theorem Th29: :: VECTSP_4:29  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V st v in W holds
a * v in W
proof end;

theorem Th30: :: VECTSP_4:30  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V st v in W holds
- v in W
proof end;

theorem Th31: :: VECTSP_4:31  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V st u in W & v in W holds
u - v in W
proof end;

theorem Th32: :: VECTSP_4:32  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds V is Subspace of V
proof end;

theorem Th33: :: VECTSP_4:33  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for X, V being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of GF st V is Subspace of X & X is Subspace of V holds
V = X
proof end;

theorem Th34: :: VECTSP_4:34  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V, X, Y being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF st V is Subspace of X & X is Subspace of Y holds
V is Subspace of Y
proof end;

theorem Th35: :: VECTSP_4:35  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V st the carrier of W1 c= the carrier of W2 holds
W1 is Subspace of W2
proof end;

theorem :: VECTSP_4:36  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V st ( for v being Element of V st v in W1 holds
v in W2 ) holds
W1 is Subspace of W2
proof end;

registration
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
cluster non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like Subspace of V;
existence
ex b1 being Subspace of V st b1 is strict
proof end;
end;

theorem Th37: :: VECTSP_4:37  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being strict Subspace of V st the carrier of W1 = the carrier of W2 holds
W1 = W2
proof end;

theorem Th38: :: VECTSP_4:38  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being strict Subspace of V st ( for v being Element of V holds
( v in W1 iff v in W2 ) ) holds
W1 = W2
proof end;

theorem :: VECTSP_4:39  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of GF
for W being strict Subspace of V st the carrier of W = the carrier of V holds
W = V
proof end;

theorem :: VECTSP_4:40  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of GF
for W being strict Subspace of V st ( for v being Element of V holds v in W ) holds
W = V
proof end;

theorem :: VECTSP_4:41  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for V1 being Subset of V st the carrier of W = V1 holds
V1 is lineary-closed by Lm2;

theorem Th42: :: VECTSP_4:42  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 <> {} & V1 is lineary-closed holds
ex W being strict Subspace of V st V1 = the carrier of W
proof end;

definition
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
func (0). V -> strict Subspace of V means :Def3: :: VECTSP_4:def 3
the carrier of it = {(0. V)};
correctness
existence
ex b1 being strict Subspace of V st the carrier of b1 = {(0. V)}
;
uniqueness
for b1, b2 being strict Subspace of V st the carrier of b1 = {(0. V)} & the carrier of b2 = {(0. V)} holds
b1 = b2
;
proof end;
end;

:: deftheorem Def3 defines (0). VECTSP_4:def 3 :
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for b3 being strict Subspace of V holds
( b3 = (0). V iff the carrier of b3 = {(0. V)} );

definition
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
func (Omega). V -> strict Subspace of V equals :: VECTSP_4:def 4
VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #);
coherence
VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #) is strict Subspace of V
proof end;
end;

:: deftheorem defines (Omega). VECTSP_4:def 4 :
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds (Omega). V = VectSpStr(# the carrier of V,the add of V,the Zero of V,the lmult of V #);

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

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

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

theorem :: VECTSP_4:46  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 GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds
( x in (0). V iff x = 0. V )
proof end;

theorem Th47: :: VECTSP_4:47  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0). W = (0). V
proof end;

theorem Th48: :: VECTSP_4:48  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V holds (0). W1 = (0). W2
proof end;

theorem :: VECTSP_4:49  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0). W is Subspace of V by Th34;

theorem :: VECTSP_4:50  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0). V is Subspace of W
proof end;

theorem :: VECTSP_4:51  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being Subspace of V holds (0). W1 is Subspace of W2
proof end;

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

theorem :: VECTSP_4:53  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable strict VectSp-like VectSpStr of GF holds V is Subspace of (Omega). V ;

definition
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
let v be Element of V;
let W be Subspace of V;
func v + W -> Subset of V equals :: VECTSP_4:def 5
{ (v + u) where u is Element of V : u in W } ;
coherence
{ (v + u) where u is Element of V : u in W } is Subset of V
proof end;
end;

:: deftheorem defines + VECTSP_4:def 5 :
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds v + W = { (v + u) where u is Element of V : u in W } ;

Lm3: for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0. V) + W = the carrier of W
proof end;

definition
let GF be non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr ;
let V be non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF;
let W be Subspace of V;
mode Coset of W -> Subset of V means :Def6: :: VECTSP_4:def 6
ex v being Element of V st it = v + W;
existence
ex b1 being Subset of V ex v being Element of V st b1 = v + W
proof end;
end;

:: deftheorem Def6 defines Coset VECTSP_4:def 6 :
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for b4 being Subset of V holds
( b4 is Coset of W iff ex v being Element of V st b4 = v + W );

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

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

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

theorem Th57: :: VECTSP_4:57  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 GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( x in v + W iff ex u being Element of V st
( u in W & x = v + u ) )
proof end;

theorem Th58: :: VECTSP_4:58  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( 0. V in v + W iff v in W )
proof end;

theorem Th59: :: VECTSP_4:59  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds v in v + W
proof end;

theorem :: VECTSP_4:60  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds (0. V) + W = the carrier of W by Lm3;

theorem Th61: :: VECTSP_4:61  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V holds v + ((0). V) = {v}
proof end;

Lm4: for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( v in W iff v + W = the carrier of W )
proof end;

theorem Th62: :: VECTSP_4:62  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V holds v + ((Omega). V) = the carrier of V
proof end;

theorem Th63: :: VECTSP_4:63  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( 0. V in v + W iff v + W = the carrier of W )
proof end;

theorem :: VECTSP_4:64  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V holds
( v in W iff v + W = the carrier of W ) by Lm4;

theorem Th65: :: VECTSP_4:65  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V st v in W holds
(a * v) + W = the carrier of W
proof end;

theorem Th66: :: VECTSP_4:66  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V st a <> 0. GF & (a * v) + W = the carrier of W holds
v in W
proof end;

theorem :: VECTSP_4:67  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for v being Element of V
for W being Subspace of V holds
( v in W iff (- v) + W = the carrier of W )
proof end;

theorem Th68: :: VECTSP_4:68  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V holds
( u in W iff v + W = (v + u) + W )
proof end;

theorem :: VECTSP_4:69  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V holds
( u in W iff v + W = (v - u) + W )
proof end;

theorem Th70: :: VECTSP_4:70  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V holds
( v in u + W iff u + W = v + W )
proof end;

theorem Th71: :: VECTSP_4:71  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v1, v2 being Element of V
for W being Subspace of V st u in v1 + W & u in v2 + W holds
v1 + W = v2 + W
proof end;

theorem :: VECTSP_4:72  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being Field
for V being VectSp of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V st a <> 1. GF & a * v in v + W holds
v in W
proof end;

theorem Th73: :: VECTSP_4:73  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a being Element of GF
for v being Element of V
for W being Subspace of V st v in W holds
a * v in v + W
proof end;

theorem :: VECTSP_4:74  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V st v in W holds
- v in v + W
proof end;

theorem Th75: :: VECTSP_4:75  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V holds
( u + v in v + W iff u in W )
proof end;

theorem :: VECTSP_4:76  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V holds
( v - u in v + W iff u in W )
proof end;

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

theorem :: VECTSP_4:78  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V holds
( u in v + W iff ex v1 being Element of V st
( v1 in W & u = v - v1 ) )
proof end;

theorem Th79: :: VECTSP_4:79  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v1, v2 being Element of V
for W being Subspace of V holds
( ex v being Element of V st
( v1 in v + W & v2 in v + W ) iff v1 - v2 in W )
proof end;

theorem Th80: :: VECTSP_4:80  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V st v + W = u + W holds
ex v1 being Element of V st
( v1 in W & v + v1 = u )
proof end;

theorem Th81: :: VECTSP_4:81  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W being Subspace of V st v + W = u + W holds
ex v1 being Element of V st
( v1 in W & v - v1 = u )
proof end;

theorem Th82: :: VECTSP_4:82  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W1, W2 being strict Subspace of V holds
( v + W1 = v + W2 iff W1 = W2 )
proof end;

theorem Th83: :: VECTSP_4:83  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v, u being Element of V
for W1, W2 being strict Subspace of V st v + W1 = u + W2 holds
W1 = W2
proof end;

theorem :: VECTSP_4:84  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V
for W being Subspace of V ex C being Coset of W st v in C
proof end;

theorem :: VECTSP_4:85  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for C being Coset of W holds
( C is lineary-closed iff C = the carrier of W )
proof end;

theorem :: VECTSP_4:86  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W1, W2 being strict Subspace of V
for C1 being Coset of W1
for C2 being Coset of W2 st C1 = C2 holds
W1 = W2
proof end;

theorem :: VECTSP_4:87  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v being Element of V holds {v} is Coset of (0). V
proof end;

theorem :: VECTSP_4:88  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 is Coset of (0). V holds
ex v being Element of V st V1 = {v}
proof end;

theorem :: VECTSP_4:89  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V holds the carrier of W is Coset of W
proof end;

theorem :: VECTSP_4:90  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF holds the carrier of V is Coset of (Omega). V
proof end;

theorem :: VECTSP_4:91  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for V1 being Subset of V st V1 is Coset of (Omega). V holds
V1 = the carrier of V
proof end;

theorem :: VECTSP_4:92  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for W being Subspace of V
for C being Coset of W holds
( 0. V in C iff C = the carrier of W )
proof end;

theorem Th93: :: VECTSP_4:93  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u being Element of V
for W being Subspace of V
for C being Coset of W holds
( u in C iff C = u + W )
proof end;

theorem :: VECTSP_4:94  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V
for C being Coset of W st u in C & v in C holds
ex v1 being Element of V st
( v1 in W & u + v1 = v )
proof end;

theorem :: VECTSP_4:95  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u, v being Element of V
for W being Subspace of V
for C being Coset of W st u in C & v in C holds
ex v1 being Element of V st
( v1 in W & u - v1 = v )
proof end;

theorem :: VECTSP_4:96  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for v1, v2 being Element of V
for W being Subspace of V holds
( ex C being Coset of W st
( v1 in C & v2 in C ) iff v1 - v2 in W )
proof end;

theorem :: VECTSP_4:97  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for u being Element of V
for W being Subspace of V
for B, C being Coset of W st u in B & u in C holds
B = C
proof end;

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

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

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

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

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

theorem :: VECTSP_4:103  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for GF being non empty Abelian add-associative right_zeroed right_complementable associative commutative distributive left_unital doubleLoopStr
for V being non empty Abelian add-associative right_zeroed right_complementable VectSp-like VectSpStr of GF
for a, b being Element of GF
for v being Element of V holds (a - b) * v = (a * v) - (b * v) by Lm1;