theorem Th30: :: GROEB_3:30

for n being Ordinal
for T being connected TermOrder of n
for L being non empty right_complementable add-associative right_zeroed addLoopStr
for p being Polynomial of n,L
for i being Element of NAT st 1 <= i & i <= card (Support p) holds
HT (p,T) in Support (Up (p,T,i))