AFTD Auto-Formalizing Theoretical Domains

Cslib.HasFresh.to_infinite

instanceimported Lean

HasFresh α implies a computably infinite type.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
instance Cslib.HasFresh.to_infinite (α : Type u) [HasFresh α] : Infinite α
Defined in
CSLib, `Cslib.HasFresh.to_infinite`
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 1
  • 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.
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
/-- `HasFresh α` implies a computably infinite type. -/
instance Cslib.HasFresh.to_infinite (α : Type u) [HasFresh α] : Infinite α := by
  apply Infinite.of_not_fintype
  rintro ⟨elems, _⟩
  grind [fresh_notMem elems]
See it in the graphDiscuss this resultChallenge it