let a be non zero Integer; :: thesis: for b being Integer holds
( a divides b iff a divides b mod a )

let b be Integer; :: thesis: ( a divides b iff a divides b mod a )
thus ( a divides b implies a divides b mod a ) :: thesis: ( a divides b mod a implies a divides b )
proof end;
assume B1: a divides b mod a ; :: thesis: a divides b
per cases ( b is zero or not b is zero ) ;
end;