:: RLVECT_1 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
:: deftheorem Def1 defines in RLVECT_1:def 1 :
theorem :: RLVECT_1:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines 0. RLVECT_1:def 2 :
:: deftheorem defines + RLVECT_1:def 3 :
:: deftheorem defines * RLVECT_1:def 4 :
theorem :: RLVECT_1:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm1:
now
take ZS =
{0};
:: thesis: ex O being Element of ZS ex F being BinOp of ZS ex G being Function of [:REAL ,ZS:],ZS st
( ( for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + y = y + x ) & ( for x, y, z being VECTOR of RLSStruct(# ZS,O,F,G #) holds (x + y) + z = x + (y + z) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )reconsider O = 0 as
Element of
ZS by TARSKI:def 1;
take O =
O;
:: thesis: ex F being BinOp of ZS ex G being Function of [:REAL ,ZS:],ZS st
( ( for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + y = y + x ) & ( for x, y, z being VECTOR of RLSStruct(# ZS,O,F,G #) holds (x + y) + z = x + (y + z) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )deffunc H1(
Element of
ZS,
Element of
ZS)
-> Element of
ZS =
O;
consider F being
BinOp of
ZS such that A1:
for
x,
y being
Element of
ZS holds
F . x,
y = H1(
x,
y)
from BINOP_1:sch 2(
R
);
deffunc H2(
Element of
REAL ,
Element of
ZS)
-> Element of
ZS =
O;
consider G being
Function of
[:REAL ,ZS:],
ZS such that A2:
for
a being
Element of
REAL for
x being
Element of
ZS holds
G . [a,x] = H2(
a,
x)
from FUNCT_2:sch 8(
REAL
R
R
);
take F =
F;
:: thesis: ex G being Function of [:REAL ,ZS:],ZS st
( ( for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + y = y + x ) & ( for x, y, z being VECTOR of RLSStruct(# ZS,O,F,G #) holds (x + y) + z = x + (y + z) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )take G =
G;
:: thesis: ( ( for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + y = y + x ) & ( for x, y, z being VECTOR of RLSStruct(# ZS,O,F,G #) holds (x + y) + z = x + (y + z) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )set W =
RLSStruct(#
ZS,
O,
F,
G #);
thus
for
x,
y being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
x + y = y + x
:: thesis: ( ( for x, y, z being VECTOR of RLSStruct(# ZS,O,F,G #) holds (x + y) + z = x + (y + z) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let x,
y be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: x + y = y + x
A3:
(
x + y = F . x,
y &
y + x = F . y,
x )
;
reconsider X =
x,
Y =
y as
Element of
ZS ;
(
x + y = H1(
X,
Y) &
y + x = H1(
Y,
X) )
by A1, A3;
hence
x + y = y + x
;
:: thesis: verum
end;
thus
for
x,
y,
z being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
(x + y) + z = x + (y + z)
:: thesis: ( ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds x + (0. RLSStruct(# ZS,O,F,G #)) = x ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let x,
y,
z be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: (x + y) + z = x + (y + z)
A4:
(
(x + y) + z = F . (x + y),
z &
x + (y + z) = F . x,
(y + z) )
;
reconsider X =
x,
Y =
y,
Z =
z as
Element of
ZS ;
(
(x + y) + z = H1(
H1(
X,
Y),
Z) &
x + (y + z) = H1(
X,
H1(
Y,
Z)) )
by A1, A4;
hence
(x + y) + z = x + (y + z)
;
:: thesis: verum
end;
thus
for
x being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
x + (0. RLSStruct(# ZS,O,F,G #)) = x
:: thesis: ( ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #) ) & ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let x be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: x + (0. RLSStruct(# ZS,O,F,G #)) = x
reconsider X =
x as
Element of
ZS ;
x + (0. RLSStruct(# ZS,O,F,G #)) =
F . [x,(0. RLSStruct(# ZS,O,F,G #))]
.=
F . x,
(0. RLSStruct(# ZS,O,F,G #))
.=
H1(
X,
O)
by A1
;
hence
x + (0. RLSStruct(# ZS,O,F,G #)) = x
by TARSKI:def 1;
:: thesis: verum
end;
thus
for
x being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) ex
y being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) st
x + y = 0. RLSStruct(#
ZS,
O,
F,
G #)
:: thesis: ( ( for a being Real
for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let x be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: ex y being VECTOR of RLSStruct(# ZS,O,F,G #) st x + y = 0. RLSStruct(# ZS,O,F,G #)
reconsider y =
O as
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) ;
take
y
;
:: thesis: x + y = 0. RLSStruct(# ZS,O,F,G #)
thus x + y =
F . [x,y]
.=
F . x,
y
.=
the
Zero of
RLSStruct(#
ZS,
O,
F,
G #)
by A1
.=
0. RLSStruct(#
ZS,
O,
F,
G #)
;
:: thesis: verum
end;
thus
for
a being
Real for
x,
y being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
a * (x + y) = (a * x) + (a * y)
:: thesis: ( ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a + b) * x = (a * x) + (b * x) ) & ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let a be
Real;
:: thesis: for x, y being VECTOR of RLSStruct(# ZS,O,F,G #) holds a * (x + y) = (a * x) + (a * y)let x,
y be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: a * (x + y) = (a * x) + (a * y)
reconsider X =
x,
Y =
y as
Element of
ZS ;
(a * x) + (a * y) =
F . [(a * x),(a * y)]
.=
F . (a * x),
(a * y)
.=
H1(
H2(
a,
X),
H2(
a,
Y))
by A1
;
hence
a * (x + y) = (a * x) + (a * y)
by A2;
:: thesis: verum
end;
thus
for
a,
b being
Real for
x being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
(a + b) * x = (a * x) + (b * x)
:: thesis: ( ( for a, b being Real
for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds (a * b) * x = a * (b * x) ) & ( for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x ) )
proof
let a,
b be
Real;
let x be
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #);
:: thesis: (a + b) * x = (a * x) + (b * x)
set c =
a + b;
reconsider X =
x as
Element of
ZS ;
A5:
(a + b) * x =
G . [(a + b),x]
.=
H2(
a + b,
X)
by A2
;
(a * x) + (b * x) =
F . [(a * x),(b * x)]
.=
F . (a * x),
(b * x)
.=
H1(
H2(
a,
X),
H2(
b,
X))
by A1
;
hence
(a + b) * x = (a * x) + (b * x)
by A5;
:: thesis: verum
end;
thus
for
a,
b being
Real for
x being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds
(a * b) * x = a * (b * x)
:: thesis: for x being VECTOR of RLSStruct(# ZS,O,F,G #) holds 1 * x = x
thus
for
x being
VECTOR of
RLSStruct(#
ZS,
O,
F,
G #) holds 1
* x = x
:: thesis: verum
end;
:: deftheorem Def5 defines Abelian RLVECT_1:def 5 :
:: deftheorem Def6 defines add-associative RLVECT_1:def 6 :
:: deftheorem Def7 defines right_zeroed RLVECT_1:def 7 :
:: deftheorem Def8 defines right_complementable RLVECT_1:def 8 :
:: deftheorem Def9 defines RealLinearSpace-like RLVECT_1:def 9 :
theorem :: RLVECT_1:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being non
empty RLSStruct st ( for
v,
w being
VECTOR of
V holds
v + w = w + v ) & ( for
u,
v,
w being
VECTOR of
V holds
(u + v) + w = u + (v + w) ) & ( for
v being
VECTOR of
V holds
v + (0. V) = v ) & ( for
v being
VECTOR of
V ex
w being
VECTOR of
V st
v + w = 0. V ) & ( for
a being
Real for
v,
w being
VECTOR of
V holds
a * (v + w) = (a * v) + (a * w) ) & ( for
a,
b being
Real for
v being
VECTOR of
V holds
(a + b) * v = (a * v) + (b * v) ) & ( for
a,
b being
Real for
v being
VECTOR of
V holds
(a * b) * v = a * (b * v) ) & ( for
v being
VECTOR of
V holds 1
* v = v ) holds
V is
RealLinearSpace by Def5, Def6, Def7, Def8, Def9;
Lm2:
for V being non empty add-associative right_zeroed right_complementable LoopStr
for v, w being Element of V st v + w = 0. V holds
w + v = 0. V
theorem :: RLVECT_1:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th10: :: RLVECT_1:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def10 defines - RLVECT_1:def 10 :
Lm3:
for V being non empty add-associative right_zeroed right_complementable LoopStr
for v, u being Element of V ex w being Element of V st v + w = u
:: deftheorem defines - RLVECT_1:def 11 :
theorem :: RLVECT_1:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th16: :: RLVECT_1:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th19: :: RLVECT_1:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: RLVECT_1:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: RLVECT_1:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: RLVECT_1:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: RLVECT_1:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: RLVECT_1:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: RLVECT_1:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: RLVECT_1:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: RLVECT_1:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: RLVECT_1:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th33: :: RLVECT_1:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: RLVECT_1:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th38: :: RLVECT_1:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th39: :: RLVECT_1:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm4:
for V being non empty add-associative right_zeroed right_complementable LoopStr
for u, w being Element of V holds - (u + w) = (- w) + (- u)
theorem Th41: :: RLVECT_1:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th44: :: RLVECT_1:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: RLVECT_1:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th49: :: RLVECT_1:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def12 defines Sum RLVECT_1:def 12 :
Lm5:
for V being non empty LoopStr holds Sum (<*> the carrier of V) = 0. V
Lm6:
for V being non empty LoopStr
for F being FinSequence of the carrier of V st len F = 0 holds
Sum F = 0. V
theorem :: RLVECT_1:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th54: :: RLVECT_1:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th55: :: RLVECT_1:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm7:
for j being natural number st j < 1 holds
j = 0
by NAT_1:39;
theorem Th58: :: RLVECT_1:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm8:
for V being non empty add-associative right_zeroed right_complementable LoopStr
for v being Element of V holds Sum <*v*> = v
theorem :: RLVECT_1:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th62: :: RLVECT_1:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th63: :: RLVECT_1:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:74 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:75 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:76 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:77 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th78: :: RLVECT_1:78 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th79: :: RLVECT_1:79 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:80 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:81 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:82 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:83 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th84: :: RLVECT_1:84 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th85: :: RLVECT_1:85 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th86: :: RLVECT_1:86 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th87: :: RLVECT_1:87 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:88 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: RLVECT_1:89 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:90 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:91 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:92 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:93 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:94 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:95 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:96 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: RLVECT_1:97 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines non-zero RLVECT_1:def 13 :