now
let v be set ; :: thesis: ( v in rng (p | Y) implies v is RelStr )
assume A1: v in rng (p | Y) ; :: thesis: v is RelStr
consider x being set such that
A2: x in dom (p | Y) and
A3: v = (p | Y) . x by A1, FUNCT_1:def 5;
A4: x in Y by A2, PARTFUN1:def 4;
then A5: (p | Y) . x = p . x by FUNCT_1:72;
x in X by A4;
then x in dom p by PARTFUN1:def 4;
then p . x in rng p by FUNCT_1:12;
hence v is RelStr by A3, A5, YELLOW_1:def 3; :: thesis: verum
end;
hence p | Y is RelStr-yielding by YELLOW_1:def 3; :: thesis: verum