reserve i,j,n,n1,n2,m,k,l,u for Nat,
        i1,i2,i3,i4,i5,i6 for Element of n,
        p,q for n-element XFinSequence of NAT,
        a,b,c,d,e,f for Integer;

theorem Th6:
  for n being Ordinal,L being add-associative right_zeroed right_complementable
                              non empty addLoopStr,
      p being Polynomial of n, L, b being bag of n st b in Support p holds
  degree p >= degree b
proof
  let n be Ordinal, L be add-associative right_zeroed right_complementable
                         non empty addLoopStr,
      p be Polynomial of n, L, b be bag of n;
  assume
A1: b in Support p;
  then Support p <>{} by XBOOLE_0:def 1;
  then p <> 0_(n,L) by POLYNOM7:1;
  hence thesis by A1,Def3;
end;
