:: ANALMETR semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
Lm1:
for V being RealLinearSpace
for v1, w, y, v2 being VECTOR of V
for b1, b2, c1, c2 being Real st v1 = (b1 * w) + (b2 * y) & v2 = (c1 * w) + (c2 * y) holds
( v1 + v2 = ((b1 + c1) * w) + ((b2 + c2) * y) & v1 - v2 = ((b1 - c1) * w) + ((b2 - c2) * y) )
Lm2:
for V being RealLinearSpace
for w, y being VECTOR of V holds (0 * w) + (0 * y) = 0. V
Lm3:
for V being RealLinearSpace
for v, w, y being VECTOR of V
for b1, b2, a being Real st v = (b1 * w) + (b2 * y) holds
a * v = ((a * b1) * w) + ((a * b2) * y)
:: deftheorem Def1 defines Gen ANALMETR:def 1 :
:: deftheorem Def2 defines are_Ort_wrt ANALMETR:def 2 :
Lm4:
for V being RealLinearSpace
for w, y being VECTOR of V
for a1, a2, b1, b2 being Real st Gen w,y & (a1 * w) + (a2 * y) = (b1 * w) + (b2 * y) holds
( a1 = b1 & a2 = b2 )
theorem :: ANALMETR:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th5: :: ANALMETR:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm5:
for V being RealLinearSpace
for w, y being VECTOR of V st Gen w,y holds
( w <> 0. V & y <> 0. V )
theorem :: ANALMETR:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th7: :: ANALMETR:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: ANALMETR:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: ANALMETR:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th10: :: ANALMETR:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th11: :: ANALMETR:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
u,
v,
w,
y being
VECTOR of
V for
a,
b being
Real st
u,
v are_Ort_wrt w,
y holds
(
a * u,
v are_Ort_wrt w,
y &
u,
b * v are_Ort_wrt w,
y )
theorem Th12: :: ANALMETR:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th13: :: ANALMETR:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y,
v,
u1,
u2 being
VECTOR of
V st
Gen w,
y &
v,
u1 are_Ort_wrt w,
y &
v,
u2 are_Ort_wrt w,
y &
v <> 0. V holds
ex
a,
b being
Real st
(
a * u1 = b * u2 & (
a <> 0 or
b <> 0 ) )
theorem Th14: :: ANALMETR:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y,
u,
v1,
v2 being
VECTOR of
V st
Gen w,
y &
u,
v1 are_Ort_wrt w,
y &
u,
v2 are_Ort_wrt w,
y holds
(
u,
v1 + v2 are_Ort_wrt w,
y &
u,
v1 - v2 are_Ort_wrt w,
y )
theorem Th15: :: ANALMETR:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: ANALMETR:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y,
u,
u1,
u2 being
VECTOR of
V st
Gen w,
y &
u,
u1 - u2 are_Ort_wrt w,
y &
u1,
u2 - u are_Ort_wrt w,
y holds
u2,
u - u1 are_Ort_wrt w,
y
theorem Th17: :: ANALMETR:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: ANALMETR:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: ANALMETR:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let V be
RealLinearSpace;
let u,
u1,
v,
v1,
w,
y be
VECTOR of
V;
pred u,
u1,
v,
v1 are_Ort_wrt w,
y means :
Def3:
:: ANALMETR:def 3
u1 - u,
v1 - v are_Ort_wrt w,
y;
end;
:: deftheorem Def3 defines are_Ort_wrt ANALMETR:def 3 :
for
V being
RealLinearSpace for
u,
u1,
v,
v1,
w,
y being
VECTOR of
V holds
(
u,
u1,
v,
v1 are_Ort_wrt w,
y iff
u1 - u,
v1 - v are_Ort_wrt w,
y );
definition
let V be
RealLinearSpace;
let w,
y be
VECTOR of
V;
func Orthogonality V,
w,
y -> Relation of
[:the carrier of V,the carrier of V:] means :
Def4:
:: ANALMETR:def 4
for
x,
z being
set holds
(
[x,z] in it iff ex
u,
u1,
v,
v1 being
VECTOR of
V st
(
x = [u,u1] &
z = [v,v1] &
u,
u1,
v,
v1 are_Ort_wrt w,
y ) );
existence
ex b1 being Relation of [:the carrier of V,the carrier of V:] st
for x, z being set holds
( [x,z] in b1 iff ex u, u1, v, v1 being VECTOR of V st
( x = [u,u1] & z = [v,v1] & u,u1,v,v1 are_Ort_wrt w,y ) )
uniqueness
for b1, b2 being Relation of [:the carrier of V,the carrier of V:] st ( for x, z being set holds
( [x,z] in b1 iff ex u, u1, v, v1 being VECTOR of V st
( x = [u,u1] & z = [v,v1] & u,u1,v,v1 are_Ort_wrt w,y ) ) ) & ( for x, z being set holds
( [x,z] in b2 iff ex u, u1, v, v1 being VECTOR of V st
( x = [u,u1] & z = [v,v1] & u,u1,v,v1 are_Ort_wrt w,y ) ) ) holds
b1 = b2
end;
:: deftheorem Def4 defines Orthogonality ANALMETR:def 4 :
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
b4 being
Relation of
[:the carrier of V,the carrier of V:] holds
(
b4 = Orthogonality V,
w,
y iff for
x,
z being
set holds
(
[x,z] in b4 iff ex
u,
u1,
v,
v1 being
VECTOR of
V st
(
x = [u,u1] &
z = [v,v1] &
u,
u1,
v,
v1 are_Ort_wrt w,
y ) ) );
theorem :: ANALMETR:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th22: :: ANALMETR:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: ANALMETR:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let POS be non
empty ParOrtStr ;
let a,
b,
c,
d be
Element of
POS;
pred a,
b // c,
d means :
Def5:
:: ANALMETR:def 5
[[a,b],[c,d]] in the
CONGR of
POS;
pred a,
b _|_ c,
d means :
Def6:
:: ANALMETR:def 6
[[a,b],[c,d]] in the
orthogonality of
POS;
end;
:: deftheorem Def5 defines // ANALMETR:def 5 :
:: deftheorem Def6 defines _|_ ANALMETR:def 6 :
definition
let V be
RealLinearSpace;
let w,
y be
VECTOR of
V;
func AMSpace V,
w,
y -> strict ParOrtStr equals :: ANALMETR:def 7
ParOrtStr(# the
carrier of
V,
(lambda (DirPar V)),
(Orthogonality V,w,y) #);
correctness
coherence
ParOrtStr(# the carrier of V,(lambda (DirPar V)),(Orthogonality V,w,y) #) is strict ParOrtStr ;
;
end;
:: deftheorem defines AMSpace ANALMETR:def 7 :
theorem :: ANALMETR:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines Af ANALMETR:def 8 :
theorem :: ANALMETR:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th30: :: ANALMETR:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: ANALMETR:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
u,
u1,
v,
v1,
w,
y being
VECTOR of
V for
p,
p1,
q,
q1 being
Element of
(AMSpace V,w,y) st
p = u &
p1 = u1 &
q = v &
q1 = v1 holds
(
p,
q _|_ p1,
q1 iff
u,
v,
u1,
v1 are_Ort_wrt w,
y )
theorem Th32: :: ANALMETR:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y,
u,
v,
u1,
v1 being
VECTOR of
V for
p,
q,
p1,
q1 being
Element of
(AMSpace V,w,y) st
p = u &
q = v &
p1 = u1 &
q1 = v1 holds
(
p,
q // p1,
q1 iff ex
a,
b being
Real st
(
a * (v - u) = b * (v1 - u1) & (
a <> 0 or
b <> 0 ) ) )
theorem Th33: :: ANALMETR:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
q,
p1,
q1 being
Element of
(AMSpace V,w,y) st
p,
q _|_ p1,
q1 holds
p1,
q1 _|_ p,
q
theorem Th34: :: ANALMETR:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
q,
p1,
q1 being
Element of
(AMSpace V,w,y) st
p,
q _|_ p1,
q1 holds
p,
q _|_ q1,
p1
theorem Th35: :: ANALMETR:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: ANALMETR:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
p1,
q,
q1,
r,
r1 being
Element of
(AMSpace V,w,y) st
p,
p1 _|_ q,
q1 &
p,
p1 // r,
r1 & not
p = p1 holds
q,
q1 _|_ r,
r1
theorem Th37: :: ANALMETR:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V st
Gen w,
y holds
for
p,
q,
r being
Element of
(AMSpace V,w,y) ex
r1 being
Element of
(AMSpace V,w,y) st
(
p,
q _|_ r,
r1 &
r <> r1 )
theorem Th38: :: ANALMETR:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
p1,
q,
q1,
r,
r1 being
Element of
(AMSpace V,w,y) st
Gen w,
y &
p,
p1 _|_ q,
q1 &
p,
p1 _|_ r,
r1 & not
p = p1 holds
q,
q1 // r,
r1
theorem Th39: :: ANALMETR:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
q,
r,
r1,
r2 being
Element of
(AMSpace V,w,y) st
Gen w,
y &
p,
q _|_ r,
r1 &
p,
q _|_ r,
r2 holds
p,
q _|_ r1,
r2
theorem Th40: :: ANALMETR:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
q,
p1,
p2 being
Element of
(AMSpace V,w,y) st
Gen w,
y &
p,
q _|_ p1,
p2 &
p1,
q _|_ p2,
p holds
p2,
q _|_ p,
p1
theorem Th42: :: ANALMETR:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
V being
RealLinearSpace for
w,
y being
VECTOR of
V for
p,
p1 being
Element of
(AMSpace V,w,y) st
Gen w,
y &
p <> p1 holds
for
q being
Element of
(AMSpace V,w,y) ex
q1 being
Element of
(AMSpace V,w,y) st
(
p,
p1 // p,
q1 &
p,
p1 _|_ q1,
q )
consider V0 being RealLinearSpace such that
Lm6:
ex w, y being VECTOR of V0 st Gen w,y
by Th7;
consider w0, y0 being VECTOR of V0 such that
Lm7:
Gen w0,y0
by Lm6;
Lm8:
now
set X =
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #);
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #)
= Af (AMSpace V0,w0,y0)
;
then A1:
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #)
= Lambda (OASpace V0)
by Th30;
for
a,
b being
Real st
(a * w0) + (b * y0) = 0. V0 holds
(
a = 0 &
b = 0 )
by Def1, Lm7;
then
OASpace V0 is
OAffinSpace
by ANALOAF:38;
hence
(
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #) is
AffinSpace & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
(AMSpace V0,w0,y0) holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ p,
s implies
a,
b _|_ q,
s ) ) ) & ( for
a,
b,
c being
Element of
(AMSpace V0,w0,y0) st
a <> b holds
ex
x being
Element of
(AMSpace V0,w0,y0) st
(
a,
b // a,
x &
a,
b _|_ x,
c ) ) & ( for
a,
b,
c being
Element of
(AMSpace V0,w0,y0) ex
x being
Element of
(AMSpace V0,w0,y0) st
(
a,
b _|_ c,
x &
c <> x ) ) )
by A1, Lm7, Th33, Th34, Th35, Th36, Th37, Th39, Th40, Th42, DIRAF:48;
:: thesis: verum
end;
definition
let IT be non
empty ParOrtStr ;
attr IT is
OrtAfSp-like means :
Def9:
:: ANALMETR:def 9
(
AffinStruct(# the
carrier of
IT,the
CONGR of
IT #) is
AffinSpace & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
IT holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ p,
s implies
a,
b _|_ q,
s ) ) ) & ( for
a,
b,
c being
Element of
IT st
a <> b holds
ex
x being
Element of
IT st
(
a,
b // a,
x &
a,
b _|_ x,
c ) ) & ( for
a,
b,
c being
Element of
IT ex
x being
Element of
IT st
(
a,
b _|_ c,
x &
c <> x ) ) );
end;
:: deftheorem Def9 defines OrtAfSp-like ANALMETR:def 9 :
for
IT being non
empty ParOrtStr holds
(
IT is
OrtAfSp-like iff (
AffinStruct(# the
carrier of
IT,the
CONGR of
IT #) is
AffinSpace & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
IT holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ p,
s implies
a,
b _|_ q,
s ) ) ) & ( for
a,
b,
c being
Element of
IT st
a <> b holds
ex
x being
Element of
IT st
(
a,
b // a,
x &
a,
b _|_ x,
c ) ) & ( for
a,
b,
c being
Element of
IT ex
x being
Element of
IT st
(
a,
b _|_ c,
x &
c <> x ) ) ) );
theorem :: ANALMETR:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
consider V0 being RealLinearSpace such that
Lm9:
ex w, y being VECTOR of V0 st Gen w,y
by Th7;
consider w0, y0 being VECTOR of V0 such that
Lm10:
Gen w0,y0
by Lm9;
Lm11:
now
set X =
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #);
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #)
= Af (AMSpace V0,w0,y0)
;
then A1:
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #)
= Lambda (OASpace V0)
by Th30;
( ( for
a,
b being
Real st
(a * w0) + (b * y0) = 0. V0 holds
(
a = 0 &
b = 0 ) ) & ( for
w1 being
VECTOR of
V0 ex
a,
b being
Real st
w1 = (a * w0) + (b * y0) ) )
by Def1, Lm10;
then
OASpace V0 is
OAffinPlane
by ANALOAF:51;
hence
(
AffinStruct(# the
carrier of
(AMSpace V0,w0,y0),the
CONGR of
(AMSpace V0,w0,y0) #) is
AffinPlane & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
(AMSpace V0,w0,y0) holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ r,
s & not
p,
q // r,
s implies
a = b ) ) ) & ( for
a,
b,
c being
Element of
(AMSpace V0,w0,y0) ex
x being
Element of
(AMSpace V0,w0,y0) st
(
a,
b _|_ c,
x &
c <> x ) ) )
by A1, Lm10, Th33, Th34, Th35, Th36, Th37, Th38, Th40, DIRAF:53;
:: thesis: verum
end;
definition
let IT be non
empty ParOrtStr ;
attr IT is
OrtAfPl-like means :
Def10:
:: ANALMETR:def 10
(
AffinStruct(# the
carrier of
IT,the
CONGR of
IT #) is
AffinPlane & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
IT holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ r,
s & not
p,
q // r,
s implies
a = b ) ) ) & ( for
a,
b,
c being
Element of
IT ex
x being
Element of
IT st
(
a,
b _|_ c,
x &
c <> x ) ) );
end;
:: deftheorem Def10 defines OrtAfPl-like ANALMETR:def 10 :
for
IT being non
empty ParOrtStr holds
(
IT is
OrtAfPl-like iff (
AffinStruct(# the
carrier of
IT,the
CONGR of
IT #) is
AffinPlane & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
IT holds
( (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ r,
s & not
p,
q // r,
s implies
a = b ) ) ) & ( for
a,
b,
c being
Element of
IT ex
x being
Element of
IT st
(
a,
b _|_ c,
x &
c <> x ) ) ) );
theorem :: ANALMETR:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: ANALMETR:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being non
empty ParOrtStr for
a,
b,
c,
d being
Element of
POS for
a',
b',
c',
d' being
Element of
(Af POS) st
a = a' &
b = b' &
c = c' &
d = d' holds
(
a,
b // c,
d iff
a',
b' // c',
d' )
Lm12:
for POS being OrtAfSp holds Af POS is AffinSpace
by Def9;
Lm13:
for POS being OrtAfPl holds Af POS is AffinPlane
by Def10;
theorem Th49: :: ANALMETR:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being non
empty ParOrtStr holds
(
POS is
OrtAfPl-like iff ( ex
a,
b being
Element of
POS st
a <> b & ( for
a,
b,
c,
d,
p,
q,
r,
s being
Element of
POS holds
(
a,
b // b,
a &
a,
b // c,
c & (
a,
b // p,
q &
a,
b // r,
s & not
p,
q // r,
s implies
a = b ) & (
a,
b // a,
c implies
b,
a // b,
c ) & ex
x being
Element of
POS st
(
a,
b // c,
x &
a,
c // b,
x ) & not for
x,
y,
z being
Element of
POS holds
x,
y // x,
z & ex
x being
Element of
POS st
(
a,
b // c,
x &
c <> x ) & (
a,
b // b,
d &
b <> a implies ex
x being
Element of
POS st
(
c,
b // b,
x &
c,
a // d,
x ) ) & (
a,
b _|_ a,
b implies
a = b ) &
a,
b _|_ c,
c & (
a,
b _|_ c,
d implies (
a,
b _|_ d,
c &
c,
d _|_ a,
b ) ) & (
a,
b _|_ p,
q &
a,
b // r,
s & not
p,
q _|_ r,
s implies
a = b ) & (
a,
b _|_ p,
q &
a,
b _|_ r,
s & not
p,
q // r,
s implies
a = b ) & ex
x being
Element of
POS st
(
a,
b _|_ c,
x &
c <> x ) & ( not
a,
b // c,
d implies ex
x being
Element of
POS st
(
a,
b // a,
x &
c,
d // c,
x ) ) ) ) ) )
:: deftheorem Def11 defines LIN ANALMETR:def 11 :
definition
let POS be non
empty ParOrtStr ;
let a,
b be
Element of
POS;
func Line a,
b -> Subset of
POS means :
Def12:
:: ANALMETR:def 12
for
x being
Element of
POS holds
(
x in it iff
LIN a,
b,
x );
existence
ex b1 being Subset of POS st
for x being Element of POS holds
( x in b1 iff LIN a,b,x )
uniqueness
for b1, b2 being Subset of POS st ( for x being Element of POS holds
( x in b1 iff LIN a,b,x ) ) & ( for x being Element of POS holds
( x in b2 iff LIN a,b,x ) ) holds
b1 = b2
end;
:: deftheorem Def12 defines Line ANALMETR:def 12 :
:: deftheorem Def13 defines being_line ANALMETR:def 13 :
theorem :: ANALMETR:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th55: :: ANALMETR:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
a,
b,
c being
Element of
POS for
a',
b',
c' being
Element of
(Af POS) st
a = a' &
b = b' &
c = c' holds
(
LIN a,
b,
c iff
LIN a',
b',
c' )
theorem Th56: :: ANALMETR:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: ANALMETR:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def14 defines _|_ ANALMETR:def 14 :
:: deftheorem Def15 defines _|_ ANALMETR:def 15 :
:: deftheorem Def16 defines // ANALMETR:def 16 :
theorem :: ANALMETR:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: ANALMETR:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th62: :: ANALMETR:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th63: :: ANALMETR:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th64: :: ANALMETR:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
M,
N being
Subset of
POS for
M',
N' being
Subset of
(Af POS) st
M = M' &
N = N' holds
(
M // N iff
M' // N' )
theorem :: ANALMETR:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:66 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:67 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th68: :: ANALMETR:68 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th69: :: ANALMETR:69 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th70: :: ANALMETR:70 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th71: :: ANALMETR:71 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th72: :: ANALMETR:72 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th73: :: ANALMETR:73 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th74: :: ANALMETR:74 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:75 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th76: :: ANALMETR:76 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:77 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th78: :: ANALMETR:78 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:79 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th80: :: ANALMETR:80 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
b,
c,
a being
Element of
POS holds
(
b,
c _|_ a,
a &
a,
a _|_ b,
c &
b,
c // a,
a &
a,
a // b,
c )
theorem Th81: :: ANALMETR:81 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
a,
b,
c,
d being
Element of
POS st
a,
b // c,
d holds
(
a,
b // d,
c &
b,
a // c,
d &
b,
a // d,
c &
c,
d // a,
b &
c,
d // b,
a &
d,
c // a,
b &
d,
c // b,
a )
theorem :: ANALMETR:82 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
p,
q,
a,
b,
c,
d being
Element of
POS st
p <> q & ( (
p,
q // a,
b &
p,
q // c,
d ) or (
p,
q // a,
b &
c,
d // p,
q ) or (
a,
b // p,
q &
c,
d // p,
q ) or (
a,
b // p,
q &
p,
q // c,
d ) ) holds
a,
b // c,
d
theorem Th83: :: ANALMETR:83 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
a,
b,
c,
d being
Element of
POS st
a,
b _|_ c,
d holds
(
a,
b _|_ d,
c &
b,
a _|_ c,
d &
b,
a _|_ d,
c &
c,
d _|_ a,
b &
c,
d _|_ b,
a &
d,
c _|_ a,
b &
d,
c _|_ b,
a )
theorem Th84: :: ANALMETR:84 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfSp for
p,
q,
a,
b,
c,
d being
Element of
POS st
p <> q & ( (
p,
q // a,
b &
p,
q _|_ c,
d ) or (
p,
q // c,
d &
p,
q _|_ a,
b ) or (
p,
q // a,
b &
c,
d _|_ p,
q ) or (
p,
q // c,
d &
a,
b _|_ p,
q ) or (
a,
b // p,
q &
c,
d _|_ p,
q ) or (
c,
d // p,
q &
a,
b _|_ p,
q ) or (
a,
b // p,
q &
p,
q _|_ c,
d ) or (
c,
d // p,
q &
p,
q _|_ a,
b ) ) holds
a,
b _|_ c,
d
theorem Th85: :: ANALMETR:85 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
POS being
OrtAfPl for
p,
q,
a,
b,
c,
d being
Element of
POS st
p <> q & ( (
p,
q _|_ a,
b &
p,
q _|_ c,
d ) or (
p,
q _|_ a,
b &
c,
d _|_ p,
q ) or (
a,
b _|_ p,
q &
c,
d _|_ p,
q ) or (
a,
b _|_ p,
q &
p,
q _|_ c,
d ) ) holds
a,
b // c,
d
theorem :: ANALMETR:86 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:87 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th88: :: ANALMETR:88 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th89: :: ANALMETR:89 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:90 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th91: :: ANALMETR:91 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: ANALMETR:92 :: Showing IDV graph ... (Click the Palm Tree again to close it)