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 (Ex a,PA,G) '&' (All (a 'imp' b),PA,G) '<' Ex (a '&' 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 (Ex a,PA,G) '&' (All (a 'imp' b),PA,G) '<' Ex (a '&' b),PA,G
let a, b be Element of Funcs Y,BOOLEAN ; :: thesis: for PA being a_partition of Y holds (Ex a,PA,G) '&' (All (a 'imp' b),PA,G) '<' Ex (a '&' b),PA,G
let PA be a_partition of Y; :: thesis: (Ex a,PA,G) '&' (All (a 'imp' b),PA,G) '<' Ex (a '&' b),PA,G
let z be Element of Y; :: according to BVFUNC_1:def 15 :: thesis: ( not ((Ex a,PA,G) '&' (All (a 'imp' b),PA,G)) . z = TRUE or (Ex (a '&' b),PA,G) . z = TRUE )
assume
((Ex a,PA,G) '&' (All (a 'imp' b),PA,G)) . z = TRUE
; :: thesis: (Ex (a '&' b),PA,G) . z = TRUE
then A1:
((Ex a,PA,G) . z) '&' ((All (a 'imp' b),PA,G) . z) = TRUE
by MARGREL1:def 21;
then consider x1 being Element of Y such that
A2:
( x1 in EqClass z,(CompF PA,G) & a . x1 = TRUE )
;
then
(a 'imp' b) . x1 = TRUE
by A2;
then A3:
('not' (a . x1)) 'or' (b . x1) = TRUE
by BVFUNC_1:def 11;
A4:
( 'not' FALSE = TRUE & 'not' TRUE = FALSE )
by MARGREL1:41;
(a '&' b) . x1 =
(a . x1) '&' (b . x1)
by MARGREL1:def 21
.=
TRUE '&' TRUE
by A2, A3, A4, BINARITH:7
.=
TRUE
;
then
(B_SUP (a '&' b),(CompF PA,G)) . z = TRUE
by A2, BVFUNC_1:def 20;
hence
(Ex (a '&' b),PA,G) . z = TRUE
by BVFUNC_2:def 10; :: thesis: verum