reserve Y for non empty set;

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