let Y be non empty set ; :: thesis: for a being Function of Y,BOOLEAN
for G being Subset of (PARTITIONS Y)
for A, B being a_partition of Y st G is independent holds
Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G)
let a be Function of Y,BOOLEAN; :: thesis: for G being Subset of (PARTITIONS Y)
for A, B being a_partition of Y st G is independent holds
Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G)
let G be Subset of (PARTITIONS Y); :: thesis: for A, B being a_partition of Y st G is independent holds
Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G)
let A, B be a_partition of Y; :: thesis: ( G is independent implies Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G) )
A1: ( 'not' (All ((Ex (a,A,G)),B,G)) = Ex ((All (('not' a),A,G)),B,G) & Ex (('not' (Ex (a,A,G))),B,G) = Ex ((All (('not' a),A,G)),B,G) ) by Th19, BVFUNC_2:19;
assume G is independent ; :: thesis: Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G)
hence Ex (('not' (Ex (a,A,G))),B,G) '<' Ex ((Ex (('not' a),B,G)),A,G) by A1, Th45; :: thesis: verum