let Y be non empty set ; :: thesis: for a, b being Element of Funcs Y,BOOLEAN holds 'not' (a 'xor' b) = a 'xor' ('not' b)
let a, b be Element of Funcs Y,BOOLEAN ; :: thesis: 'not' (a 'xor' b) = a 'xor' ('not' b)
consider k3 being Function such that
A1: 'not' (a 'xor' b) = k3 and
A2: dom k3 = Y and
rng k3 c= BOOLEAN by FUNCT_2:def 2;
consider k4 being Function such that
A3: a 'xor' ('not' b) = k4 and
A4: dom k4 = Y and
rng k4 c= BOOLEAN by FUNCT_2:def 2;
for x being Element of Y holds ('not' (a 'xor' b)) . x = (a 'xor' ('not' b)) . x
proof
let x be Element of Y; :: thesis: ('not' (a 'xor' b)) . x = (a 'xor' ('not' b)) . x
('not' (a 'xor' b)) . x = ('not' ((('not' a) '&' b) 'or' (a '&' ('not' b)))) . x by BVFUNC_4:9
.= (('not' (('not' a) '&' b)) '&' ('not' (a '&' ('not' b)))) . x by BVFUNC_1:16
.= ((('not' ('not' a)) 'or' ('not' b)) '&' ('not' (a '&' ('not' b)))) . x by BVFUNC_1:17
.= ((a 'or' ('not' b)) '&' (('not' a) 'or' ('not' ('not' b)))) . x by BVFUNC_1:17
.= (((a 'or' ('not' b)) '&' ('not' a)) 'or' ((a 'or' ('not' b)) '&' b)) . x by BVFUNC_1:15
.= (((a '&' ('not' a)) 'or' (('not' b) '&' ('not' a))) 'or' ((a 'or' ('not' b)) '&' b)) . x by BVFUNC_1:15
.= (((O_el Y) 'or' (('not' b) '&' ('not' a))) 'or' ((a 'or' ('not' b)) '&' b)) . x by BVFUNC_4:5
.= ((('not' b) '&' ('not' a)) 'or' ((a 'or' ('not' b)) '&' b)) . x by BVFUNC_1:12
.= ((('not' b) '&' ('not' a)) 'or' ((a '&' b) 'or' (('not' b) '&' b))) . x by BVFUNC_1:15
.= ((('not' b) '&' ('not' a)) 'or' ((a '&' b) 'or' (O_el Y))) . x by BVFUNC_4:5
.= ((('not' a) '&' ('not' b)) 'or' (a '&' ('not' ('not' b)))) . x by BVFUNC_1:12
.= (a 'xor' ('not' b)) . x by BVFUNC_4:9 ;
hence ('not' (a 'xor' b)) . x = (a 'xor' ('not' b)) . x ; :: thesis: verum
end;
then for u being set st u in Y holds
k3 . u = k4 . u by A1, A3;
hence 'not' (a 'xor' b) = a 'xor' ('not' b) by A1, A2, A3, A4, FUNCT_1:9; :: thesis: verum