per cases ( ( a <> 0 & b <> 0 ) or a = 0 or ( b = 0 & a <> 0 ) ) ;
suppose A0: ( a <> 0 & b <> 0 ) ; :: thesis: a / (a gcd b) is integer
a gcd b divides a by INT_2:def 2;
then consider k being Integer such that
A1: a = (a gcd b) * k ;
a / (a gcd b) = k by A0, A1, XCMPLX_1:89;
hence a / (a gcd b) is integer ; :: thesis: verum
end;
suppose a = 0 ; :: thesis: a / (a gcd b) is integer
hence a / (a gcd b) is integer ; :: thesis: verum
end;
suppose B1: ( b = 0 & a <> 0 ) ; :: thesis: a / (a gcd b) is integer
then reconsider b = b as zero Integer ;
reconsider a = a as non zero Integer by B1;
a / (a gcd b) = a / |.a.| by INT_2:12, NEWTON02:3;
hence a / (a gcd b) is integer by Lemma1; :: thesis: verum
end;
end;