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

proof

let x be Element of Y; :: thesis: (a 'xor' b) . x = ('not' (a 'eqv' b)) . x
(a 'xor' b) . x = ('not' ('not' ((('not' a) '&' b) 'or' (a '&' ('not' b))))) . x by BVFUNC_4:9
.= ('not' (('not' (('not' a) '&' b)) '&' ('not' (a '&' ('not' b))))) . x by BVFUNC_1:16
.= ('not' ((('not' ('not' a)) 'or' ('not' b)) '&' ('not' (a '&' ('not' b))))) . x by BVFUNC_1:17
.= ('not' ((a 'or' ('not' b)) '&' (('not' a) 'or' ('not' ('not' b))))) . x by BVFUNC_1:17
.= ('not' ((b 'imp' a) '&' (('not' a) 'or' b))) . x by BVFUNC_4:8
.= ('not' ((b 'imp' a) '&' (a 'imp' b))) . x by BVFUNC_4:8
.= ('not' (a 'eqv' b)) . x by BVFUNC_4:7 ;
hence (a 'xor' b) . x = ('not' (a 'eqv' b)) . x ; :: thesis: verum

end;

consider k3 being Function such that
A2: ( a 'xor' b = k3 & dom k3 = Y & rng k3 c= BOOLEAN ) by FUNCT_2:def 2;
consider k4 being Function such that
A3: ( 'not' (a 'eqv' 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 'xor' b = 'not' (a 'eqv' b) by A2, A3, FUNCT_1:9; :: thesis: verum