let Y be non empty set ; :: thesis: for G being Subset of (PARTITIONS Y)
for a, b being Element of Funcs Y,BOOLEAN
for PA being a_partition of Y holds 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) = (All ('not' a),PA,G) 'or' (All ('not' b),PA,G)
let G be Subset of (PARTITIONS Y); :: thesis: for a, b being Element of Funcs Y,BOOLEAN
for PA being a_partition of Y holds 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) = (All ('not' a),PA,G) 'or' (All ('not' b),PA,G)
let a, b be Element of Funcs Y,BOOLEAN ; :: thesis: for PA being a_partition of Y holds 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) = (All ('not' a),PA,G) 'or' (All ('not' b),PA,G)
let PA be a_partition of Y; :: thesis: 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) = (All ('not' a),PA,G) 'or' (All ('not' b),PA,G)
A1: All ('not' a),PA,G = B_INF ('not' a),(CompF PA,G) by BVFUNC_2:def 9;
A2: All ('not' b),PA,G = B_INF ('not' b),(CompF PA,G) by BVFUNC_2:def 9;
A3: Ex a,PA,G = B_SUP a,(CompF PA,G) by BVFUNC_2:def 10;
A4: Ex b,PA,G = B_SUP b,(CompF PA,G) by BVFUNC_2:def 10;
A5: 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) '<' (All ('not' a),PA,G) 'or' (All ('not' b),PA,G)

proof

let z be Element of Y; :: according to BVFUNC_1:def 15 :: thesis: ( not ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE or ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE )
assume ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE ; :: thesis: ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE
then 'not' (((Ex a,PA,G) '&' (Ex b,PA,G)) . z) = TRUE by MARGREL1:def 20;
then ((Ex a,PA,G) '&' (Ex b,PA,G)) . z = FALSE by MARGREL1:41;
then A6: ((Ex a,PA,G) . z) '&' ((Ex b,PA,G) . z) = FALSE by MARGREL1:def 21;

per cases ( (Ex a,PA,G) . z = FALSE or (Ex b,PA,G) . z = FALSE ) by A6, MARGREL1:45;

suppose A7: (Ex a,PA,G) . z = FALSE ; :: thesis: ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE

A8: now

let x be Element of Y; :: thesis: ( x in EqClass z,(CompF PA,G) implies ('not' a) . x = TRUE )
assume x in EqClass z,(CompF PA,G) ; :: thesis: ('not' a) . x = TRUE
then a . x <> TRUE by A3, A7, BVFUNC_1:def 20;
then a . x = FALSE by XBOOLEAN:def 3;
then 'not' (a . x) = TRUE by MARGREL1:41;
hence ('not' a) . x = TRUE by MARGREL1:def 20; :: thesis: verum

end;

thus ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = ((All ('not' a),PA,G) . z) 'or' ((All ('not' b),PA,G) . z) by BVFUNC_1:def 7
.= TRUE 'or' ((All ('not' b),PA,G) . z) by A1, A8, BVFUNC_1:def 19
.= TRUE by BINARITH:19 ; :: thesis: verum

end;

suppose A9: (Ex b,PA,G) . z = FALSE ; :: thesis: ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE

A10: now

let x be Element of Y; :: thesis: ( x in EqClass z,(CompF PA,G) implies ('not' b) . x = TRUE )
assume x in EqClass z,(CompF PA,G) ; :: thesis: ('not' b) . x = TRUE
then b . x <> TRUE by A4, A9, BVFUNC_1:def 20;
then b . x = FALSE by XBOOLEAN:def 3;
then 'not' (b . x) = TRUE by MARGREL1:41;
hence ('not' b) . x = TRUE by MARGREL1:def 20; :: thesis: verum

end;

thus ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = ((All ('not' a),PA,G) . z) 'or' ((All ('not' b),PA,G) . z) by BVFUNC_1:def 7
.= ((All ('not' a),PA,G) . z) 'or' TRUE by A2, A10, BVFUNC_1:def 19
.= TRUE by BINARITH:19 ; :: thesis: verum

end;

end;

end;

(All ('not' a),PA,G) 'or' (All ('not' b),PA,G) '<' 'not' ((Ex a,PA,G) '&' (Ex b,PA,G))

proof

let z be Element of Y; :: according to BVFUNC_1:def 15 :: thesis: ( not ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE or ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE )
assume ((All ('not' a),PA,G) 'or' (All ('not' b),PA,G)) . z = TRUE ; :: thesis: ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE
then A11: ((All ('not' a),PA,G) . z) 'or' ((All ('not' b),PA,G) . z) = TRUE by BVFUNC_1:def 7;
A12: ( (All ('not' b),PA,G) . z = TRUE or (All ('not' b),PA,G) . z = FALSE ) by XBOOLEAN:def 3;

per cases ( (All ('not' a),PA,G) . z = TRUE or (All ('not' b),PA,G) . z = TRUE ) by A11, A12, BINARITH:7;

suppose A13: (All ('not' a),PA,G) . z = TRUE ; :: thesis: ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE

A14: now

assume ex x being Element of Y st
( x in EqClass z,(CompF PA,G) & not ('not' a) . x = TRUE ) ; :: thesis: contradiction
then (B_INF ('not' a),(CompF PA,G)) . z = FALSE by BVFUNC_1:def 19;
then (All ('not' a),PA,G) . z = FALSE by BVFUNC_2:def 9;
hence contradiction by A13; :: thesis: verum

end;

A15: now

let x be Element of Y; :: thesis: ( x in EqClass z,(CompF PA,G) implies a . x <> TRUE )
assume x in EqClass z,(CompF PA,G) ; :: thesis: a . x <> TRUE
then ('not' a) . x = TRUE by A14;
then 'not' (a . x) = TRUE by MARGREL1:def 20;
hence a . x <> TRUE by MARGREL1:41; :: thesis: verum

end;

thus ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = 'not' (((Ex a,PA,G) '&' (Ex b,PA,G)) . z) by MARGREL1:def 20
.= 'not' (((Ex a,PA,G) . z) '&' ((Ex b,PA,G) . z)) by MARGREL1:def 21
.= 'not' (FALSE '&' ((Ex b,PA,G) . z)) by A3, A15, BVFUNC_1:def 20
.= 'not' FALSE by MARGREL1:45
.= TRUE by MARGREL1:41 ; :: thesis: verum

end;

suppose A16: (All ('not' b),PA,G) . z = TRUE ; :: thesis: ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = TRUE

A17: now

assume ex x being Element of Y st
( x in EqClass z,(CompF PA,G) & not ('not' b) . x = TRUE ) ; :: thesis: contradiction
then (B_INF ('not' b),(CompF PA,G)) . z = FALSE by BVFUNC_1:def 19;
then (All ('not' b),PA,G) . z = FALSE by BVFUNC_2:def 9;
hence contradiction by A16; :: thesis: verum

end;

A18: now

let x be Element of Y; :: thesis: ( x in EqClass z,(CompF PA,G) implies b . x <> TRUE )
assume x in EqClass z,(CompF PA,G) ; :: thesis: b . x <> TRUE
then ('not' b) . x = TRUE by A17;
then 'not' (b . x) = TRUE by MARGREL1:def 20;
hence b . x <> TRUE by MARGREL1:41; :: thesis: verum

end;

thus ('not' ((Ex a,PA,G) '&' (Ex b,PA,G))) . z = 'not' (((Ex a,PA,G) '&' (Ex b,PA,G)) . z) by MARGREL1:def 20
.= 'not' (((Ex a,PA,G) . z) '&' ((Ex b,PA,G) . z)) by MARGREL1:def 21
.= 'not' (((Ex a,PA,G) . z) '&' FALSE ) by A4, A18, BVFUNC_1:def 20
.= 'not' FALSE by MARGREL1:45
.= TRUE by MARGREL1:41 ; :: thesis: verum

end;

end;

end;

hence 'not' ((Ex a,PA,G) '&' (Ex b,PA,G)) = (All ('not' a),PA,G) 'or' (All ('not' b),PA,G) by A5, BVFUNC_1:18; :: thesis: verum