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

proof

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

end;

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