AFTD Auto-Formalizing Theoretical Domains

Cslib.instHasFreshNat

instanceimported Lean

ℕ has a computable fresh function.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
instance Cslib.instHasFreshNat : HasFresh ℕ
Defined in
CSLib, `Cslib.instHasFreshNat`
Lean proof
By Fabrizio Montesi, Kenny Lau, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Fabrizio Montesi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 4
  • Cslib.HasFresh.ofSuccConstruct a fresh element given a function f with x < f x.
  • Cslib.HasFresh.to_infiniteHasFresh α implies a computably infinite type.
  • Cslib.HasFreshA type α has a computable fresh function if it is always possible, for any finite set of α, to compute a fresh element not in the set.
  • Cslib.instHasFreshOfInfiniteAll infinite types have an associated (at least noncomputable) fresh function. This, in conjunction with HasFresh.to_infinite,…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
/-- `ℕ` has a computable fresh function. -/
instance Cslib.instHasFreshNat : HasFresh ℕ :=
  .ofSucc (· + 1) Nat.lt_add_one
See it in the graphDiscuss this resultChallenge it