reserve a,b,p,k,l,m,n,s,h,i,j,t,i1,i2 for natural Number;

theorem
  0 < i implies j = i * (j div i) + (j mod i) by INT_1:59;
