Cslib.HasFresh.ofSucc
defimported Lean
Construct a fresh element given a function f with x < f x.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in @[implicit_reducible] def Cslib.HasFresh.ofSucc {α : Type u} [Inhabited α] [SemilatticeSup α] (f : α → α) (hf : ∀ x, x < f x) : HasFresh α
- Defined in
- CSLib, `Cslib.HasFresh.ofSucc`
- 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.Cslib.HasFresh.ofSucc← Cslib.HasFresh.ofSucc (Cslib/Foundations/Data/HasFresh.lean:61): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- Cslib.HasFresh.to_infinite
HasFresh αimplies a computably infinite type. - Cslib.HasFreshA type
αhas a computablefreshfunction 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,…
- Cslib.HasFresh.to_infinite
- Used by 3
- Cslib.instHasFreshNat
ℕhas a computable fresh function. - Cslib.instHasFreshInt
ℤhas a computable fresh function. - Cslib.instHasFreshRat
ℚhas a computable fresh function.
- Cslib.instHasFreshNat
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in /-- Construct a fresh element given a function `f` with `x < f x`. -/ @[implicit_reducible] def Cslib.HasFresh.ofSucc {α : Type u} [Inhabited α] [SemilatticeSup α] (f : α → α) (hf : ∀ x, x < f x) : HasFresh α where fresh s := if hs : s.Nonempty then f (s.sup' hs id) else default fresh_notMem s h := if hs : s.Nonempty then not_le_of_gt (hf (s.sup' hs id)) <| by rw [dif_pos hs] at h; exact s.le_sup' id h else hs ⟨_, h⟩