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