let f be Function; :: thesis: ( f is FinTree-yielding iff for x being object st x in dom f holds
f . x is finite Tree )
thus ( f is FinTree-yielding implies for x being object st x in dom f holds
f . x is finite Tree ) :: thesis: ( ( for x being object st x in dom f holds
f . x is finite Tree ) implies f is FinTree-yielding )

proof

assume A1: for x being object st x in rng f holds
x is finite Tree ; :: according to TREES_3:def 4,TREES_3:def 10 :: thesis: for x being object st x in dom f holds
f . x is finite Tree
let x be object ; :: thesis: ( x in dom f implies f . x is finite Tree )
assume x in dom f ; :: thesis: f . x is finite Tree
then f . x in rng f by FUNCT_1:def 3;
hence f . x is finite Tree by A1; :: thesis: verum

end;

assume A2: for x being object st x in dom f holds
f . x is finite Tree ; :: thesis: f is FinTree-yielding
let x be object ; :: according to TREES_3:def 4,TREES_3:def 10 :: thesis: ( x in rng f implies x is finite Tree )
assume x in rng f ; :: thesis: x is finite Tree
then ex y being object st
( y in dom f & x = f . y ) by FUNCT_1:def 3;
hence x is finite Tree by A2; :: thesis: verum