set c = permutations X;
defpred S1[ Element of permutations X, Element of permutations X, set ] means $3 = $1 * $2;
A1: for x, y being Element of permutations X ex z being Element of permutations X st S1[x,y,z]
proof
let x, y be Element of permutations X; :: thesis: ex z being Element of permutations X st S1[x,y,z]
reconsider f = x, g = y as Permutation of X by CAYLEY:1;
permutations X = { f where f is Permutation of X : verum } by CAYLEY:def 1;
then f * g in permutations X ;
hence ex z being Element of permutations X st S1[x,y,z] ; :: thesis: verum
end;
consider F being BinOp of (permutations X) such that
A2: for x, y being Element of permutations X holds S1[x,y,F . (x,y)] from BINOP_1:sch 3(A1);
set S = multMagma(# (permutations X),F #);
multMagma(# (permutations X),F #) is constituted-Functions ;
then reconsider S = multMagma(# (permutations X),F #) as strict constituted-Functions multMagma ;
take S ; :: thesis: ( the carrier of S = permutations X & ( for x, y being Element of S holds x * y = x * y ) )
thus the carrier of S = permutations X ; :: thesis: for x, y being Element of S holds x * y = x * y
let x, y be Element of S; :: thesis: x * y = x * y
thus x * y = x * y by A2; :: thesis: verum