reserve x for set;
reserve a, b, c for Real;
reserve m, n, m1, m2 for Nat;
reserve k, l for Integer;
reserve p, q for Rational;
reserve s1, s2 for Real_Sequence;

theorem
  a > 0 implies a #R 1 = a
proof
  set s = seq_const 1;
  reconsider s as Rational_Sequence;
  s.0 = 1 by SEQ_1:57;
  then
A1: lim s = 1 by SEQ_4:26;
  assume
A2: a > 0;
A3: now
    let n be Nat;
    reconsider nn=n as Element of NAT by ORDINAL1:def 12;
    thus a #Q s .n = a #Q (s.nn) by Def5
      .= a by A2,Th48,SEQ_1:57;
  end;
  a in REAL by XREAL_0:def 1;
  then
A4: a #Q s is constant by A3,VALUED_0:def 18;
  a #Q s .0 = a by A3;
  then lim (a #Q s) = a by A4,SEQ_4:26;
  hence thesis by A2,A1,A4,Def6;
end;
