let G be Group; :: thesis: for X being non empty set holds
( G acts_on X iff ex h being Function of G,(SymGr X) st h is multiplicative )

let X be non empty set ; :: thesis: ( G acts_on X iff ex h being Function of G,(SymGr X) st h is multiplicative )
A: now :: thesis: ( G acts_on X implies ex h being Function of G,(SymGr X) st h is multiplicative )
assume G acts_on X ; :: thesis: ex h being Function of G,(SymGr X) st h is multiplicative
then consider A being Function of [: the carrier of G,X:],X such that
A1: A is Action of G,X ;
reconsider A = A as Action of G,X by A1;
thus ex h being Function of G,(SymGr X) st h is multiplicative :: thesis: verum
proof end;
end;
now :: thesis: ( ex h being Function of G,(SymGr X) st h is multiplicative implies G acts_on X )
assume ex h being Function of G,(SymGr X) st h is multiplicative ; :: thesis: G acts_on X
then consider h being Function of G,(SymGr X) such that
B1: h is multiplicative ;
reconsider h = h as Homomorphism of G,(SymGr X) by B1;
defpred S1[ object , object ] means ex g being Element of G ex a being Element of X ex p being Permutation of X st
( h . g = p & $1 = [g,a] & $2 = p . a );
A: for x being object st x in [: the carrier of G,X:] holds
ex y being object st
( y in X & S1[x,y] )
proof
let x be object ; :: thesis: ( x in [: the carrier of G,X:] implies ex y being object st
( y in X & S1[x,y] ) )

assume x in [: the carrier of G,X:] ; :: thesis: ex y being object st
( y in X & S1[x,y] )

then consider g, a being object such that
A1: ( g in the carrier of G & a in X & x = [g,a] ) by ZFMISC_1:def 2;
reconsider a = a as Element of X by A1;
reconsider g = g as Element of G by A1;
H: the carrier of (SymGr X) = permutations X by Def2
.= { f where f is Permutation of X : verum } by CAYLEY:def 1 ;
h . g in the carrier of (SymGr X) ;
then consider p being Permutation of X such that
A2: p = h . g by H;
take p . a ; :: thesis: ( p . a in X & S1[x,p . a] )
thus ( p . a in X & S1[x,p . a] ) by A1, A2; :: thesis: verum
end;
consider f being Function of [: the carrier of G,X:],X such that
B: for x being object st x in [: the carrier of G,X:] holds
S1[x,f . x] from FUNCT_2:sch 1(A);
C: now :: thesis: for a being Element of X holds f . ((1_ G),a) = a
let a be Element of X; :: thesis: f . ((1_ G),a) = a
consider b being Element of G, c being Element of X, p being Permutation of X such that
C1: ( p = h . b & [(1_ G),a] = [b,c] & f . [(1_ G),a] = p . c ) by B;
C2: ( a = c & b = 1_ G ) by C1, XTUPLE_0:1;
h . (1_ G) = 1_ (SymGr X) by GROUP_6:31
.= id X by Th6 ;
hence f . ((1_ G),a) = a by C1, C2; :: thesis: verum
end;
now :: thesis: for a being Element of X
for g1, g2 being Element of G holds f . (g1,(f . (g2,a))) = f . ((g1 * g2),a)
let a be Element of X; :: thesis: for g1, g2 being Element of G holds f . (g1,(f . (g2,a))) = f . ((g1 * g2),a)
let g1, g2 be Element of G; :: thesis: f . (g1,(f . (g2,a))) = f . ((g1 * g2),a)
consider b1 being Element of G, c1 being Element of X, p1 being Permutation of X such that
C1: ( p1 = h . b1 & [g2,a] = [b1,c1] & f . [g2,a] = p1 . c1 ) by B;
H1: ( a = c1 & b1 = g2 ) by C1, XTUPLE_0:1;
consider b2 being Element of G, c2 being Element of X, p2 being Permutation of X such that
C3: ( p2 = h . b2 & [g1,(p1 . a)] = [b2,c2] & f . [g1,(p1 . a)] = p2 . c2 ) by B;
C4: f . (g1,(f . (g2,a))) = p2 . (p1 . a) by H1, C1, C3, XTUPLE_0:1;
consider b3 being Element of G, c3 being Element of X, p3 being Permutation of X such that
C5: ( p3 = h . b3 & [(g1 * g2),a] = [b3,c3] & f . [(g1 * g2),a] = p3 . c3 ) by B;
H3: ( p1 = h . g2 & p2 = h . g1 ) by C1, C3, XTUPLE_0:1;
C6: ( a = c3 & b3 = g1 * g2 ) by C5, XTUPLE_0:1;
then p3 = (h . g1) * (h . g2) by C5, GROUP_6:def 6
.= p2 * p1 by H3, Def2 ;
hence f . (g1,(f . (g2,a))) = f . ((g1 * g2),a) by C4, C5, C6, FUNCT_2:15; :: thesis: verum
end;
then f is Action of G,X by C, defAC;
hence G acts_on X ; :: thesis: verum
end;
hence ( G acts_on X iff ex h being Function of G,(SymGr X) st h is multiplicative ) by A; :: thesis: verum