thus ( A is T_0 implies for a, b being Point of X st a in A & b in A & a <> b holds
MaxADSet a misses MaxADSet b ) :: thesis: ( ( for a, b being Point of X st a in A & b in A & a <> b holds
MaxADSet a misses MaxADSet b ) implies A is T_0 )
proof
assume A1: A is T_0 ; :: thesis: for a, b being Point of X st a in A & b in A & a <> b holds
MaxADSet a misses MaxADSet b

let a, b be Point of X; :: thesis: ( a in A & b in A & a <> b implies MaxADSet a misses MaxADSet b )
assume that
A2: a in A and
A3: b in A ; :: thesis: ( not a <> b or MaxADSet a misses MaxADSet b )
assume A4: a <> b ; :: thesis: MaxADSet a misses MaxADSet b
now :: thesis: ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) )
per cases ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )
by A1, A2, A3, A4, TSP_1:def 8;
suppose ex V being Subset of X st
( V is open & a in V & not b in V ) ; :: thesis: ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) )

then consider V being Subset of X such that
A5: V is open and
A6: a in V and
A7: not b in V ;
now :: thesis: ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b )
end;
hence ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) ) ; :: thesis: verum
end;
suppose ex W being Subset of X st
( W is open & not a in W & b in W ) ; :: thesis: ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) )

then consider W being Subset of X such that
A8: W is open and
A9: not a in W and
A10: b in W ;
now :: thesis: ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W )
end;
hence ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) ) ; :: thesis: verum
end;
end;
end;
hence MaxADSet a misses MaxADSet b by TEX_4:53; :: thesis: verum
end;
assume A11: for a, b being Point of X st a in A & b in A & a <> b holds
MaxADSet a misses MaxADSet b ; :: thesis: A is T_0
now :: thesis: for a, b being Point of X st a in A & b in A & a <> b & ( for V being Subset of X holds
( not V is open or not a in V or b in V ) ) holds
ex W being Subset of X st
( W is open & not a in W & b in W )
let a, b be Point of X; :: thesis: ( a in A & b in A & a <> b & ( for V being Subset of X holds
( not V is open or not a in V or b in V ) ) implies ex W being Subset of X st
( W is open & not a in W & b in W ) )

assume that
A12: a in A and
A13: b in A ; :: thesis: ( not a <> b or ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )

assume a <> b ; :: thesis: ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )

then A14: MaxADSet a misses MaxADSet b by A11, A12, A13;
now :: thesis: ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )
per cases ( ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) or ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) )
by A14, TEX_4:53;
suppose ex V being Subset of X st
( V is open & MaxADSet a c= V & V misses MaxADSet b ) ; :: thesis: ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )

then consider V being Subset of X such that
A15: V is open and
A16: MaxADSet a c= V and
A17: V misses MaxADSet b ;
now :: thesis: ex V being Subset of X st
( V is open & a in V & not b in V )
take V = V; :: thesis: ( V is open & a in V & not b in V )
thus V is open by A15; :: thesis: ( a in V & not b in V )
{a} c= MaxADSet a by TEX_4:18;
then a in MaxADSet a by ZFMISC_1:31;
hence a in V by A16; :: thesis: not b in V
hence not b in V ; :: thesis: verum
end;
hence ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) ) ; :: thesis: verum
end;
suppose ex W being Subset of X st
( W is open & W misses MaxADSet a & MaxADSet b c= W ) ; :: thesis: ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) )

then consider W being Subset of X such that
A19: W is open and
A20: W misses MaxADSet a and
A21: MaxADSet b c= W ;
now :: thesis: ex W being Subset of X st
( W is open & not a in W & b in W )
take W = W; :: thesis: ( W is open & not a in W & b in W )
thus W is open by A19; :: thesis: ( not a in W & b in W )
hence not a in W ; :: thesis: b in W
{b} c= MaxADSet b by TEX_4:18;
then b in MaxADSet b by ZFMISC_1:31;
hence b in W by A21; :: thesis: verum
end;
hence ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) ) ; :: thesis: verum
end;
end;
end;
hence ( ex V being Subset of X st
( V is open & a in V & not b in V ) or ex W being Subset of X st
( W is open & not a in W & b in W ) ) ; :: thesis: verum
end;
hence A is T_0 by TSP_1:def 8; :: thesis: verum