let Y be non empty set ; :: thesis: for a, b being Function of Y,BOOLEAN holds 'not' a '<' (a 'imp' b) 'eqv' ('not' a)
let a, b be Function of Y,BOOLEAN; :: thesis: 'not' a '<' (a 'imp' b) 'eqv' ('not' a)
let z be Element of Y; :: according to BVFUNC_1:def 12 :: thesis: ( not ('not' a) . z = TRUE or ((a 'imp' b) 'eqv' ('not' a)) . z = TRUE )
assume A1: ('not' a) . z = TRUE ; :: thesis: ((a 'imp' b) 'eqv' ('not' a)) . z = TRUE
((a 'imp' b) 'eqv' ('not' a)) . z = ((('not' a) 'or' b) 'eqv' ('not' a)) . z by BVFUNC_4:8
.= (((('not' a) 'or' b) 'imp' ('not' a)) '&' (('not' a) 'imp' (('not' a) 'or' b))) . z by BVFUNC_4:7
.= ((('not' (('not' a) 'or' b)) 'or' ('not' a)) '&' (('not' a) 'imp' (('not' a) 'or' b))) . z by BVFUNC_4:8
.= ((('not' (('not' a) 'or' b)) 'or' ('not' a)) '&' (('not' ('not' a)) 'or' (('not' a) 'or' b))) . z by BVFUNC_4:8
.= ((('not' (('not' a) 'or' b)) 'or' ('not' a)) . z) '&' ((('not' ('not' a)) 'or' (('not' a) 'or' b)) . z) by MARGREL1:def 20
.= ((('not' (('not' a) 'or' b)) . z) 'or' (('not' a) . z)) '&' ((('not' ('not' a)) 'or' (('not' a) 'or' b)) . z) by BVFUNC_1:def 4
.= (('not' ((('not' a) 'or' b) . z)) 'or' (('not' a) . z)) '&' ((('not' ('not' a)) 'or' (('not' a) 'or' b)) . z) by MARGREL1:def 19
.= (('not' ((('not' a) . z) 'or' (b . z))) 'or' (('not' a) . z)) '&' ((('not' ('not' a)) 'or' (('not' a) 'or' b)) . z) by BVFUNC_1:def 4
.= ((('not' ('not' (a . z))) '&' ('not' (b . z))) 'or' (('not' a) . z)) '&' ((('not' ('not' a)) 'or' (('not' a) 'or' b)) . z) by MARGREL1:def 19
.= (((a . z) '&' ('not' (b . z))) 'or' (('not' a) . z)) '&' ((('not' ('not' a)) . z) 'or' ((('not' a) 'or' b) . z)) by BVFUNC_1:def 4
.= (((a . z) '&' ('not' (b . z))) 'or' (('not' a) . z)) '&' ((a . z) 'or' ((('not' a) . z) 'or' (b . z))) by BVFUNC_1:def 4
.= TRUE '&' (FALSE 'or' (TRUE 'or' (b . z))) by A1
.= FALSE 'or' (TRUE 'or' (b . z))
.= TRUE 'or' (b . z)
.= TRUE ;
hence ((a 'imp' b) 'eqv' ('not' a)) . z = TRUE ; :: thesis: verum