per cases ( ( a <> 0 & b <> 0 ) or a = 0 or b = 0 ) ;
suppose A0: ( a <> 0 & b <> 0 ) ; :: thesis: (a lcm b) / (a gcd b) is integer
A1: a gcd b divides a by INT_2:def 2;
a divides a lcm b by INT_2:def 1;
then a gcd b divides a lcm b by A1, INT_2:9;
then consider k being Integer such that
A2: a lcm b = (a gcd b) * k ;
(a lcm b) / (a gcd b) = k by A0, A2, XCMPLX_1:89;
hence (a lcm b) / (a gcd b) is integer ; :: thesis: verum
end;
suppose ( a = 0 or b = 0 ) ; :: thesis: (a lcm b) / (a gcd b) is integer
hence (a lcm b) / (a gcd b) is integer ; :: thesis: verum
end;
end;