- Spa/Lattice.lean: add the missing space in the PointedLTSeries binder list ((f t : α) (n : ℕ)). - Spa/Lattice/Unit.lean: use rfl instead of refl _, and split the ~200-column longestChain record literal across lines, one field per line. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
23 lines
573 B
Lean4
23 lines
573 B
Lean4
import Spa.Lattice
|
||
|
||
namespace Spa
|
||
|
||
theorem 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
|