reserve X,Y for set;
reserve G for Group;
reserve n for Nat;

theorem Th2:
  permutations(X) c= Funcs(X,X)
  proof
    let x be object;
    assume x in permutations(X);
    then x is Permutation of X by Th1;
    hence thesis by FUNCT_2:9;
  end;
