let Y be non empty set ; :: thesis: for a being Element of Funcs Y,BOOLEAN holds (a 'imp' ('not' a)) 'imp' ('not' a) = I_el Y
let a be Element of Funcs Y,BOOLEAN ; :: thesis: (a 'imp' ('not' a)) 'imp' ('not' a) = I_el Y
A1: for x being Element of Y holds ((a 'imp' ('not' a)) 'imp' ('not' a)) . x = (I_el Y) . x

proof

let x be Element of Y; :: thesis: ((a 'imp' ('not' a)) 'imp' ('not' a)) . x = (I_el Y) . x

A2: now

per cases ( a . x = TRUE or a . x = FALSE ) by XBOOLEAN:def 3;

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

hence ('not' (a . x)) 'or' (a . x) = TRUE by BINARITH:19; :: thesis: verum

end;

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

then ('not' (a . x)) 'or' (a . x) = TRUE 'or' FALSE by MARGREL1:41
.= TRUE by BINARITH:19 ;
hence ('not' (a . x)) 'or' (a . x) = TRUE ; :: thesis: verum

end;

end;

end;

((a 'imp' ('not' a)) 'imp' ('not' a)) . x = ('not' ((a 'imp' ('not' a)) . x)) 'or' (('not' a) . x) by BVFUNC_1:def 11
.= ('not' (('not' (a . x)) 'or' (('not' a) . x))) 'or' (('not' a) . x) by BVFUNC_1:def 11
.= ((a . x) '&' ('not' ('not' (a . x)))) 'or' (('not' a) . x) by MARGREL1:def 20
.= TRUE by A2, MARGREL1:def 20 ;
hence ((a 'imp' ('not' a)) 'imp' ('not' a)) . x = (I_el Y) . x by BVFUNC_1:def 14; :: thesis: verum

end;

consider k3 being Function such that
A3: ( (a 'imp' ('not' a)) 'imp' ('not' a) = k3 & dom k3 = Y & rng k3 c= BOOLEAN ) by FUNCT_2:def 2;
consider k4 being Function such that
A4: ( I_el Y = k4 & dom k4 = Y & rng k4 c= BOOLEAN ) by FUNCT_2:def 2;
for u being set st u in Y holds
k3 . u = k4 . u by A1, A3, A4;
hence (a 'imp' ('not' a)) 'imp' ('not' a) = I_el Y by A3, A4, FUNCT_1:9; :: thesis: verum