AFTD Auto-Formalizing Theoretical Domains

Cslib.HasFresh.fresh_exists

theoremverifiedformalizationimported Lean

An existential version of the HasFresh typeclass. This is useful for the sake of brevity in proofs.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
theorem Cslib.HasFresh.fresh_exists {α : Type u} [HasFresh α] (s : Finset α) : ∃ a, a ∉ s
Formalizes
CSLib, `Cslib.HasFresh.fresh_exists`
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
Classical.choiceQuot.soundpropext
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.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
/-- An existential version of the `HasFresh` typeclass. This is useful for the sake of brevity in proofs. -/
theorem Cslib.HasFresh.fresh_exists {α : Type u} [HasFresh α] (s : Finset α) : ∃ a, a ∉ s :=
  ⟨fresh s, fresh_notMem s⟩
See it in the graphDiscuss this resultChallenge it