let Y be non empty set ; :: thesis: for a, b, c being Element of Funcs Y,BOOLEAN st a 'imp' (b 'imp' c) = I_el Y holds
(a 'imp' b) 'imp' (a 'imp' c) = I_el Y
let a, b, c be Element of Funcs Y,BOOLEAN ; :: thesis: ( a 'imp' (b 'imp' c) = I_el Y implies (a 'imp' b) 'imp' (a 'imp' c) = I_el Y )
assume A1: a 'imp' (b 'imp' c) = I_el Y ; :: thesis: (a 'imp' b) 'imp' (a 'imp' c) = I_el Y
for x being Element of Y holds ((a 'imp' b) 'imp' (a 'imp' c)) . x = TRUE

proof

let x be Element of Y; :: thesis: ((a 'imp' b) 'imp' (a 'imp' c)) . x = TRUE
(a 'imp' (b 'imp' c)) . x = TRUE by A1, BVFUNC_1:def 14;
then ('not' (a . x)) 'or' ((b 'imp' c) . x) = TRUE by BVFUNC_1:def 11;
then A2: ('not' (a . x)) 'or' (('not' (b . x)) 'or' (c . x)) = TRUE by BVFUNC_1:def 11;

A3: now

per cases ( a . x = TRUE or a . x = FALSE ) by XBOOLEAN:def 3;

case a . x = TRUE ; :: thesis: ('not' (a . x)) 'or' (a . x) = TRUE

hence ('not' (a . x)) 'or' (a . x) = TRUE by BINARITH:19; :: thesis: verum

end;

case a . x = FALSE ; :: thesis: ('not' (a . x)) 'or' (a . x) = TRUE

then ('not' (a . x)) 'or' (a . x) = TRUE 'or' FALSE by MARGREL1:41
.= TRUE by BINARITH:19 ;
hence ('not' (a . x)) 'or' (a . x) = TRUE ; :: thesis: verum

end;

end;

end;

((a 'imp' b) 'imp' (a 'imp' c)) . x = ('not' ((a 'imp' b) . x)) 'or' ((a 'imp' c) . x) by BVFUNC_1:def 11
.= ('not' (('not' (a . x)) 'or' (b . x))) 'or' ((a 'imp' c) . x) by BVFUNC_1:def 11
.= (('not' ('not' (a . x))) '&' ('not' (b . x))) 'or' (('not' (a . x)) 'or' (c . x)) by BVFUNC_1:def 11
.= ((('not' (a . x)) 'or' (c . x)) 'or' (a . x)) '&' ((('not' (a . x)) 'or' (c . x)) 'or' ('not' (b . x))) by XBOOLEAN:9
.= TRUE '&' ((('not' (a . x)) 'or' (c . x)) 'or' (a . x)) by A2, BINARITH:20
.= ((c . x) 'or' ('not' (a . x))) 'or' (a . x) by MARGREL1:50
.= (c . x) 'or' TRUE by A3, BINARITH:20
.= TRUE by BINARITH:19 ;
hence ((a 'imp' b) 'imp' (a 'imp' c)) . x = TRUE ; :: thesis: verum

end;

hence (a 'imp' b) 'imp' (a 'imp' c) = I_el Y by BVFUNC_1:def 14; :: thesis: verum