DibyashanuPati/PhysLean
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

refactor: More spellings

Browse source
This commit is contained in:
jstoobysmith 2025-02-10 10:59:09 +00:00
parent dc5b63c4a7
commit b4333f038a
10 changed files with 21 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

2
HepLean/Mathematics/List.lean
View file

@ -755,7 +755,7 @@ lemma eraseIdx_insertionSort_fin {I : Type} (le1 : I → I → Prop) [DecidableR
= List.insertionSort le1 (r.eraseIdx n) :=
eraseIdx_insertionSort le1 n.val r (Fin.prop n)
/-- Given a list `i :: l` the left-most minimial position `a` of `i :: l` wrt `r`.
/-- Given a list `i :: l` the left-most minimal position `a` of `i :: l` wrt `r`.
That is the first position
of `l` such that for every element `(i :: l)[b]` before that position
`r ((i :: l)[b]) ((i :: l)[a])` is not true. The use of `i :: l` here