set SGM = SgmX ((BagOrder O),(Support p));
set PR = Polynom-Ring (O,F_Real);
consider S being FinSequence of (Polynom-Ring (O,F_Real)) such that
A1:
( Subst (p,x,s) = Sum S & len (SgmX ((BagOrder O),(Support p))) = len S )
and
A2:
for i being Nat st i in dom S holds
S . i = (p . ((SgmX ((BagOrder O),(Support p))) /. i)) * (Subst (((SgmX ((BagOrder O),(Support p))) /. i),x,s))
by Def4;
defpred S1[ Nat] means for w being Polynomial of O,F_Real st O <= len S & w = Sum (S | O) holds
w is INT -valued ;
A3:
S1[ 0 ]
A4:
for i being Nat st S1[i] holds
S1[i + 1]
proof
let i be
Nat;
( S1[i] implies S1[i + 1] )
assume A5:
S1[
i]
;
S1[i + 1]
set i1 =
i + 1;
let w be
Polynomial of
O,
F_Real;
( i + 1 <= len S & w = Sum (S | (i + 1)) implies w is INT -valued )
assume A6:
(
i + 1
<= len S &
w = Sum (S | (i + 1)) )
;
w is INT -valued
A7:
i < len S
by A6, NAT_1:13;
A8:
i + 1
in dom S
by A6, FINSEQ_3:25, NAT_1:11;
S . (i + 1) = (p . ((SgmX ((BagOrder O),(Support p))) /. (i + 1))) * (Subst (((SgmX ((BagOrder O),(Support p))) /. (i + 1)),x,s))
by A8, A2;
then reconsider Si1 =
S /. (i + 1) as
INT -valued Polynomial of
O,
F_Real by A8, PARTFUN1:def 6;
reconsider SU =
Sum (S | i) as
Polynomial of
O,
F_Real by POLYNOM1:def 11;
A9:
SU is
INT -valued
by A5, A7;
S | (i + 1) = (S | i) ^ <*(S /. (i + 1))*>
by A6, FINSEQ_5:82;
then w =
(Sum (S | i)) + (Sum <*(S /. (i + 1))*>)
by A6, RLVECT_1:41
.=
(Sum (S | i)) + (S /. (i + 1))
by RLVECT_1:44
.=
SU + Si1
by POLYNOM1:def 11
;
hence
w is
INT -valued
by A9;
verum
end;
for i being Nat holds S1[i]
from NAT_1:sch 2(A3, A4);
then
S1[ len S]
;
hence
Subst (p,x,s) is INT -valued
by A1; verum