let Y be set ; ( Y = f .: X iff for y being set holds
( y in Y iff ex x being set st
( x in dom f & x in X & y = f . x ) ) )
hereby ( ( for y being set holds
( y in Y iff ex x being set st
( x in dom f & x in X & y = f . x ) ) ) implies Y = f .: X )
end;
assume A8:
for y being set holds
( y in Y iff ex x being set st
( x in dom f & x in X & y = f . x ) )
; Y = f .: X
now let y be
set ;
( ( y in Y implies ex x being set st
( [x,y] in f & x in X ) ) & ( ex x being set st
( [x,y] in f & x in X ) implies y in Y ) )hereby ( ex x being set st
( [x,y] in f & x in X ) implies y in Y )
end; given x being
set such that A12:
[x,y] in f
and A13:
x in X
;
y in Y
(
x in dom f &
y = f . x )
by A12, Th8;
hence
y in Y
by A8, A13;
verum end;
hence
Y = f .: X
by RELAT_1:def 13; verum