reserve Y for non empty set,
  G for Subset of PARTITIONS(Y),
  a,b,c,u for Function of Y,BOOLEAN,
  PA for a_partition of Y;

theorem
  Ex(a,PA,G) '&' All(a 'imp' b,PA,G) '<' Ex(a '&' b,PA,G)
proof
  let z be Element of Y;
A1: 'not' FALSE=TRUE by MARGREL1:11;
  assume (Ex(a,PA,G) '&' All(a 'imp' b,PA,G)).z=TRUE;
  then
A2: Ex(a,PA,G).z '&' All(a 'imp' b,PA,G).z=TRUE by MARGREL1:def 20;
  now
    assume
    not (ex x being Element of Y st x in EqClass(z,CompF(PA,G)) & a.x= TRUE);
    then B_SUP(a,CompF(PA,G)).z = FALSE by BVFUNC_1:def 17;
    then Ex(a,PA,G).z=FALSE by BVFUNC_2:def 10;
    hence contradiction by A2,MARGREL1:12;
  end;
  then consider x1 being Element of Y such that
A3: x1 in EqClass(z,CompF(PA,G)) and
A4: a.x1=TRUE;
  now
    assume not (for x being Element of Y st x in EqClass(z,CompF(PA,G))
    holds (a 'imp' b).x=TRUE);
    then B_INF(a 'imp' b,CompF(PA,G)).z = FALSE by BVFUNC_1:def 16;
    then All(a 'imp' b,PA,G).z=FALSE by BVFUNC_2:def 9;
    hence contradiction by A2,MARGREL1:12;
  end;
  then (a 'imp' b).x1=TRUE by A3;
  then
A5: ('not' a.x1) 'or' b.x1 =TRUE by BVFUNC_1:def 8;
  (a '&' b).x1 =a.x1 '&' b.x1 by MARGREL1:def 20
    .=TRUE '&' TRUE by A4,A5,A1,BINARITH:3
    .=TRUE;
  then B_SUP(a '&' b,CompF(PA,G)).z = TRUE by A3,BVFUNC_1:def 17;
  hence thesis by BVFUNC_2:def 10;
end;
