let a, b be non negative Rational; :: thesis: (numerator a) * (numerator b) >= numerator (a * b)
per cases ( a is zero or b is zero or ( not a is zero & not b is zero ) ) ;
suppose ( a is zero or b is zero ) ; :: thesis: (numerator a) * (numerator b) >= numerator (a * b)
hence (numerator a) * (numerator b) >= numerator (a * b) ; :: thesis: verum
end;
suppose B1: ( not a is zero & not b is zero ) ; :: thesis: (numerator a) * (numerator b) >= numerator (a * b)
then reconsider a = a as positive Rational ;
reconsider b = b as positive Rational by B1;
numerator (a * b) <= (numerator a) * (numerator b) by NUM, NAT_D:7;
hence (numerator a) * (numerator b) >= numerator (a * b) ; :: thesis: verum
end;
end;