reserve x,y,y1,y2,z,a,b for object, X,Y,Z,V1,V2 for set,
  f,g,h,h9,f1,f2 for Function,
  i for Nat,
  P for Permutation of X,
  D,D1,D2,D3 for non empty set,
  d1 for Element of D1,
  d2 for Element of D2,
  d3 for Element of D3;

theorem Th21:
  f <> {} implies
  for x being object holds
   x in meet f iff for y being object st y in dom f holds x in f.y
proof
  assume
A1: f <> {};
  let x be object;
  thus x in meet f implies for y being object st y in dom f holds x in f.y
  proof
    assume
A2: x in meet f;
    let y be object;
    assume y in dom f;
    then f.y in rng f by FUNCT_1:def 3;
    then meet f c= f.y by SETFAM_1:3;
    hence thesis by A2;
  end;
  assume
A3: for y being object st y in dom f holds x in f.y;
  now
    let z be set;
    assume z in rng f;
    then ex y being object st y in dom f & z = f.y by FUNCT_1:def 3;
    hence x in z by A3;
  end;
  hence thesis by A1,SETFAM_1:def 1;
end;
