A1: ex e being Element of (Group_of_Perm n) st
for p being Element of (Group_of_Perm n) holds
( p * e = p & e * p = p & ex g being Element of (Group_of_Perm n) st
( p * g = e & g * p = e ) )

proof

reconsider e = idseq n as Element of (Group_of_Perm n) by Th11;
take e ; :: thesis: for p being Element of (Group_of_Perm n) holds
( p * e = p & e * p = p & ex g being Element of (Group_of_Perm n) st
( p * g = e & g * p = e ) )
reconsider e9 = idseq n as Element of Permutations n by Def12;
A2: for p being Element of (Group_of_Perm n) ex g being Element of (Group_of_Perm n) st
( p * g = e & g * p = e )

proof

let p be Element of (Group_of_Perm n); :: thesis: ex g being Element of (Group_of_Perm n) st
( p * g = e & g * p = e )
reconsider q = p as Element of Permutations n by Def13;
reconsider r = q as Permutation of (Seg n) by Def12;
reconsider f = r " as Element of Permutations n by Def12;
reconsider g = f as Element of (Group_of_Perm n) by Th14;
take g ; :: thesis: ( p * g = e & g * p = e )
A3: g * p = q * f by Def13
.= e by Th13 ;
p * g = f * q by Def13
.= e by Th13 ;
hence ( p * g = e & g * p = e ) by A3; :: thesis: verum

end;

for p being Element of (Group_of_Perm n) holds
( p * e = p & e * p = p )

proof

let p be Element of (Group_of_Perm n); :: thesis: ( p * e = p & e * p = p )
reconsider p9 = p as Element of Permutations n by Def13;
A4: e * p = p9 * e9 by Def13
.= p by Th12 ;
p * e = e9 * p9 by Def13
.= p by Th12 ;
hence ( p * e = p & e * p = p ) by A4; :: thesis: verum

end;

hence for p being Element of (Group_of_Perm n) holds
( p * e = p & e * p = p & ex g being Element of (Group_of_Perm n) st
( p * g = e & g * p = e ) ) by A2; :: thesis: verum

end;

for p, q, r being Element of (Group_of_Perm n) holds (p * q) * r = p * (q * r)

proof

let p, q, r be Element of (Group_of_Perm n); :: thesis: (p * q) * r = p * (q * r)
reconsider p9 = p, q9 = q, r9 = r as Element of Permutations n by Def13;
A5: ( q9 * p9 is Permutation of (Seg n) & r9 * q9 is Permutation of (Seg n) )

proof

reconsider p9 = p9, q9 = q9, r9 = r9 as Permutation of (Seg n) by Def12;
( q9 * p9 is Permutation of (Seg n) & r9 * q9 is Permutation of (Seg n) ) ;
hence ( q9 * p9 is Permutation of (Seg n) & r9 * q9 is Permutation of (Seg n) ) ; :: thesis: verum

end;

then A6: q9 * p9 is Element of Permutations n by Def12;
A7: r9 * q9 is Element of Permutations n by A5, Def12;
(p * q) * r = the multF of (Group_of_Perm n) . ((q9 * p9),r9) by Def13
.= r9 * (q9 * p9) by A6, Def13
.= (r9 * q9) * p9 by RELAT_1:36
.= the multF of (Group_of_Perm n) . (p9,(r9 * q9)) by A7, Def13
.= p * (q * r) by Def13 ;
hence (p * q) * r = p * (q * r) ; :: thesis: verum

end;

hence ( Group_of_Perm n is associative & Group_of_Perm n is Group-like ) by A1, GROUP_1:1; :: thesis: verum