theorem Th31:
  m = denominator p & i = numerator p implies
  denominator(-p) = m div ( (-i) gcd m ) &
  numerator(-p) = (-i) div ( (-i) gcd m )
  proof
    p = numerator p / denominator p by RAT_1:15;
    hence thesis by Th17;
  end;
