let Y be non empty set ; :: thesis: for a, b, c being Element of Funcs Y,BOOLEAN holds (a 'or' b) '&' (('not' a) 'or' c) '<' b 'or' c
let a, b, c be Element of Funcs Y,BOOLEAN ; :: thesis: (a 'or' b) '&' (('not' a) 'or' c) '<' b 'or' c
let z be Element of Y; :: according to BVFUNC_1:def 15 :: thesis: ( not ((a 'or' b) '&' (('not' a) 'or' c)) . z = TRUE or (b 'or' c) . z = TRUE )
assume A1: ((a 'or' b) '&' (('not' a) 'or' c)) . z = TRUE ; :: thesis: (b 'or' c) . z = TRUE
A2: ((a 'or' b) '&' (('not' a) 'or' c)) . z = ((a 'or' b) . z) '&' ((('not' a) 'or' c) . z) by MARGREL1:def 21
.= ((a . z) 'or' (b . z)) '&' ((('not' a) 'or' c) . z) by BVFUNC_1:def 7
.= ((a . z) 'or' (b . z)) '&' ((('not' a) . z) 'or' (c . z)) by BVFUNC_1:def 7 ;

now

assume (b 'or' c) . z <> TRUE ; :: thesis: contradiction
then (b 'or' c) . z = FALSE by XBOOLEAN:def 3;
then A3: (b . z) 'or' (c . z) = FALSE by BVFUNC_1:def 7;
( c . z = TRUE or c . z = FALSE ) by XBOOLEAN:def 3;
then ((a . z) 'or' (b . z)) '&' ((('not' a) . z) 'or' (c . z)) = (a . z) '&' ('not' (a . z)) by A3, MARGREL1:def 20
.= FALSE by XBOOLEAN:138 ;
hence contradiction by A1, A2; :: thesis: verum

end;

hence (b 'or' c) . z = TRUE ; :: thesis: verum