per cases ( a = 0 or a <> 0 ) ;
suppose a = 0 ; :: thesis: (a mod b) mod (b * c) = a mod b
hence (a mod b) mod (b * c) = a mod b ; :: thesis: verum
end;
suppose a <> 0 ; :: thesis: (a mod b) mod (b * c) = a mod b
then reconsider a = a as non zero Nat ;
per cases ( b = 0 or b <> 0 ) ;
suppose b = 0 ; :: thesis: (a mod b) mod (b * c) = a mod b
hence (a mod b) mod (b * c) = a mod b ; :: thesis: verum
end;
suppose b <> 0 ; :: thesis: (a mod b) mod (b * c) = a mod b
then reconsider b = b as non zero Nat ;
b <= b * c by NEWTON:33, NAT_1:14;
hence (a mod b) mod (b * c) = a mod b ; :: thesis: verum
end;
end;
end;
end;