set f = canHom A;
set H = SymGr X;
now :: thesis: for g1, g2 being Element of G holds ((canHom A) . g1) * ((canHom A) . g2) = (canHom A) . (g1 * g2)
let g1, g2 be Element of G; :: thesis: ((canHom A) . g1) * ((canHom A) . g2) = (canHom A) . (g1 * g2)
A: the carrier of (SymGr X) = permutations X by Def2
.= { f where f is Permutation of X : verum } by CAYLEY:def 1 ;
( apply (A,g1) in { f where f is Permutation of X : verum } & apply (A,g2) in { f where f is Permutation of X : verum } ) ;
then reconsider a = apply (A,g1), b = apply (A,g2) as Element of (SymGr X) by A;
( (canHom A) . g1 = a & (canHom A) . g2 = b ) by defHom;
hence ((canHom A) . g1) * ((canHom A) . g2) = (apply (A,g1)) * (apply (A,g2)) by Def2
.= apply (A,(g1 * g2)) by app1
.= (canHom A) . (g1 * g2) by defHom ;
:: thesis: verum
end;
hence canHom A is multiplicative ; :: thesis: verum