reserve n,m,k,k1,k2 for Nat;
reserve X for non empty Subset of ExtREAL;
reserve Y for non empty Subset of REAL;
reserve seq for ExtREAL_sequence;
reserve e1,e2 for ExtReal;
reserve rseq for Real_Sequence;

theorem Th35:
  for seq be ExtREAL_sequence st seq is non-decreasing & +infty =
  sup seq holds seq is convergent_to_+infty & lim seq = +infty
proof
  let seq be ExtREAL_sequence;
  assume that
A1: seq is non-decreasing and
A2: +infty = sup seq;
A3: seq is convergent_to_+infty
  proof
    assume not seq is convergent_to_+infty;
    then consider g be Real such that
    0 < g and
A4: for n be Nat ex m be Nat st n<=m & seq.m < g by MESFUNC5:def 9;
    for y be ExtReal st y in rng seq holds y <= g
    proof
      let y be ExtReal;
      assume y in rng seq;
      then consider n be object such that
A5:   n in NAT and
A6:   y=seq.n by FUNCT_2:11;
      reconsider n as Element of NAT by A5;
      consider m be Nat such that
A7:   n<=m and
A8:   seq.m < g by A4;
      seq.n <= seq.m by A1,A7,Th7;
      hence thesis by A6,A8,XXREAL_0:2;
    end;
    then g is UpperBound of rng seq by XXREAL_2:def 1;
    then
A9: sup rng seq <= g by XXREAL_2:def 3;
    g in REAL by XREAL_0:def 1;
    hence contradiction by A2,A9,XXREAL_0:9;
  end;
  then seq is convergent by MESFUNC5:def 11;
  hence thesis by A3,MESFUNC5:def 12;
end;
