reserve d,i,j,k,m,n,p,q,x,k1,k2 for Nat,
  a,c,i1,i2,i3,i5 for Integer;

theorem
  for i,n being Nat st n > 0 holds i |^ n div i = i |^ n / i
proof
  let i,n be Nat;
  assume n > 0;
  then i |^ n mod i = 0 by Th36;
  hence thesis by Th63;
end;
