reserve x for set,
  R for non empty Poset;
reserve S1 for OrderSortedSign,
  OU0 for OSAlgebra of S1;
reserve s,s1,s2,s3,s4 for SortSymbol of S1;

theorem Th16:
  for A being OSSubset of OU0 holds OSSubSort(A) c= SubSort(A)
proof
  let A be OSSubset of OU0;
  let x be object;
  assume x in OSSubSort(A);
  then
  ex y being Element of SubSort(A) st x = y & y is OrderSortedSet of S1;
  hence thesis;
end;
