reserve i, x, I for set,
  A, B, M for ManySortedSet of I,
  f, f1 for Function;

theorem
  for M being non empty set for X, Y being Element of M st X c= Y holds
  (id M).X c= (id M).Y;
