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
  m <> 0 implies
  denominator(i/m) = m / ( i gcd m ) &
  numerator(i/m) = i / ( i gcd m )
  proof
    assume
A1: m <> 0;
    hence denominator(i/m) = m div ( i gcd m ) by Th15
    .= m / ( i gcd m ) by Th8;
    thus numerator(i/m) = i div ( i gcd m ) by A1,Th15
    .= i / ( i gcd m ) by Th7;
  end;
