let Y be non empty set ; :: thesis: for a, b, c being Element of Funcs (Y,BOOLEAN) holds (a '&' b) 'or' c = (a 'or' c) '&' (b 'or' c)
let a, b, c be Element of Funcs (Y,BOOLEAN); :: thesis: (a '&' b) 'or' c = (a 'or' c) '&' (b 'or' c)
consider k3 being Function such that
A1: (a '&' b) 'or' c = k3 and
A2: dom k3 = Y and
rng k3 c= BOOLEAN by FUNCT_2:def 2;
consider k4 being Function such that
A3: (a 'or' c) '&' (b 'or' c) = k4 and
A4: dom k4 = Y and
rng k4 c= BOOLEAN by FUNCT_2:def 2;
for x being Element of Y holds ((a '&' b) 'or' c) . x = ((a 'or' c) '&' (b 'or' c)) . x

proof

let x be Element of Y; :: thesis: ((a '&' b) 'or' c) . x = ((a 'or' c) '&' (b 'or' c)) . x
((a '&' b) 'or' c) . x = ((a '&' b) . x) 'or' (c . x) by Def7;
then A5: ((a '&' b) 'or' c) . x = ((a . x) '&' (b . x)) 'or' (c . x) by MARGREL1:def 20;
( (c . x) 'or' ((a . x) '&' (b . x)) = ((c . x) 'or' (a . x)) '&' ((c . x) 'or' (b . x)) & (a . x) 'or' (c . x) = (a 'or' c) . x ) by Def7, XBOOLEAN:9;
then ((a '&' b) 'or' c) . x = ((a 'or' c) . x) '&' ((b 'or' c) . x) by A5, Def7
.= ((a 'or' c) '&' (b 'or' c)) . x by MARGREL1:def 20 ;
hence ((a '&' b) 'or' c) . x = ((a 'or' c) '&' (b 'or' c)) . x ; :: thesis: verum

end;

then for u being set st u in Y holds
k3 . u = k4 . u by A1, A3;
hence (a '&' b) 'or' c = (a 'or' c) '&' (b 'or' c) by A1, A2, A3, A4, FUNCT_1:2; :: thesis: verum