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

proof

let x be Element of Y; :: thesis: ((a 'imp' b) '&' ('not' b)) . x = (('not' a) '&' ('not' b)) . x
((a 'imp' b) '&' ('not' b)) . x = ((a 'imp' b) . x) '&' (('not' b) . x) by MARGREL1:def 21
.= (('not' b) . x) '&' (('not' (a . x)) 'or' (b . x)) by BVFUNC_1:def 11
.= ((('not' b) . x) '&' ('not' (a . x))) 'or' ((('not' b) . x) '&' (b . x)) by XBOOLEAN:8
.= ((('not' b) . x) '&' ('not' (a . x))) 'or' ((b . x) '&' ('not' (b . x))) by MARGREL1:def 20
.= ((('not' b) . x) '&' ('not' (a . x))) 'or' FALSE by XBOOLEAN:138
.= (('not' b) . x) '&' ('not' (a . x)) by BINARITH:7
.= (('not' b) . x) '&' (('not' a) . x) by MARGREL1:def 20
.= (('not' a) '&' ('not' b)) . x by MARGREL1:def 21 ;
hence ((a 'imp' b) '&' ('not' b)) . x = (('not' a) '&' ('not' b)) . x ; :: thesis: verum

end;

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