let S be set ; :: according to PRVECT_2:def 3 :: thesis: ( not S in proj2 (G ^ F) or S is RLSStruct )
assume S in rng (G ^ F) ; :: thesis: S is RLSStruct
then consider i being set such that
A1: ( i in dom (G ^ F) & (G ^ F) . i = S ) by FUNCT_1:def 5;
reconsider i = i as Element of NAT by A1;
per cases ( i in dom G or ex n being Nat st
( n in dom F & i = (len G) + n ) )
by FINSEQ_1:38, A1;
end;