theorem
  x <> y implies { x,y } \ { y } = { x }
proof
  assume x <> y;
  then
A1: not x in {y} by TARSKI:def 1;
  y in {y} by TARSKI:def 1;
  hence thesis by A1,Lm11;
end;
