
theorem Th6:
  for L be right_zeroed non empty addLoopStr for p,q be
  Polynomial of L for n be Element of NAT st n >= len p & n >= len q holds n >=
  len (p+q)
proof
  let L be right_zeroed non empty addLoopStr;
  let p,q be Polynomial of L;
  let n be Element of NAT;
  assume n >= len p & n >= len q;
  then n is_at_least_length_of p & n is_at_least_length_of q by POLYNOM3:23;
  then n is_at_least_length_of p+q by POLYNOM3:24;
  hence thesis by POLYNOM3:23;
end;
