reserve i, j, k, l, m, n, t for Nat;

theorem
  k > 0 & k <= n implies n div k >= 1
proof
  assume k > 0 & k <= n;
  then n div k <> 0 by Th12;
  then n div k >= 0 + 1 by NAT_1:13;
  hence thesis;
end;
