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

proof

let x be Element of Y; :: thesis: ((c 'imp' (b 'imp' a)) 'imp' (b 'imp' (c 'imp' a))) . x = (I_el Y) . x

A5: now

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

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

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

end;

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

then ('not' (b . x)) 'or' (b . x) = TRUE 'or' FALSE by MARGREL1:11
.= TRUE by BINARITH:10 ;
hence ('not' (b . x)) 'or' (b . x) = TRUE ; :: thesis: verum

end;

end;

end;

A6: 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:10; :: 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:11
.= TRUE by BINARITH:10 ;
hence ('not' (a . x)) 'or' (a . x) = TRUE ; :: thesis: verum

end;

end;

end;

A7: now

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

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

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

end;

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

then ('not' (c . x)) 'or' (c . x) = TRUE 'or' FALSE by MARGREL1:11
.= TRUE by BINARITH:10 ;
hence ('not' (c . x)) 'or' (c . x) = TRUE ; :: thesis: verum

end;

end;

end;

((c 'imp' (b 'imp' a)) 'imp' (b 'imp' (c 'imp' a))) . x = ('not' ((c 'imp' (b 'imp' a)) . x)) 'or' ((b 'imp' (c 'imp' a)) . x) by BVFUNC_1:def 8
.= ('not' (('not' (c . x)) 'or' ((b 'imp' a) . x))) 'or' ((b 'imp' (c 'imp' a)) . x) by BVFUNC_1:def 8
.= ('not' (('not' (c . x)) 'or' (('not' (b . x)) 'or' (a . x)))) 'or' ((b 'imp' (c 'imp' a)) . x) by BVFUNC_1:def 8
.= ('not' (('not' (c . x)) 'or' (('not' (b . x)) 'or' (a . x)))) 'or' (('not' (b . x)) 'or' ((c 'imp' a) . x)) by BVFUNC_1:def 8
.= ((c . x) '&' (('not' ('not' (b . x))) '&' ('not' (a . x)))) 'or' (('not' (b . x)) 'or' (('not' (c . x)) 'or' (a . x))) by BVFUNC_1:def 8
.= ((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' ((b . x) '&' ((c . x) '&' ('not' (a . x)))) by MARGREL1:16
.= (((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' (b . x)) '&' (((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' ((c . x) '&' ('not' (a . x)))) by XBOOLEAN:9
.= ((('not' (c . x)) 'or' (a . x)) 'or' TRUE) '&' (((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' ((c . x) '&' ('not' (a . x)))) by A5, BINARITH:11
.= TRUE '&' (((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' ((c . x) '&' ('not' (a . x)))) by BINARITH:10
.= ((('not' (c . x)) 'or' (a . x)) 'or' ('not' (b . x))) 'or' ((c . x) '&' ('not' (a . x))) by MARGREL1:14
.= (((a . x) 'or' ('not' (b . x))) 'or' ('not' (c . x))) 'or' ((c . x) '&' ('not' (a . x))) by BINARITH:11
.= ((a . x) 'or' ('not' (b . x))) 'or' (('not' (c . x)) 'or' ((c . x) '&' ('not' (a . x)))) by BINARITH:11
.= ((a . x) 'or' ('not' (b . x))) 'or' (TRUE '&' (('not' (c . x)) 'or' ('not' (a . x)))) by A7, XBOOLEAN:9
.= (('not' (b . x)) 'or' (a . x)) 'or' (('not' (c . x)) 'or' ('not' (a . x))) by MARGREL1:14
.= ((('not' (b . x)) 'or' (a . x)) 'or' ('not' (a . x))) 'or' ('not' (c . x)) by BINARITH:11
.= (('not' (b . x)) 'or' TRUE) 'or' ('not' (c . x)) by A6, BINARITH:11
.= TRUE 'or' ('not' (c . x)) by BINARITH:10
.= TRUE by BINARITH:10 ;
hence ((c 'imp' (b 'imp' a)) 'imp' (b 'imp' (c 'imp' a))) . x = (I_el Y) . x by BVFUNC_1:def 11; :: thesis: verum

end;

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