
theorem
  for L be add-associative right_zeroed right_complementable 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 add-associative right_zeroed right_complementable non empty
  addLoopStr;
  let p,q be Polynomial of L;
  len q = len (-q) by Th8;
  hence thesis by Th6;
end;
