reserve X,Y for set,
  x,x1,x2,y,y1,y2,z for set,
  f,g,h for Function;
reserve M for non empty set;
reserve D for non empty set;

theorem
  D c= X iff D in BOOL X
proof
  thus D c= X implies D in BOOL X
  proof
A1: not D in {{}} by TARSKI:def 1;
    assume D c= X;
    hence thesis by A1,XBOOLE_0:def 5;
  end;
  assume D in BOOL X;
  hence thesis;
end;
