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

proof

let x be Element of Y; :: thesis: (a 'xor' b) . x = ((('not' a) '&' b) 'or' (a '&' ('not' b))) . x
(a 'xor' b) . x = (a . x) 'xor' (b . x) by BVFUNC_1:def 8
.= ((('not' a) . x) '&' (b . x)) 'or' ((a . x) '&' ('not' (b . x))) by MARGREL1:def 20
.= ((('not' a) . x) '&' (b . x)) 'or' ((a . x) '&' (('not' b) . x)) by MARGREL1:def 20
.= ((('not' a) '&' b) . x) 'or' ((a . x) '&' (('not' b) . x)) by MARGREL1:def 21
.= ((('not' a) '&' b) . x) 'or' ((a '&' ('not' b)) . x) by MARGREL1:def 21
.= ((('not' a) '&' b) 'or' (a '&' ('not' b))) . x by BVFUNC_1:def 7 ;
hence (a 'xor' b) . x = ((('not' a) '&' b) 'or' (a '&' ('not' 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) '&' b) 'or' (a '&' ('not' b)) = 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, A2, A3;
hence a 'xor' b = (('not' a) '&' b) 'or' (a '&' ('not' b)) by A2, A3, FUNCT_1:9; :: thesis: verum