reserve Y for non empty set;

theorem
  for u being Function of Y,BOOLEAN, G being Subset of PARTITIONS(
Y), PA being a_partition of Y st u is_independent_of PA,G holds u '<' All(u,PA,
  G)
proof
  let u be Function of Y,BOOLEAN;
  let G be Subset of PARTITIONS(Y);
  let PA be a_partition of Y;
  assume u is_independent_of PA,G;
  then
A1: u is_dependent_of CompF(PA,G);
  for z being Element of Y holds (u 'imp' All(u,PA,G)).z = TRUE
  proof
    let z be Element of Y;
A2: (u 'imp' All(u,PA,G)).z ='not' u.z 'or' All(u,PA,G).z by BVFUNC_1:def 8;
A3: z in EqClass(z,CompF(PA,G)) & EqClass(z,CompF(PA,G)) in CompF(PA,G) by
EQREL_1:def 6;
    now
      per cases by XBOOLEAN:def 3;
      case
        u.z=FALSE;
        hence thesis by A2;
      end;
      case
        u.z=TRUE;
        then
        for x being Element of Y st x in EqClass(z,CompF(PA,G)) holds u.x
        =TRUE by A1,A3;
        then All(u,PA,G).z=TRUE by BVFUNC_1:def 16;
        hence thesis by A2;
      end;
    end;
    hence thesis;
  end;
  then u 'imp' All(u,PA,G) = I_el(Y) by BVFUNC_1:def 11;
  hence thesis by BVFUNC_1:16;
end;
