let X1, X2 be non empty set ; for cB1 being filter_base of X1
for cB2 being filter_base of X2
for cF1 being Filter of X1
for cF2 being Filter of X2
for Y being non empty TopSpace
for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let cB1 be filter_base of X1; for cB2 being filter_base of X2
for cF1 being Filter of X1
for cF2 being Filter of X2
for Y being non empty TopSpace
for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let cB2 be filter_base of X2; for cF1 being Filter of X1
for cF2 being Filter of X2
for Y being non empty TopSpace
for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let cF1 be Filter of X1; for cF2 being Filter of X2
for Y being non empty TopSpace
for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let cF2 be Filter of X2; for Y being non empty TopSpace
for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let Y be non empty TopSpace; for x being Point of Y
for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let x be Point of Y; for f being Function of [:X1,X2:],Y st x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 holds
for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let f be Function of [:X1,X2:],Y; ( x in lim_filter (f,<.cF1,cF2.)) & <.cB1.) = cF1 & <.cB2.) = cF2 implies for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U) )
assume that
A1:
x in lim_filter (f,<.cF1,cF2.))
and
A2:
<.cB1.) = cF1
and
A3:
<.cB2.) = cF2
; for U being a_neighborhood of x st U is closed holds
ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
let U be a_neighborhood of x; ( U is closed implies ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U) )
assume
U is closed
; ex B1 being Element of cB1 ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
then consider B1 being Element of cB1, B2 being Element of cB2 such that
A4:
f .: [:B1,B2:] c= Int U
by A1, A2, A3, Th75;
take
B1
; ex B2 being Element of cB2 st
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
take
B2
; for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
A5:
for y being Element of B1 holds f .: [:{y},B2:] c= Int U
A6:
for z being Element of B1
for y being Element of Y st y in lim_filter ((ProjMap1 (f,z)),cF2) holds
( filter_image ((ProjMap1 (f,z)),cF2) is proper Filter of (BoolePoset ([#] Y)) & Int U in filter_image ((ProjMap1 (f,z)),cF2) & y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y )
proof
let z be
Element of
B1;
for y being Element of Y st y in lim_filter ((ProjMap1 (f,z)),cF2) holds
( filter_image ((ProjMap1 (f,z)),cF2) is proper Filter of (BoolePoset ([#] Y)) & Int U in filter_image ((ProjMap1 (f,z)),cF2) & y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y )let y be
Element of
Y;
( y in lim_filter ((ProjMap1 (f,z)),cF2) implies ( filter_image ((ProjMap1 (f,z)),cF2) is proper Filter of (BoolePoset ([#] Y)) & Int U in filter_image ((ProjMap1 (f,z)),cF2) & y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y ) )
assume A7:
y in lim_filter (
(ProjMap1 (f,z)),
cF2)
;
( filter_image ((ProjMap1 (f,z)),cF2) is proper Filter of (BoolePoset ([#] Y)) & Int U in filter_image ((ProjMap1 (f,z)),cF2) & y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y )
filter_image (
(ProjMap1 (f,z)),
cF2) is
Filter of
[#] Y
by STRUCT_0:def 3;
hence
filter_image (
(ProjMap1 (f,z)),
cF2) is
proper Filter of
(BoolePoset ([#] Y))
by Th17;
( Int U in filter_image ((ProjMap1 (f,z)),cF2) & y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y )
A8:
(ProjMap1 (f,z)) " (Int U) is
Subset of
X2
A9:
for
z being
Element of
B1 holds
(ProjMap1 (f,z)) .: B2 c= Int U
proof
let z be
Element of
B1;
(ProjMap1 (f,z)) .: B2 c= Int Ulet t be
object ;
TARSKI:def 3 ( not t in (ProjMap1 (f,z)) .: B2 or t in Int U )
assume
t in (ProjMap1 (f,z)) .: B2
;
t in Int U
then consider u being
object such that
u in dom (ProjMap1 (f,z))
and A10:
u in B2
and A11:
t = (ProjMap1 (f,z)) . u
by FUNCT_1:def 6;
(ProjMap1 (f,z)) . u = f . (
z,
u)
by A10, MESFUNC9:def 6;
then A12:
t = f . [z,u]
by A11, BINOP_1:def 1;
then A13:
t in f .: [:{z},B2:]
by A12, FUNCT_1:def 6;
f .: [:{z},B2:] c= Int U
by A5;
hence
t in Int U
by A13;
verum
end;
thus
(
Int U in filter_image (
(ProjMap1 (f,z)),
cF2) &
y is_a_cluster_point_of filter_image (
(ProjMap1 (f,z)),
cF2),
Y )
verumproof
(ProjMap1 (f,z)) .: B2 c= Int U
by A9;
then
B2 c= (ProjMap1 (f,z)) " (Int U)
by FUNCT_2:95;
then
(ProjMap1 (f,z)) " (Int U) in cF2
by A3, A8, CARDFIL2:def 8;
hence
Int U in filter_image (
(ProjMap1 (f,z)),
cF2)
;
y is_a_cluster_point_of filter_image ((ProjMap1 (f,z)),cF2),Y
thus
y is_a_cluster_point_of filter_image (
(ProjMap1 (f,z)),
cF2),
Y
by A7, Th19;
verum
end;
end;
for z being Element of B1
for y being Element of Y st y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
proof
let z be
Element of
B1;
for y being Element of Y st y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)let y be
Element of
Y;
( y in lim_filter ((ProjMap1 (f,z)),cF2) implies y in Cl (Int U) )
assume
y in lim_filter (
(ProjMap1 (f,z)),
cF2)
;
y in Cl (Int U)
then
(
filter_image (
(ProjMap1 (f,z)),
cF2) is
proper Filter of
(BoolePoset ([#] Y)) &
Int U in filter_image (
(ProjMap1 (f,z)),
cF2) &
y is_a_cluster_point_of filter_image (
(ProjMap1 (f,z)),
cF2),
Y )
by A6;
hence
y in Cl (Int U)
by YELLOW19:25;
verum
end;
hence
for z being Element of X1
for y being Element of Y st z in B1 & y in lim_filter ((ProjMap1 (f,z)),cF2) holds
y in Cl (Int U)
; verum