reserve a,b,c,d,m,x,n,j,k,l for Nat,
  t,u,v,z for Integer,
  f,F for FinSequence of NAT;
reserve p,q,r,s for real number;
reserve a,b,c,d,m,x,n,k,l for Nat,
  t,z for Integer,
  f,F,G for FinSequence of REAL;
reserve q,r,s for real number;
reserve D for set;

theorem
  l>0 implies ex x st ((a,b) In_Power (k+l)).l = a*x
  proof
    assume l>0;
    then consider n be Nat such that
    A3: l = 1+n by NAT_1:10,14;
    set m=k+1;
    consider x such that
    A4: x = ((m+n) choose n)*(a|^k)*(b|^n);
    ((a,b) In_Power (k+l)).l = ((m+n) choose n)*(a|^m)*(b|^n) by Lm1,A3
    .= ((m+n) choose n)*(a|^1*a|^k)*(b|^n) by NEWTON:8
    .= a*x by A4;
    hence thesis;
  end;
