lean_workbook_plus_31411

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

Find the smallest integer greater than $4$ that satisfies $x-1 \equiv 0 \pmod{4}$ and $x \equiv 0 \pmod{3}$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_31411 (x : ℕ) (hx: x > 4) (h1 : x-1 ≡ 0 [ZMOD 4]) (h2 : x ≡ 0 [ZMOD 3]) : x >= 9   :=  by sorry

Source