reserve k,m,n for Nat,
  i1,i2,i3 for Integer,
  e for set;

theorem Th2:
  n mod k < k - 1 implies (n+1) mod k = (n mod k) + 1 by NAT_D:70;
