reserve k, m, n, p, K, N for Nat;
reserve i for Integer;
reserve x, y, eps for Real;
reserve seq, seq1, seq2 for Real_Sequence;
reserve sq for FinSequence of REAL;

theorem Th10:
  for n holds bseq(0).n=1
proof
  let n;
  thus bseq(0).n = (n choose 0)*(n ^ (-0)) by Def2
    .= 1*(n ^ (-0)) by NEWTON:19
    .= 1 by POWER:24;
end;
