lean_workbook_plus_10181
ProvedProve by induction on . The base case is obvious. For inductive step, suppose the problem is true when where , we'll prove that it's true when .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_10181 (P : ℕ → Prop) (base : P 0) (induction : ∀ m : ℕ, P m → P (m + 1)) : ∀ n : ℕ, P n := by sorry
Source