set h = f [#] c;

A1: dom (f [#] c) = dom f by Def39;

rng (f [#] c) c= C_PFuncs (DOMS Y)

A1: dom (f [#] c) = dom f by Def39;

rng (f [#] c) c= C_PFuncs (DOMS Y)

proof

hence
f [#] c is PartFunc of X,(C_PFuncs (DOMS Y))
by A1, RELSET_1:4; :: thesis: verum
let y be object ; :: according to TARSKI:def 3 :: thesis: ( not y in rng (f [#] c) or y in C_PFuncs (DOMS Y) )

assume y in rng (f [#] c) ; :: thesis: y in C_PFuncs (DOMS Y)

then consider x being object such that

A2: x in dom (f [#] c) and

A3: (f [#] c) . x = y by FUNCT_1:def 3;

A4: (f [#] c) . x = c (#) (f . x) by A2, Def39;

then reconsider y = y as Function by A3;

A5: rng y c= COMPLEX by A3, A4, XCMPLX_0:def 2;

f . x in Y by A1, A2, PARTFUN1:4;

then dom (f . x) in { (dom m) where m is Element of Y : verum } ;

then A6: dom (f . x) c= DOMS Y by ZFMISC_1:74;

dom y = dom (f . x) by A3, A4, VALUED_1:def 5;

then y is PartFunc of (DOMS Y),COMPLEX by A6, A5, RELSET_1:4;

hence y in C_PFuncs (DOMS Y) by Def8; :: thesis: verum

end;assume y in rng (f [#] c) ; :: thesis: y in C_PFuncs (DOMS Y)

then consider x being object such that

A2: x in dom (f [#] c) and

A3: (f [#] c) . x = y by FUNCT_1:def 3;

A4: (f [#] c) . x = c (#) (f . x) by A2, Def39;

then reconsider y = y as Function by A3;

A5: rng y c= COMPLEX by A3, A4, XCMPLX_0:def 2;

f . x in Y by A1, A2, PARTFUN1:4;

then dom (f . x) in { (dom m) where m is Element of Y : verum } ;

then A6: dom (f . x) c= DOMS Y by ZFMISC_1:74;

dom y = dom (f . x) by A3, A4, VALUED_1:def 5;

then y is PartFunc of (DOMS Y),COMPLEX by A6, A5, RELSET_1:4;

hence y in C_PFuncs (DOMS Y) by Def8; :: thesis: verum