consider X being non empty set such that
A2: S c= [:NAT,(NAT *),(X *):] by Def1;
I in S ;
then JumpPart I in NAT * by A2, RECDEF_2:2;
hence for b1 being set st b1 = JumpPart I holds
( b1 is Function-like & b1 is Relation-like ) ; :: thesis: verum