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

proof

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

end;

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