let Y be non empty set ; :: thesis: for G being Subset of (PARTITIONS Y)
for u, a being Element of Funcs Y,BOOLEAN
for PA being a_partition of Y st u is_independent_of PA,G holds
Ex (u 'imp' a),PA,G '<' u 'imp' (Ex a,PA,G)
let G be Subset of (PARTITIONS Y); :: thesis: for u, a being Element of Funcs Y,BOOLEAN
for PA being a_partition of Y st u is_independent_of PA,G holds
Ex (u 'imp' a),PA,G '<' u 'imp' (Ex a,PA,G)
let u, a be Element of Funcs Y,BOOLEAN ; :: thesis: for PA being a_partition of Y st u is_independent_of PA,G holds
Ex (u 'imp' a),PA,G '<' u 'imp' (Ex a,PA,G)
let PA be a_partition of Y; :: thesis: ( u is_independent_of PA,G implies Ex (u 'imp' a),PA,G '<' u 'imp' (Ex a,PA,G) )
assume u is_independent_of PA,G ; :: thesis: Ex (u 'imp' a),PA,G '<' u 'imp' (Ex a,PA,G)
then A1: u is_dependent_of CompF PA,G by BVFUNC_2:def 8;
let z be Element of Y; :: according to BVFUNC_1:def 15 :: thesis: ( not (Ex (u 'imp' a),PA,G) . z = TRUE or (u 'imp' (Ex a,PA,G)) . z = TRUE )
assume A2: (Ex (u 'imp' a),PA,G) . z = TRUE ; :: thesis: (u 'imp' (Ex a,PA,G)) . z = TRUE

now

assume for x being Element of Y holds
( not x in EqClass z,(CompF PA,G) or not (u 'imp' a) . x = TRUE ) ; :: thesis: contradiction
then (B_SUP (u 'imp' a),(CompF PA,G)) . z = FALSE by BVFUNC_1:def 20;
then (Ex (u 'imp' a),PA,G) . z = FALSE by BVFUNC_2:def 10;
hence contradiction by A2; :: thesis: verum

end;

then consider x1 being Element of Y such that
A3: ( x1 in EqClass z,(CompF PA,G) & (u 'imp' a) . x1 = TRUE ) ;
A4: ('not' (u . x1)) 'or' (a . x1) = TRUE by A3, BVFUNC_1:def 11;
A5: ( 'not' (u . x1) = TRUE or 'not' (u . x1) = FALSE ) by XBOOLEAN:def 3;
A6: ( z in EqClass z,(CompF PA,G) & EqClass z,(CompF PA,G) in CompF PA,G ) by EQREL_1:def 8;

per cases ( 'not' (u . x1) = TRUE or a . x1 = TRUE ) by A4, A5, BINARITH:7;

suppose A7: 'not' (u . x1) = TRUE ; :: thesis: (u 'imp' (Ex a,PA,G)) . z = TRUE

u . x1 = u . z by A1, A3, A6, BVFUNC_1:def 18;
then u . z = FALSE by A7, MARGREL1:41;
hence (u 'imp' (Ex a,PA,G)) . z = ('not' FALSE ) 'or' ((Ex a,PA,G) . z) by BVFUNC_1:def 11
.= TRUE 'or' ((Ex a,PA,G) . z) by MARGREL1:41
.= TRUE by BINARITH:19 ;
:: thesis: verum

end;

suppose a . x1 = TRUE ; :: thesis: (u 'imp' (Ex a,PA,G)) . z = TRUE

then (B_SUP a,(CompF PA,G)) . z = TRUE by A3, BVFUNC_1:def 20;
then (Ex a,PA,G) . z = TRUE by BVFUNC_2:def 10;
hence (u 'imp' (Ex a,PA,G)) . z = ('not' (u . z)) 'or' TRUE by BVFUNC_1:def 11
.= TRUE by BINARITH:19 ;
:: thesis: verum

end;

end;