set P = { X where X is Subset of : ex x being Element of E st X = the_orbit_of x,T } ;
now
let x be set ; :: thesis: ( x in { X where X is Subset of : ex x being Element of E st X = the_orbit_of x,T } implies x in bool E )
assume x in { X where X is Subset of : ex x being Element of E st X = the_orbit_of x,T } ; :: thesis: x in bool E
then ex X being Subset of st
( x = X & ex x being Element of E st X = the_orbit_of x,T ) ;
hence x in bool E ; :: thesis: verum
end;
then reconsider P = { X where X is Subset of : ex x being Element of E st X = the_orbit_of x,T } as Subset-Family of by TARSKI:def 3;
for x being set holds
( x in E iff ex Y being set st
( x in Y & Y in P ) )
proof
let x be set ; :: thesis: ( x in E iff ex Y being set st
( x in Y & Y in P ) )

hereby :: thesis: ( ex Y being set st
( x in Y & Y in P ) implies x in E )
assume x in E ; :: thesis: ex Y being set st
( x in Y & Y in P )

then reconsider x' = x as Element of E ;
reconsider Y = the_orbit_of x',T as set ;
take Y = Y; :: thesis: ( x in Y & Y in P )
x',x' are_conjugated_under T by Th4;
hence x in Y ; :: thesis: Y in P
thus Y in P ; :: thesis: verum
end;
given Y being set such that A1: ( x in Y & Y in P ) ; :: thesis: x in E
thus x in E by A1; :: thesis: verum
end;
then A2: union P = E by TARSKI:def 4;
for A being Subset of st A in P holds
( A <> {} & ( for B being Subset of holds
( not B in P or A = B or A misses B ) ) )
proof
let A be Subset of ; :: thesis: ( A in P implies ( A <> {} & ( for B being Subset of holds
( not B in P or A = B or A misses B ) ) ) )

assume A in P ; :: thesis: ( A <> {} & ( for B being Subset of holds
( not B in P or A = B or A misses B ) ) )

then A3: ex X being Subset of st
( A = X & ex x' being Element of E st X = the_orbit_of x',T ) ;
hence A <> {} by Th7; :: thesis: for B being Subset of holds
( not B in P or A = B or A misses B )

let B be Subset of ; :: thesis: ( not B in P or A = B or A misses B )
assume B in P ; :: thesis: ( A = B or A misses B )
then A4: ex X being Subset of st
( B = X & ex x' being Element of E st X = the_orbit_of x',T ) ;
assume not A = B ; :: thesis: A misses B
hence A misses B by A3, A4, Th8; :: thesis: verum
end;
hence { X where X is Subset of : ex x being Element of E st X = the_orbit_of x,T } is a_partition of E by A2, EQREL_1:def 6; :: thesis: verum