reserve X for set,
  x,y,z for Element of BooleLatt X,
  s for set;
reserve y for Element of BooleLatt X;
reserve L for Lattice,
  p,q for Element of L;
reserve A for RelStr,
  a,b,c for Element of A;
reserve A for non empty RelStr,
  a,b,c,c9 for Element of A;
reserve V for with_suprema antisymmetric RelStr,
  u1,u2,u3,u4 for Element of V;
reserve N for with_infima antisymmetric RelStr,
  n1,n2,n3,n4 for Element of N;
reserve K for with_suprema with_infima reflexive antisymmetric RelStr,
  k1,k2,k3 for Element of K;
reserve p9,q9 for Element of LattPOSet L;
reserve C for complete Lattice,
  a,a9,b,b9,c,d for Element of C,
  X,Y for set;

theorem
  (for a st a in X ex b st a [= b & b in Y) implies "\/"(X,C) [= "\/"(Y, C )
proof
  assume
A1: for a st a in X ex b st a [= b & b in Y;
  X is_less_than "\/"(Y,C)
  proof
    let a;
    assume a in X;
    then consider b such that
A2: a [= b and
A3: b in Y by A1;
    b [= "\/"(Y,C) by A3,Th38;
    hence thesis by A2,LATTICES:7;
  end;
  hence thesis by Def21;
end;
