
theorem Th22:
  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,card(Support p)) = Support p &
  Lower_Support(p,T,card(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,card(Support p));
  u c= Support p & card u = card(Support p) by Def2;
  hence u = Support p by CARD_2:102;
  hence thesis by XBOOLE_1:37;
end;
