`BookProof.ComputableScarcity.uncountable_natFun` : ¬ Countable (ℕ → ℕ)

Proved

BookProof.ComputableScarcity.uncountable_natFun

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterComputableScarcity.

BookProof.ComputableScarcity.uncountable_natFun : ¬ Countable (ℕ → ℕ)

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

Preamble

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



open Nat.Partrec

open Classical

Formal statement

theorem BookProof.ComputableScarcity.uncountable_natFun : ¬ Countable (ℕ → ℕ) := by sorry

View graph