let Y be set ; :: thesis: for H being covering T_3 Hierarchy of Y st H is lower-bounded & not {} in H holds
for A being Subset of Y st A in H holds
ex P being a_partition of Y st
( A in P & P c= H )

let H be covering T_3 Hierarchy of Y; :: thesis: ( H is lower-bounded & not {} in H implies for A being Subset of Y st A in H holds
ex P being a_partition of Y st
( A in P & P c= H ) )

assume that
A1: H is lower-bounded and
A2: not {} in H ; :: thesis: for A being Subset of Y st A in H holds
ex P being a_partition of Y st
( A in P & P c= H )

let A be Subset of Y; :: thesis: ( A in H implies ex P being a_partition of Y st
( A in P & P c= H ) )

assume A3: A in H ; :: thesis: ex P being a_partition of Y st
( A in P & P c= H )

set k1 = {A};
A4: {A} c= H by A3, ZFMISC_1:31;
A5: A in {A} by TARSKI:def 1;
A6: {A} c= bool Y by ZFMISC_1:31;
defpred S1[ set ] means ( A in $1 & $1 is mutually-disjoint & $1 c= H );
consider K being set such that
A7: for S being set holds
( S in K iff ( S in bool (bool Y) & S1[S] ) ) from XBOOLE_0:sch 1();
{A} is mutually-disjoint by Th10;
then A8: {A} in K by A7, A5, A4, A6;
for Z being set st Z c= K & Z is c=-linear holds
ex X3 being set st
( X3 in K & ( for X1 being set st X1 in Z holds
X1 c= X3 ) )
proof
let Z be set ; :: thesis: ( Z c= K & Z is c=-linear implies ex X3 being set st
( X3 in K & ( for X1 being set st X1 in Z holds
X1 c= X3 ) ) )

assume that
A9: Z c= K and
A10: Z is c=-linear ; :: thesis: ex X3 being set st
( X3 in K & ( for X1 being set st X1 in Z holds
X1 c= X3 ) )

A11: now
let X1, X2 be set ; :: thesis: ( X1 in Z & X2 in Z & not X1 c= X2 implies X2 c= X1 )
assume that
A12: X1 in Z and
A13: X2 in Z ; :: thesis: ( X1 c= X2 or X2 c= X1 )
X1,X2 are_c=-comparable by A10, A12, A13, ORDINAL1:def 8;
hence ( X1 c= X2 or X2 c= X1 ) by XBOOLE_0:def 9; :: thesis: verum
end;
per cases ( Z <> {} or Z = {} ) ;
suppose A14: Z <> {} ; :: thesis: ex X3 being set st
( X3 in K & ( for X1 being set st X1 in Z holds
X1 c= X3 ) )

set X3 = union Z;
take union Z ; :: thesis: ( union Z in K & ( for X1 being set st X1 in Z holds
X1 c= union Z ) )

now
consider z being set such that
A15: z in Z by A14, XBOOLE_0:def 1;
A in z by A7, A9, A15;
hence A in union Z by A15, TARSKI:def 4; :: thesis: ( union Z in bool (bool Y) & union Z is mutually-disjoint & union Z c= H )
A16: for a being set st a in Z holds
a c= H by A7, A9;
then union Z c= H by ZFMISC_1:76;
then union Z c= bool Y by XBOOLE_1:1;
hence union Z in bool (bool Y) ; :: thesis: ( union Z is mutually-disjoint & union Z c= H )
thus union Z is mutually-disjoint :: thesis: union Z c= H
proof
let t1, t2 be set ; :: according to TAXONOM2:def 5 :: thesis: ( t1 in union Z & t2 in union Z & t1 <> t2 implies t1 misses t2 )
assume that
A17: t1 in union Z and
A18: t2 in union Z and
A19: t1 <> t2 ; :: thesis: t1 misses t2
consider v1 being set such that
A20: t1 in v1 and
A21: v1 in Z by A17, TARSKI:def 4;
A22: v1 is mutually-disjoint by A7, A9, A21;
consider v2 being set such that
A23: t2 in v2 and
A24: v2 in Z by A18, TARSKI:def 4;
A25: v2 is mutually-disjoint by A7, A9, A24;
per cases ( v1 c= v2 or v2 c= v1 ) by A11, A21, A24;
end;
end;
thus union Z c= H by A16, ZFMISC_1:76; :: thesis: verum
end;
hence union Z in K by A7; :: thesis: for X1 being set st X1 in Z holds
X1 c= union Z

thus for X1 being set st X1 in Z holds
X1 c= union Z by ZFMISC_1:74; :: thesis: verum
end;
suppose A26: Z = {} ; :: thesis: ex X3 being set st
( X3 in K & ( for X1 being set st X1 in Z holds
X1 c= X3 ) )

consider a being set such that
A27: a in K by A8;
take a ; :: thesis: ( a in K & ( for X1 being set st X1 in Z holds
X1 c= a ) )

thus a in K by A27; :: thesis: for X1 being set st X1 in Z holds
X1 c= a

thus for X1 being set st X1 in Z holds
X1 c= a by A26; :: thesis: verum
end;
end;
end;
then consider M being set such that
A28: M in K and
A29: for Z being set st Z in K & Z <> M holds
not M c= Z by A8, ORDERS_1:65;
A30: M is mutually-disjoint Subset-Family of Y by A7, A28;
A31: now
let C be mutually-disjoint Subset-Family of Y; :: thesis: ( A in C & C c= H & M c= C implies M = C )
assume that
A32: A in C and
A33: C c= H and
A34: M c= C ; :: thesis: M = C
C in K by A7, A32, A33;
hence M = C by A29, A34; :: thesis: verum
end;
A35: A in M by A7, A28;
take M ; :: thesis: ( M is Element of bool (bool Y) & M is a_partition of Y & A in M & M c= H )
M c= H by A7, A28;
hence ( M is Element of bool (bool Y) & M is a_partition of Y & A in M & M c= H ) by A1, A2, A30, A35, A31, Th16; :: thesis: verum