`BookProof.ComputableScarcity.exists_code_of_computable` {f : ℕ → ℕ} (hf : Computable f) : ∃ c : Code, evalTotal c = f

Proved

BookProof.ComputableScarcity.exists_code_of_computable

by leonardopedro · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterComputableScarcity.

BookProof.ComputableScarcity.exists_code_of_computable {f : ℕ → ℕ} (hf : Computable f) : ∃ c : Code, evalTotal c = f

Formalization note: Lean 4 identifier BookProof.ComputableScarcity.exists_code_of_computable.

Preamble

-- Generated from ChapterComputableScarcity.lean — theorem BookProof.ComputableScarcity.exists_code_of_computable
import Mathlib
import Definitions.Def_ChapterComputableScarcity
open BookProof.ComputableScarcity



open Nat.Partrec

open Classical

Formal statement

theorem BookProof.ComputableScarcity.exists_code_of_computable {f : ℕ → ℕ} (hf : Computable f) :
    ∃ c : Code, evalTotal c = f := by sorry

View graph