H: permutations X = { f where f is Permutation of X : verum } by CAYLEY:def 1;
the carrier of (SymGr X) = permutations X by Def2;
hence not SymGr X is empty ; :: thesis: ( SymGr X is associative & SymGr X is Group-like )
thus SymGr X is associative :: thesis: SymGr X is Group-like
proof
let x, y, z be Element of (SymGr X); :: according to GROUP_1:def 3 :: thesis: (x [*] y) [*] z = x [*] (y [*] z)
y * z = y * z by Def2;
hence x * (y * z) = x * (y * z) by Def2
.= (x * y) * z by RELAT_1:36
.= (x * y) * z by Def2
.= (x * y) * z by Def2 ;
:: thesis: verum
end;
set e = id X;
id X in permutations X by H;
then reconsider e = id X as Element of (SymGr X) by Def2;
take e ; :: according to GROUP_1:def 2 :: thesis: for b1 being Element of the carrier of (SymGr X) holds
( b1 [*] e = b1 & e [*] b1 = b1 & ex b2 being Element of the carrier of (SymGr X) st
( b1 [*] b2 = e & b2 [*] b1 = e ) )

let h be Element of (SymGr X); :: thesis: ( h [*] e = h & e [*] h = h & ex b1 being Element of the carrier of (SymGr X) st
( h [*] b1 = e & b1 [*] h = e ) )

reconsider h1 = h as Permutation of X by Th5;
thus h * e = h1 * e by Def2
.= h by FUNCT_2:17 ; :: thesis: ( e [*] h = h & ex b1 being Element of the carrier of (SymGr X) st
( h [*] b1 = e & b1 [*] h = e ) )

thus e * h = e * h1 by Def2
.= h by FUNCT_2:17 ; :: thesis: ex b1 being Element of the carrier of (SymGr X) st
( h [*] b1 = e & b1 [*] h = e )

h1 " in permutations X by H;
then reconsider g = h1 " as Element of (SymGr X) by Def2;
take g ; :: thesis: ( h [*] g = e & g [*] h = e )
thus h * g = h * g by Def2
.= e by FUNCT_2:61 ; :: thesis: g [*] h = e
thus g * h = g * h by Def2
.= e by FUNCT_2:61 ; :: thesis: verum