reserve x for object;
reserve x0,r,r1,r2,g,g1,g2,p,y0 for Real;
reserve n,m,k,l for Element of NAT;
reserve a,b,d for Real_Sequence;
reserve h,h1,h2 for non-zero 0-convergent Real_Sequence;
reserve c,c1 for constant Real_Sequence;
reserve A for open Subset of REAL;
reserve f,f1,f2 for PartFunc of REAL,REAL;
reserve L for LinearFunc;
reserve R for RestFunc;

theorem Th3:
  (for n holds a.n = 2*n + 1) implies a is increasing sequence of NAT
proof
  assume
A1: for n holds a.n = 2*n + 1;
A2: a is increasing
  proof
    let n be Nat;
A3: n in NAT by ORDINAL1:def 12;
A4: 2*n + 1+0 < 2*n + 1+2 by XREAL_1:8;
    2*n + 1+2 = 2*(n + 1) + 1 .= a.(n + 1) by A1;
    hence a.n < a.(n+1) by A1,A4,A3;
  end;
A5: now
    let x;
    assume x in dom a;
    then reconsider n = x as Element of NAT;
    a.n = 2*n+1 by A1;
    hence a.x in NAT;
  end;
  dom a = NAT by FUNCT_2:def 1;
  hence thesis by A2,A5,FUNCT_2:3;
end;
