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 Th6:
  n divides i implies i div n = i / n
  proof
    per cases;
    suppose n = 0;
      hence thesis;
    end;
    suppose
A1:   n <> 0;
      assume
A2:   n divides i;
      i mod n = 0 by A1,A2,INT_1:62;
      hence thesis by PEPIN:63;
    end;
  end;
