let I be non empty set ; :: thesis: for S being non empty non void ManySortedSign
for A being MSAlgebra-Family of I,S
for o being OperSymbol of S
for f being Function st f in rng (Frege (A ?. o)) holds
( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) )
let S be non empty non void ManySortedSign ; :: thesis: for A being MSAlgebra-Family of I,S
for o being OperSymbol of S
for f being Function st f in rng (Frege (A ?. o)) holds
( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) )
let A be MSAlgebra-Family of I,S; :: thesis: for o being OperSymbol of S
for f being Function st f in rng (Frege (A ?. o)) holds
( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) )
let o be OperSymbol of S; :: thesis: for f being Function st f in rng (Frege (A ?. o)) holds
( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) )
let f be Function; :: thesis: ( f in rng (Frege (A ?. o)) implies ( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) ) )
A1: dom (A ?. o) = I by PARTFUN1:def 2;
A2: SubFuncs (rng (A ?. o)) = rng (A ?. o)

proof

thus SubFuncs (rng (A ?. o)) c= rng (A ?. o) by FUNCT_6:18; :: according to XBOOLE_0:def 10 :: thesis: rng (A ?. o) c= SubFuncs (rng (A ?. o))
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in rng (A ?. o) or x in SubFuncs (rng (A ?. o)) )
assume A3: x in rng (A ?. o) ; :: thesis: x in SubFuncs (rng (A ?. o))
then ex j being set st
( j in dom (A ?. o) & x = (A ?. o) . j ) by FUNCT_1:def 3;
hence x in SubFuncs (rng (A ?. o)) by A3, FUNCT_6:def 1; :: thesis: verum

end;

assume f in rng (Frege (A ?. o)) ; :: thesis: ( dom f = I & ( for i being Element of I holds f . i in Result (o,(A . i)) ) )
then consider y being set such that
A4: y in dom (Frege (A ?. o)) and
A5: (Frege (A ?. o)) . y = f by FUNCT_1:def 3;
A6: dom (Frege (A ?. o)) = product (doms (A ?. o)) by PARTFUN1:def 2;
then consider g being Function such that
A7: g = y and
dom g = dom (doms (A ?. o)) and
A8: for i being set st i in dom (doms (A ?. o)) holds
g . i in (doms (A ?. o)) . i by A4, CARD_3:def 5;
A9: f = (A ?. o) .. g by A4, A5, A6, A7, Def8;
hence dom f = dom (A ?. o) by PRALG_1:def 17
.= I by PARTFUN1:def 2 ;
:: thesis: for i being Element of I holds f . i in Result (o,(A . i))
let i be Element of I; :: thesis: f . i in Result (o,(A . i))
A10: (A ?. o) . i = Den (o,(A . i)) by Th14;
dom (doms (A ?. o)) = (A ?. o) " (SubFuncs (rng (A ?. o))) by FUNCT_6:def 2
.= dom (A ?. o) by A2, RELAT_1:134 ;
then g . i in (doms (A ?. o)) . i by A8, A1;
then A11: g . i in dom (Den (o,(A . i))) by A1, A10, FUNCT_6:22;
f . i = (Den (o,(A . i))) . (g . i) by A9, A1, A10, PRALG_1:def 17;
then A12: f . i in rng (Den (o,(A . i))) by A11, FUNCT_1:def 3;
rng (Den (o,(A . i))) c= Result (o,(A . i)) by RELAT_1:def 19;
hence f . i in Result (o,(A . i)) by A12; :: thesis: verum