reserve p,q for Rational;
reserve g,m,m1,m2,n,n1,n2 for Nat;
reserve i,i1,i2,j,j1,j2 for Integer;

theorem
  0 < m & m*n divides m implies n = 1
  proof
    assume that
A1: 0 < m and
A2: m*n divides m;
    m divides m*n;
    then m = m*n or m = -m*n by A2,INT_2:11;
    hence n = 1 by A1,XCMPLX_1:7;
  end;
