let A be set ; :: thesis: ( A is Tree-like implies A is FinSequence-membered )
assume A is Tree-like ; :: thesis: A is FinSequence-membered
then A c= NAT * by TREES_1:def 3;
hence A is FinSequence-membered ; :: thesis: verum