theorem Th1:
  for f being set st f in permutations(X) holds f is Permutation of X
  proof
    let f be set;
    assume f in permutations(X);
    then ex g being Permutation of X st g = f;
    hence thesis;
  end;
