let a, b be Rational; :: thesis: ( a * b is integer iff ( denominator b divides numerator a & denominator a divides numerator b ) )
( denominator b divides numerator a & denominator a divides numerator b implies a * b is integer )
proof
assume B1: ( denominator b divides numerator a & denominator a divides numerator b ) ; :: thesis: a * b is integer
then reconsider x = (numerator a) / (denominator b) as Integer by NEWTON05:1;
reconsider y = (numerator b) / (denominator a) as Integer by NEWTON05:1, B1;
( a = (numerator a) / (denominator a) & b = (numerator b) / (denominator b) ) ;
then x * y = a * b ;
hence a * b is integer ; :: thesis: verum
end;
hence ( a * b is integer iff ( denominator b divides numerator a & denominator a divides numerator b ) ) by DDN; :: thesis: verum