set p = c1 *' c2;
now for b being bag of n st b <> EmptyBag n holds
(c1 *' c2) . b = 0. Llet b be
bag of
n;
( b <> EmptyBag n implies (c1 *' c2) . b = 0. L )assume A1:
b <> EmptyBag n
;
(c1 *' c2) . b = 0. Lconsider s being
FinSequence of
L such that A2:
(c1 *' c2) . b = Sum s
and A3:
len s = len (decomp b)
and A4:
for
k being
Element of
NAT st
k in dom s holds
ex
b1,
b2 being
bag of
n st
(
(decomp b) /. k = <*b1,b2*> &
s /. k = (c1 . b1) * (c2 . b2) )
by POLYNOM1:def 10;
A5:
dom s =
Seg (len (decomp b))
by A3, FINSEQ_1:def 3
.=
dom (decomp b)
by FINSEQ_1:def 3
;
A6:
now for k being Element of NAT st k in dom s holds
s /. k = 0. Llet k be
Element of
NAT ;
( k in dom s implies s /. k = 0. L )assume A7:
k in dom s
;
s /. k = 0. Lthen consider b1,
b2 being
bag of
n such that A8:
(decomp b) /. k = <*b1,b2*>
and A9:
s /. k = (c1 . b1) * (c2 . b2)
by A4;
consider b19,
b29 being
bag of
n such that A10:
(decomp b) /. k = <*b19,b29*>
and A11:
b = b19 + b29
by A5, A7, PRE_POLY:68;
A12:
b2 =
<*b19,b29*> . 2
by A8, A10
.=
b29
;
b1 =
<*b19,b29*> . 1
by A8, A10
.=
b19
;
then A13:
(
b1 <> EmptyBag n or
b2 <> EmptyBag n )
by A1, A11, A12, PRE_POLY:53;
hence
s /. k = 0. L
;
verum end; hence
(c1 *' c2) . b = 0. L
;
verum end;
hence
c1 *' c2 is Constant
by POLYNOM7:def 7; verum