let X be non empty finite set ; :: thesis: for F being Dependency-set of X
for K being Subset of X st F = { [A,B] where A, B is Subset of X : ( K c= A or B c= A ) } holds
{X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F
let F be Dependency-set of X; :: thesis: for K being Subset of X st F = { [A,B] where A, B is Subset of X : ( K c= A or B c= A ) } holds
{X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F
let K be Subset of X; :: thesis: ( F = { [A,B] where A, B is Subset of X : ( K c= A or B c= A ) } implies {X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F )
assume A1:
F = { [A,B] where A, B is Subset of X : ( K c= A or B c= A ) }
; :: thesis: {X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F
set BB = {X} \/ { B where B is Subset of X : not K c= B } ;
{X} \/ { B where B is Subset of X : not K c= B } c= bool X
then reconsider BB' = {X} \/ { B where B is Subset of X : not K c= B } as non empty Subset-Family of X ;
A4:
BB' is (B1)
by Th41;
A5:
BB' is (B2)
by Th41;
set G = { [a,b] where a, b is Subset of X : for c being set st c in BB' & a c= c holds
b c= c } ;
A6:
{ [a,b] where a, b is Subset of X : for c being set st c in BB' & a c= c holds
b c= c } = X deps_encl_by BB'
;
then
F = { [a,b] where a, b is Subset of X : for c being set st c in BB' & a c= c holds
b c= c }
by TARSKI:2;
hence
{X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F
by A4, A5, A6, Th37; :: thesis: verum