
theorem
  for n being Ordinal, T being connected TermOrder of n, L being
  add-associative right_zeroed right_complementable non empty addLoopStr, p
  being Polynomial of n,L, i being Element of NAT st i <= card(Support p) holds
Support Up(p,T,i) = Upper_Support(p,T,i) & Support Low(p,T,i) = Lower_Support(p
  ,T,i) by Lm3;
