
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 holds Upper_Support(p,T,0) = {} & Lower_Support(p,T,0)
  = Support p
proof
  let n be Ordinal, T be connected TermOrder of n, L be add-associative
right_zeroed right_complementable non empty addLoopStr, p be Polynomial of n,
  L;
  set u = Upper_Support(p,T,0);
  0 <= card(Support p);
  then card u = 0 by Def2;
  hence u = {};
  hence thesis;
end;
