lean_workbook_plus_55442
ProvedFind all functions that verify the following two conditions:\n(i) for each pair of integers with one has ;\n(ii) for each pair of integers there exists an integer such that .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_55442 : ∃ f : ℤ → ℝ, (∀ m n : ℤ, m < n → f m < f n) ∧ (∀ m n : ℤ, ∃ k : ℤ, f m - f n = f k) := by sorry
Source