let X be set ; :: thesis: for x being Element of (SymGr X) holds x " = x "
let x be Element of (SymGr X); :: thesis: x " = x "
reconsider f = x as Permutation of X by Th5;
permutations X = { f where f is Permutation of X : verum } by CAYLEY:def 1;
then f " in permutations X ;
then reconsider g = f " as Element of (SymGr X) by Def2;
A1: 1_ (SymGr X) = id X by Th6;
x * g = x * g by Def2;
then A2: x * g = id X by FUNCT_2:61;
g * x = g * x by Def2;
then g * x = id X by FUNCT_2:61;
hence x " = x " by A2, A1, GROUP_1:def 5; :: thesis: verum