DanilaFe/agda-spa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rename longest_chain to longestChain for convention

Browse Source
This commit is contained in:
Danila Fedorin
2026-06-23 11:49:45 -05:00
parent 5e0c002fd5
commit 21b2e3dd98
5 changed files with 17 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
lean/Spa/Isomorphism.lean
View File

@@ -13,13 +13,13 @@ def FiniteHeightLattice.transport {α β : Type*} [Lattice α] [Lattice β]
bot := f ⊥
top := f ⊤
height := I.height
longest_chain :=
longestChain :=
{ series :=
I.longest_chain.series.map f
I.longestChain.series.map f
(hf.strictMono_of_injective (Function.LeftInverse.injective hgf))
head_series := congrArg f I.longest_chain.head_series
last_series := congrArg f I.longest_chain.last_series
length_series := I.longest_chain.length_series }
head_series := congrArg f I.longestChain.head_series
last_series := congrArg f I.longestChain.last_series
length_series := I.longestChain.length_series }
chains_bounded := fun c =>
I.chains_bounded
(c.map g (hg.strictMono_of_injective (Function.LeftInverse.injective hfg)))