AFTD Auto-Formalizing Theoretical Domains

Cslib.HasFresh

classimported Lean

A 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.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
class Cslib.HasFresh (α : Type u)
Defined in
CSLib, `Cslib.HasFresh`
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
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
/-- A 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. -/
class Cslib.HasFresh (α : Type u) where
  /-- Given a finite set, returns an element not in the set. -/
  fresh : Finset α → α
  /-- Proof that `fresh` returns a fresh element for its input set. -/
  fresh_notMem (s : Finset α) : fresh s ∉ s

attribute [grind <=] Cslib.HasFresh.fresh_notMem
See it in the graphDiscuss this resultChallenge it