Danila Fedorin
e2df847139
Convert every theorem to lemma (mathlib's default) except the headline results a reader of each module seeks out: analyze_correct (Forward/Sign/Constant), aFix_eq/aFix_le (Fixedpoint), trace (Language), and Stmt.cfg_sufficient (Language/Properties). lemma and theorem are interchangeable keywords, so no references change. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
23 lines
571 B
Lean4
23 lines
571 B
Lean4
import Spa.Lattice
|
||
|
||
namespace Spa
|
||
|
||
lemma boundedChains_of_subsingleton (α : Type*) [Preorder α] [Subsingleton α]
|
||
(n : ℕ) : BoundedChains α n := fun c => by
|
||
by_contra hc
|
||
push_neg at hc
|
||
exact (c.step ⟨0, by omega⟩).ne (Subsingleton.elim _ _)
|
||
|
||
instance : FiniteHeightLattice PUnit where
|
||
bot := PUnit.unit
|
||
top := PUnit.unit
|
||
height := 0
|
||
longestChain :=
|
||
{ series := RelSeries.singleton _ PUnit.unit
|
||
head_series := rfl
|
||
last_series := rfl
|
||
length_series := rfl }
|
||
chains_bounded := boundedChains_of_subsingleton PUnit 0
|
||
|
||
end Spa
|