reserve r,t for Real;
reserve i for Integer;
reserve k,n for Nat;
reserve p for Polynomial of F_Real;
reserve e for Element of F_Real;
reserve L for non empty ZeroStr;
reserve z,z0,z1,z2 for Element of L;

theorem Th27:
  for L being right_zeroed non empty addLoopStr
  for z0,z1 being Element of L holds
  <%z0%> + <%z1%> = <%z0+z1%>
  proof
    let L be right_zeroed non empty addLoopStr;
    let z0,z1 be Element of L;
    set p = <%z0%>;
    set q = <%z1%>;
    set r = <%z0+z1%>;
    let n be Element of NAT;
    per cases;
    suppose n = 0;
      then p.n = z0 & q.n = z1 & r.n = z0+z1 by POLYNOM5:32;
      hence thesis by NORMSP_1:def 2;
    end;
    suppose n > 0;
      then n >= 0+1 by NAT_1:13;
      then
A1:   p.n = 0.L & q.n = 0.L & r.n = 0.L by POLYNOM5:32;
      0.L + 0.L = 0.L by RLVECT_1:def 4;
      hence thesis by A1,NORMSP_1:def 2;
    end;
  end;
