let T be TopSpace; :: thesis: (PSO T) /\ (D(alpha,ps) T) = T ^alpha
thus (PSO T) /\ (D(alpha,ps) T) c= T ^alpha :: according to XBOOLE_0:def 10 :: thesis: T ^alpha c= (PSO T) /\ (D(alpha,ps) T)

proof

let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in (PSO T) /\ (D(alpha,ps) T) or x in T ^alpha )
assume x in (PSO T) /\ (D(alpha,ps) T) ; :: thesis: x in T ^alpha
then A1: ( x in PSO T & x in D(alpha,ps) T ) by XBOOLE_0:def 4;
then consider A being Subset of T such that
A2: x = A and
A3: A is pre-semi-open ;
A4: A = psInt A by A3, Th5;
consider Z being Subset of T such that
A5: x = Z and
A6: alphaInt Z = psInt Z by A1;
Z is alpha-set of T by A2, A4, A5, A6, Th2;
hence x in T ^alpha by A5; :: thesis: verum

end;

let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in T ^alpha or x in (PSO T) /\ (D(alpha,ps) T) )
assume x in T ^alpha ; :: thesis: x in (PSO T) /\ (D(alpha,ps) T)
then consider K being Subset of T such that
A7: x = K and
A8: K is alpha-set of T ;
A9: K c= Int (Cl (Int K)) by A8, Def1;
Cl (Int K) c= Cl K by PRE_TOPC:49, TOPS_1:44;
then A10: Int (Cl (Int K)) c= Int (Cl K) by TOPS_1:48;
Int (Cl K) c= Cl (Int (Cl K)) by PRE_TOPC:48;
then Int (Cl (Int K)) c= Cl (Int (Cl K)) by A10, XBOOLE_1:1;
then K c= Cl (Int (Cl K)) by A9, XBOOLE_1:1;
then A11: K is pre-semi-open by Def4;
then A12: K = psInt K by Th5;
A13: K in PSO T by A11;
alphaInt K = psInt K by A8, A12, Th2;
then K in { B where B is Subset of T : alphaInt B = psInt B } ;
hence x in (PSO T) /\ (D(alpha,ps) T) by A7, A13, XBOOLE_0:def 4; :: thesis: verum