defpred S1[ object , object ] means ex a being Element of X st
( $1 = a & $2 = A . (g,a) );
A:
for x being object st x in X holds
ex y being object st
( y in X & S1[x,y] )
proof
let x be
object ;
( x in X implies ex y being object st
( y in X & S1[x,y] ) )
assume
x in X
;
ex y being object st
( y in X & S1[x,y] )
then reconsider a =
x as
Element of
X ;
take
A . (
g,
a)
;
( A . (g,a) in X & S1[x,A . (g,a)] )
thus
(
A . (
g,
a)
in X &
S1[
x,
A . (
g,
a)] )
;
verum
end;
consider f being Function of X,X such that
B:
for x being object st x in X holds
S1[x,f . x]
from FUNCT_2:sch 1(A);
defpred S2[ object , object ] means ex a being Element of X st
( $1 = a & $2 = A . ((g "),a) );
C:
for x being object st x in X holds
ex y being object st
( y in X & S2[x,y] )
proof
let x be
object ;
( x in X implies ex y being object st
( y in X & S2[x,y] ) )
assume
x in X
;
ex y being object st
( y in X & S2[x,y] )
then reconsider a =
x as
Element of
X ;
take
A . (
(g "),
a)
;
( A . ((g "),a) in X & S2[x,A . ((g "),a)] )
thus
(
A . (
(g "),
a)
in X &
S2[
x,
A . (
(g "),
a)] )
;
verum
end;
consider h being Function of X,X such that
D:
for x being object st x in X holds
S2[x,h . x]
from FUNCT_2:sch 1(C);
then
f * h = id X
;
then E:
f is onto
by FUNCT_2:23;
then
h * f = id X
;
then
f is one-to-one
by FUNCT_2:23;
then reconsider f = f as Permutation of X by E;
take
f
; for a being Element of X holds f . a = A . (g,a)
now for a being Element of X holds f . a = A . (g,a)let a be
Element of
X;
f . a = A . (g,a)consider b being
Element of
X such that H:
(
b = a &
f . a = A . (
g,
b) )
by B;
thus
f . a = A . (
g,
a)
by H;
verum end;
hence
for a being Element of X holds f . a = A . (g,a)
; verum