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 )
defpred S1[ set ] means ( A in $1 & $1 is mutually-disjoint & $1 c= H );
consider K being set such that
A4:
for S being set holds
( S in K iff ( S in bool (bool Y) & S1[S] ) )
from XBOOLE_0:sch 1();
set k1 = {A};
A5:
A in {A}
by TARSKI:def 1;
A6:
{A} is mutually-disjoint
by Th10;
A7:
{A} c= H
by A3, ZFMISC_1:37;
{A} c= bool Y
by ZFMISC_1:37;
then A8:
{A} in K
by A4, A5, A6, A7;
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 ) )
then consider M being set such that
A24:
M in K
and
A25:
for Z being set st Z in K & Z <> M holds
not M c= Z
by A8, ORDERS_1:175;
A26:
M c= H
by A4, A24;
A27:
M is mutually-disjoint Subset-Family of Y
by A4, A24;
A28:
A in M
by A4, A24;
take
M
; :: thesis: ( M is Element of bool (bool Y) & M is a_partition of Y & A in M & M c= H )
thus
( M is Element of bool (bool Y) & M is a_partition of Y & A in M & M c= H )
by A1, A2, A26, A27, A28, A29, Th16; :: thesis: verum