let X be 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 } ;
set M = {[K,X]} \/ { [A,A] where A is Subset of X : not K c= A } ;
A2:
{[K,X]} \/ { [A,A] where A is Subset of X : not K c= A } = Maximal_wrt F
by A1, Th32;
A3:
[#] X = X
;
set ss = saturated-subsets F;
hence
{X} \/ { B where B is Subset of X : not K c= B } = saturated-subsets F
by TARSKI:2; :: thesis: verum