let T be non empty TopSpace; :: thesis: for FX being Subset-Family of T holds FX is_finer_than clf FX
let FX be Subset-Family of T; :: thesis: FX is_finer_than clf FX
set GX = clf FX;
for X being set st X in FX holds
ex Y being set st
( Y in clf FX & X c= Y )
proof
let X be set ; :: thesis: ( X in FX implies ex Y being set st
( Y in clf FX & X c= Y ) )

assume A1: X in FX ; :: thesis: ex Y being set st
( Y in clf FX & X c= Y )

then reconsider X = X as Subset of T ;
thus ex Y being set st
( Y in clf FX & X c= Y ) :: thesis: verum
proof
reconsider Y = Cl X as set ;
take Y ; :: thesis: ( Y in clf FX & X c= Y )
thus Y in clf FX by A1, Def2; :: thesis: X c= Y
thus X c= Y by PRE_TOPC:18; :: thesis: verum
end;
end;
hence FX is_finer_than clf FX by SETFAM_1:def 2; :: thesis: verum