set G = Aut F;
ex e being Element of (Aut F) st
for h being Element of (Aut F) holds
( h * e = h & e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) )
proof
id F in { f where f is Automorphism of F : verum } ;
then reconsider e = id F as Element of (Aut F) ;
take e ; :: thesis: for h being Element of (Aut F) holds
( h * e = h & e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) )

now :: thesis: for h being Element of (Aut F) holds
( h * e = h & e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) )
let h be Element of (Aut F); :: thesis: ( h * e = h & e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) )

h in { f where f is Automorphism of F : verum } ;
then consider h1 being Automorphism of F such that
A: h1 = h ;
thus h * e = h1 * (id F) by A, defMult
.= h by A, FUNCT_2:17 ; :: thesis: ( e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) )

thus e * h = (id F) * h1 by A, defMult
.= h by A, FUNCT_2:17 ; :: thesis: ex g being Element of (Aut F) st
( h * g = e & g * h = e )

thus ex g being Element of (Aut F) st
( h * g = e & g * h = e ) :: thesis: verum
proof
h1 " in { f where f is Automorphism of F : verum } ;
then reconsider g = h1 " as Element of (Aut F) ;
take g ; :: thesis: ( h * g = e & g * h = e )
B: rng h1 = the carrier of F by FUNCT_2:def 3;
thus h * g = h1 * (h1 ") by A, defMult
.= e by B, FUNCT_2:29 ; :: thesis: g * h = e
thus g * h = (h1 ") * h1 by A, defMult
.= e by B, FUNCT_2:29 ; :: thesis: verum
end;
end;
hence for h being Element of (Aut F) holds
( h * e = h & e * h = h & ex g being Element of (Aut F) st
( h * g = e & g * h = e ) ) ; :: thesis: verum
end;
hence Aut F is Group-like ; :: thesis: Aut F is associative
now :: thesis: for a, b, c being Element of (Aut F) holds (a * b) * c = a * (b * c)
let a, b, c be Element of (Aut F); :: thesis: (a * b) * c = a * (b * c)
a in { f where f is Automorphism of F : verum } ;
then consider f being Automorphism of F such that
A: f = a ;
b in { f where f is Automorphism of F : verum } ;
then consider g being Automorphism of F such that
B: g = b ;
c in { f where f is Automorphism of F : verum } ;
then consider h being Automorphism of F such that
C: h = c ;
D: ( a * b = f * g & b * c = g * h ) by A, B, C, defMult;
thus (a * b) * c = (f * g) * h by D, C, defMult
.= f * (g * h) by RELAT_1:36
.= a * (b * c) by A, D, defMult ; :: thesis: verum
end;
hence Aut F is associative ; :: thesis: verum