per cases ( a = 0 or a <> 0 ) ;
suppose a = 0 ; :: thesis: (a * b) mod a is zero
hence (a * b) mod a is zero ; :: thesis: verum
end;
suppose a <> 0 ; :: thesis: (a * b) mod a is zero
hence (a * b) mod a is zero by LmX; :: thesis: verum
end;
end;