let Y be non empty set ; :: thesis: for a, b being Element of Funcs Y,BOOLEAN st a 'imp' b = I_el Y & a 'imp' ('not' b) = I_el Y holds
'not' a = I_el Y
let a, b be Element of Funcs Y,BOOLEAN ; :: thesis: ( a 'imp' b = I_el Y & a 'imp' ('not' b) = I_el Y implies 'not' a = I_el Y )
assume that
A1: a 'imp' b = I_el Y and
A2: a 'imp' ('not' b) = I_el Y ; :: thesis: 'not' a = I_el Y
for x being Element of Y holds ('not' a) . x = TRUE

proof

let x be Element of Y; :: thesis: ('not' a) . x = TRUE
(a 'imp' b) . x = TRUE by A1, BVFUNC_1:def 14;
then A3: ('not' (a . x)) 'or' (b . x) = TRUE by BVFUNC_1:def 11;
(a 'imp' ('not' b)) . x = TRUE by A2, BVFUNC_1:def 14;
then A4: ('not' (a . x)) 'or' (('not' b) . x) = TRUE by BVFUNC_1:def 11;
A5: ( 'not' (a . x) = TRUE or 'not' (a . x) = FALSE ) by XBOOLEAN:def 3;

now

per cases ( ( 'not' (a . x) = TRUE & 'not' (a . x) = TRUE ) or ( 'not' (a . x) = TRUE & ('not' b) . x = TRUE ) or ( b . x = TRUE & 'not' (a . x) = TRUE ) or ( b . x = TRUE & ('not' b) . x = TRUE ) ) by A3, A5, A4, BINARITH:7;

case ( 'not' (a . x) = TRUE & 'not' (a . x) = TRUE ) ; :: thesis: ('not' a) . x = TRUE

hence ('not' a) . x = TRUE by MARGREL1:def 20; :: thesis: verum

end;

case ( 'not' (a . x) = TRUE & ('not' b) . x = TRUE ) ; :: thesis: ('not' a) . x = TRUE

hence ('not' a) . x = TRUE by MARGREL1:def 20; :: thesis: verum

end;

case ( b . x = TRUE & 'not' (a . x) = TRUE ) ; :: thesis: ('not' a) . x = TRUE

hence ('not' a) . x = TRUE by MARGREL1:def 20; :: thesis: verum

end;

case A6: ( b . x = TRUE & ('not' b) . x = TRUE ) ; :: thesis: ('not' a) . x = TRUE

then 'not' (b . x) = TRUE by MARGREL1:def 20;
hence ('not' a) . x = TRUE by A6, MARGREL1:41; :: thesis: verum

end;

end;

end;

hence ('not' a) . x = TRUE ; :: thesis: verum

end;

hence 'not' a = I_el Y by BVFUNC_1:def 14; :: thesis: verum