thus
( f is integer-functions-valued implies for x being object st x in dom f holds

f . x is INT -valued Function ) :: thesis: ( ( for x being object st x in dom f holds

f . x is INT -valued Function ) implies f is integer-functions-valued )

f . x is INT -valued Function ; :: thesis: f is integer-functions-valued

let y be object ; :: according to VALUED_2:def 6,VALUED_2:def 24 :: thesis: ( y in rng f implies y is INT -valued Function )

assume y in rng f ; :: thesis: y is INT -valued Function

then ex x being object st

( x in dom f & f . x = y ) by FUNCT_1:def 3;

hence y is INT -valued Function by A10; :: thesis: verum

f . x is INT -valued Function ) :: thesis: ( ( for x being object st x in dom f holds

f . x is INT -valued Function ) implies f is integer-functions-valued )

proof

assume A10:
for x being object st x in dom f holds
assume A9:
rng f is integer-functions-membered
; :: according to VALUED_2:def 24 :: thesis: for x being object st x in dom f holds

f . x is INT -valued Function

let x be object ; :: thesis: ( x in dom f implies f . x is INT -valued Function )

assume x in dom f ; :: thesis: f . x is INT -valued Function

then f . x in rng f by FUNCT_1:def 3;

hence f . x is INT -valued Function by A9; :: thesis: verum

end;f . x is INT -valued Function

let x be object ; :: thesis: ( x in dom f implies f . x is INT -valued Function )

assume x in dom f ; :: thesis: f . x is INT -valued Function

then f . x in rng f by FUNCT_1:def 3;

hence f . x is INT -valued Function by A9; :: thesis: verum

f . x is INT -valued Function ; :: thesis: f is integer-functions-valued

let y be object ; :: according to VALUED_2:def 6,VALUED_2:def 24 :: thesis: ( y in rng f implies y is INT -valued Function )

assume y in rng f ; :: thesis: y is INT -valued Function

then ex x being object st

( x in dom f & f . x = y ) by FUNCT_1:def 3;

hence y is INT -valued Function by A10; :: thesis: verum