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
hence
Y = f .: X
by RELAT_1:def 13; verum