let X be set ; :: thesis: for B being Subset-Family of X
for F being Dependency-set of X holds X deps_encl_by B is full_family
let B be Subset-Family of X; :: thesis: for F being Dependency-set of X holds X deps_encl_by B is full_family
let F be Dependency-set of X; :: thesis: X deps_encl_by B is full_family
set F = X deps_encl_by B;
per cases
( not B is (C1) or B is (C1) )
;
suppose
B is
(C1)
;
:: thesis: X deps_encl_by B is full_family then reconsider B =
B as non
empty Subset-Family of
X ;
thus
X deps_encl_by B is
(F1)
:: according to ARMSTRNG:def 15 :: thesis: ( X deps_encl_by B is (F2) & X deps_encl_by B is (F3) & X deps_encl_by B is (F4) )hence
X deps_encl_by B is
(F2)
by Th20;
:: thesis: ( X deps_encl_by B is (F3) & X deps_encl_by B is (F4) )thus
X deps_encl_by B is
(F3)
:: thesis: X deps_encl_by B is (F4) proof
let a,
b,
a',
b' be
Subset of
X;
:: according to ARMSTRNG:def 13 :: thesis: ( [a,b] in X deps_encl_by B & [a,b] >= [a',b'] implies [a',b'] in X deps_encl_by B )
assume that A11:
[a,b] in X deps_encl_by B
and A12:
[a,b] >= [a',b']
;
:: thesis: [a',b'] in X deps_encl_by B
A13:
(
a c= a' &
b' c= b )
by A12, Th15;
hence
[a',b'] in X deps_encl_by B
;
:: thesis: verum
end; thus
X deps_encl_by B is
(F4)
:: thesis: verumproof
let a,
b,
a',
b' be
Subset of
X;
:: according to ARMSTRNG:def 14 :: thesis: ( [a,b] in X deps_encl_by B & [a',b'] in X deps_encl_by B implies [(a \/ a'),(b \/ b')] in X deps_encl_by B )
assume that A15:
[a,b] in X deps_encl_by B
and A16:
[a',b'] in X deps_encl_by B
;
:: thesis: [(a \/ a'),(b \/ b')] in X deps_encl_by B
hence
[(a \/ a'),(b \/ b')] in X deps_encl_by B
;
:: thesis: verum
end; end; end;