:: WAYBEL25 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem :: WAYBEL25:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: WAYBEL25:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th3: :: WAYBEL25:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th4: :: WAYBEL25:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: WAYBEL25:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th6: :: WAYBEL25:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def1 defines is_Retract_of WAYBEL25:def 1 :
theorem Th8: :: WAYBEL25:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: WAYBEL25:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let T be
TopStruct ;
func Omega T -> strict TopRelStr means :
Def2:
:: WAYBEL25:def 2
(
TopStruct(# the
carrier of
it,the
topology of
it #)
= TopStruct(# the
carrier of
T,the
topology of
T #) & ( for
x,
y being
Element of
it holds
(
x <= y iff ex
Y being
Subset of
T st
(
Y = {y} &
x in Cl Y ) ) ) );
existence
ex b1 being strict TopRelStr st
( TopStruct(# the carrier of b1,the topology of b1 #) = TopStruct(# the carrier of T,the topology of T #) & ( for x, y being Element of b1 holds
( x <= y iff ex Y being Subset of T st
( Y = {y} & x in Cl Y ) ) ) )
uniqueness
for b1, b2 being strict TopRelStr st TopStruct(# the carrier of b1,the topology of b1 #) = TopStruct(# the carrier of T,the topology of T #) & ( for x, y being Element of b1 holds
( x <= y iff ex Y being Subset of T st
( Y = {y} & x in Cl Y ) ) ) & TopStruct(# the carrier of b2,the topology of b2 #) = TopStruct(# the carrier of T,the topology of T #) & ( for x, y being Element of b2 holds
( x <= y iff ex Y being Subset of T st
( Y = {y} & x in Cl Y ) ) ) holds
b1 = b2
end;
:: deftheorem Def2 defines Omega WAYBEL25:def 2 :
Lm1:
for T being TopStruct holds the carrier of T = the carrier of (Omega T)
then Lm2:
for T being TopStruct
for a being set holds
( a is Subset of T iff a is Subset of (Omega T) )
;
Lm3:
for T being TopStruct
for x, y being Element of T
for X, Y being Subset of T st X = {x} & Y = {y} holds
( x in Cl Y iff Cl X c= Cl Y )
theorem Th13: :: WAYBEL25:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: WAYBEL25:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: WAYBEL25:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: WAYBEL25:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: WAYBEL25:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: WAYBEL25:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm4:
for S, T being non empty RelStr
for f being Function of S,S
for g being Function of T,T st RelStr(# the carrier of S,the InternalRel of S #) = RelStr(# the carrier of T,the InternalRel of T #) & f = g & f is projection holds
g is projection
theorem Th20: :: WAYBEL25:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: WAYBEL25:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th22: :: WAYBEL25:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: WAYBEL25:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm5:
now
let X,
Y be non
empty TopSpace;
:: thesis: for N being net of ContMaps X,(Omega Y) holds the mapping of N in Funcs the carrier of N,(Funcs the carrier of X,the carrier of Y)let N be
net of
ContMaps X,
(Omega Y);
:: thesis: the mapping of N in Funcs the carrier of N,(Funcs the carrier of X,the carrier of Y)A1:
the
mapping of
N in Funcs the
carrier of
N,the
carrier of
(ContMaps X,(Omega Y))
by FUNCT_2:11;
A2:
the
carrier of
Y = the
carrier of
(Omega Y)
by Lm1;
the
carrier of
(ContMaps X,(Omega Y)) c= Funcs the
carrier of
X,the
carrier of
Y
then
Funcs the
carrier of
N,the
carrier of
(ContMaps X,(Omega Y)) c= Funcs the
carrier of
N,
(Funcs the carrier of X,the carrier of Y)
by FUNCT_5:63;
hence
the
mapping of
N in Funcs the
carrier of
N,
(Funcs the carrier of X,the carrier of Y)
by A1;
:: thesis: verum
end;
definition
let I be non
empty set ;
let S,
T be non
empty RelStr ;
let N be
net of
T;
let i be
Element of
I;
assume A1:
the
carrier of
T c= the
carrier of
(S |^ I)
;
func commute N,
i,
S -> strict net of
S means :
Def3:
:: WAYBEL25:def 3
(
RelStr(# the
carrier of
it,the
InternalRel of
it #)
= RelStr(# the
carrier of
N,the
InternalRel of
N #) & the
mapping of
it = (commute the mapping of N) . i );
existence
ex b1 being strict net of S st
( RelStr(# the carrier of b1,the InternalRel of b1 #) = RelStr(# the carrier of N,the InternalRel of N #) & the mapping of b1 = (commute the mapping of N) . i )
uniqueness
for b1, b2 being strict net of S st RelStr(# the carrier of b1,the InternalRel of b1 #) = RelStr(# the carrier of N,the InternalRel of N #) & the mapping of b1 = (commute the mapping of N) . i & RelStr(# the carrier of b2,the InternalRel of b2 #) = RelStr(# the carrier of N,the InternalRel of N #) & the mapping of b2 = (commute the mapping of N) . i holds
b1 = b2
;
end;
:: deftheorem Def3 defines commute WAYBEL25:def 3 :
theorem Th24: :: WAYBEL25:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: WAYBEL25:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm6:
now
let X,
Y be non
empty TopSpace;
:: thesis: for N being net of ContMaps X,(Omega Y)
for i being Element of N holds
( the mapping of N . i is Function of X,(Omega Y) & the mapping of N . i is Function of X,Y )let N be
net of
ContMaps X,
(Omega Y);
:: thesis: for i being Element of N holds
( the mapping of N . i is Function of X,(Omega Y) & the mapping of N . i is Function of X,Y )let i be
Element of
N;
:: thesis: ( the mapping of N . i is Function of X,(Omega Y) & the mapping of N . i is Function of X,Y )thus
the
mapping of
N . i is
Function of
X,
(Omega Y)
by WAYBEL24:21;
:: thesis: the mapping of N . i is Function of X,Y
the
carrier of
Y = the
carrier of
(Omega Y)
by Lm1;
hence
the
mapping of
N . i is
Function of
X,
Y
by WAYBEL24:21;
:: thesis: verum
end;
Lm7:
now
let X,
Y be non
empty TopSpace;
:: thesis: for N being net of ContMaps X,(Omega Y)
for x being Point of X holds dom the mapping of N = dom the mapping of (commute N,x,(Omega Y))let N be
net of
ContMaps X,
(Omega Y);
:: thesis: for x being Point of X holds dom the mapping of N = dom the mapping of (commute N,x,(Omega Y))let x be
Point of
X;
:: thesis: dom the mapping of N = dom the mapping of (commute N,x,(Omega Y))
ContMaps X,
(Omega Y) is
SubRelStr of
(Omega Y) |^ the
carrier of
X
by WAYBEL24:def 3;
then
the
carrier of
(ContMaps X,(Omega Y)) c= the
carrier of
((Omega Y) |^ the carrier of X)
by YELLOW_0:def 13;
then A1:
RelStr(# the
carrier of
N,the
InternalRel of
N #)
= RelStr(# the
carrier of
(commute N,x,(Omega Y)),the
InternalRel of
(commute N,x,(Omega Y)) #)
by Def3;
thus dom the
mapping of
N =
the
carrier of
N
by FUNCT_2:def 1
.=
dom the
mapping of
(commute N,x,(Omega Y))
by A1, FUNCT_2:def 1
;
:: thesis: verum
end;
theorem Th26: :: WAYBEL25:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def4 defines monotone-convergence WAYBEL25:def 4 :
theorem Th27: :: WAYBEL25:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: WAYBEL25:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: WAYBEL25:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: WAYBEL25:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th32: :: WAYBEL25:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: WAYBEL25:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: WAYBEL25:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th36: :: WAYBEL25:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th37: :: WAYBEL25:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th39: :: WAYBEL25:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th40: :: WAYBEL25:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th41: :: WAYBEL25:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th42: :: WAYBEL25:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: WAYBEL25:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)