let S be non empty TopSpace; :: thesis: for T being non empty Hausdorff TopSpace
for f, g being continuous Function of S,T holds
( ( for X being Subset of S st X = { p where p is Point of S : f . p <> g . p } holds
X is open ) & ( for X being Subset of S st X = { p where p is Point of S : f . p = g . p } holds
X is closed ) )

let T be non empty Hausdorff TopSpace; :: thesis: for f, g being continuous Function of S,T holds
( ( for X being Subset of S st X = { p where p is Point of S : f . p <> g . p } holds
X is open ) & ( for X being Subset of S st X = { p where p is Point of S : f . p = g . p } holds
X is closed ) )

let f, g be continuous Function of S,T; :: thesis: ( ( for X being Subset of S st X = { p where p is Point of S : f . p <> g . p } holds
X is open ) & ( for X being Subset of S st X = { p where p is Point of S : f . p = g . p } holds
X is closed ) )

A1: [#] T <> {} ;
thus A2: for X being Subset of S st X = { p where p is Point of S : f . p <> g . p } holds
X is open :: thesis: for X being Subset of S st X = { p where p is Point of S : f . p = g . p } holds
X is closed
proof
let X be Subset of S; :: thesis: ( X = { p where p is Point of S : f . p <> g . p } implies X is open )
assume A3: X = { p where p is Point of S : f . p <> g . p } ; :: thesis: X is open
for x being set holds
( x in X iff ex Q being Subset of S st
( Q is open & Q c= X & x in Q ) )
proof
let x be set ; :: thesis: ( x in X iff ex Q being Subset of S st
( Q is open & Q c= X & x in Q ) )

hereby :: thesis: ( ex Q being Subset of S st
( Q is open & Q c= X & x in Q ) implies x in X )
assume x in X ; :: thesis: ex Q being Element of bool the carrier of S st
( Q is open & Q c= X & x in Q )

then consider p being Point of S such that
A4: ( x = p & f . p <> g . p ) by A3;
consider W, V being Subset of T such that
A5: ( W is open & V is open ) and
A6: ( f . p in W & g . p in V ) and
A7: W misses V by A4, PRE_TOPC:def 16;
take Q = (f " W) /\ (g " V); :: thesis: ( Q is open & Q c= X & x in Q )
( f " W is open & g " V is open ) by A1, A5, TOPS_2:55;
hence Q is open by TOPS_1:38; :: thesis: ( Q c= X & x in Q )
thus Q c= X :: thesis: x in Q
proof
let q be set ; :: according to TARSKI:def 3 :: thesis: ( not q in Q or q in X )
assume A8: q in Q ; :: thesis: q in X
then q in f " W by XBOOLE_0:def 4;
then consider yf being set such that
A9: ( [q,yf] in f & yf in W ) by RELAT_1:def 14;
q in g " V by A8, XBOOLE_0:def 4;
then consider yg being set such that
A10: ( [q,yg] in g & yg in V ) by RELAT_1:def 14;
A11: ( yf = f . q & yg = g . q ) by A9, A10, FUNCT_1:8;
not yg in W by A7, A10, XBOOLE_0:3;
hence q in X by A3, A8, A9, A11; :: thesis: verum
end;
dom f = the carrier of S by FUNCT_2:def 1;
then [x,(f . p)] in f by A4, FUNCT_1:def 4;
then A12: x in f " W by A6, RELAT_1:def 14;
dom g = the carrier of S by FUNCT_2:def 1;
then [x,(g . p)] in g by A4, FUNCT_1:def 4;
then x in g " V by A6, RELAT_1:def 14;
hence x in Q by A12, XBOOLE_0:def 4; :: thesis: verum
end;
given Q being Subset of S such that A13: ( Q is open & Q c= X & x in Q ) ; :: thesis: x in X
thus x in X by A13; :: thesis: verum
end;
hence X is open by TOPS_1:57; :: thesis: verum
end;
let X be Subset of S; :: thesis: ( X = { p where p is Point of S : f . p = g . p } implies X is closed )
assume A14: X = { p where p is Point of S : f . p = g . p } ; :: thesis: X is closed
{ p where p is Point of S : f . p <> g . p } c= the carrier of S
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in { p where p is Point of S : f . p <> g . p } or x in the carrier of S )
assume x in { p where p is Point of S : f . p <> g . p } ; :: thesis: x in the carrier of S
then consider a being Point of S such that
A15: ( x = a & f . a <> g . a ) ;
thus x in the carrier of S by A15; :: thesis: verum
end;
then reconsider A = { p where p is Point of S : f . p <> g . p } as Subset of S ;
A16: X ` = A
proof
hereby :: according to TARSKI:def 3,XBOOLE_0:def 10 :: thesis: A c= X `
let x be set ; :: thesis: ( x in X ` implies x in A )
assume A17: x in X ` ; :: thesis: x in A
then not x in X by XBOOLE_0:def 5;
then f . x <> g . x by A14, A17;
hence x in A by A17; :: thesis: verum
end;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in A or x in X ` )
assume x in A ; :: thesis: x in X `
then consider p being Point of S such that
A18: ( x = p & f . p <> g . p ) ;
now
assume p in { t where t is Point of S : f . t = g . t } ; :: thesis: contradiction
then consider t being Point of S such that
A19: ( p = t & f . t = g . t ) ;
thus contradiction by A18, A19; :: thesis: verum
end;
hence x in X ` by A14, A18, XBOOLE_0:def 5; :: thesis: verum
end;
A is open by A2;
hence X is closed by A16, TOPS_1:29; :: thesis: verum