Fix all Lean build warnings

- Update deprecated lemmas (ite_eq_left/right, ENat casts, List.Sublist, ...)
- Replace push_neg with push Not and resolve unused-variable warnings
- Convert flexible simp/simp_all calls to explicit simp only lists
- Remove unscoped maxHeartbeats options, open scoped Classical, and unused tactics
- Add missing module docstrings and clean up style linter hits
- Wrap over-long lines and flatten the deeply nested
  minimal_conflictRangeClosedForm_total proof

`lake build` now completes with zero warnings.
This commit is contained in:
andrew committed 2026-11-17 10:04:35 -05:00
1 parent a54a5f82f8
commit af318a7d32
51 files changed
+2542 -1357

No files matched your search

@@ -96,7 +96,7 @@ theorem compat_of_pad_top {r : RangeRead} {res : Result} {F : List Key} {m : ℕ
have hDget? : dbw.keys[res.keys.length]? = some (F.head hFne) := by
change (res.keys ++ F)[res.keys.length]? = some (F.head hFne)
rw [List.getElem?_append]
rw [if_neg (not_lt.mpr (le_refl _)), Nat.sub_self]
rw [ite_eq_right (not_lt.mpr (le_refl _)), Nat.sub_self]
rw [List.getElem?_eq_getElem (by rw [hFlen]; omega), List.head_eq_getElem hFne]
have hre : resolve dbw r.end_ = ((F.head hFne : Key) : WithTop Key) := by
rw [resolve, ite_eq_right (by rw [hanchorE]; omega)]
@@ -217,7 +217,7 @@ theorem exists_witness_below_head_of_negCross_trunc_strict_top {r : RangeRead} {
have hD'get? : (dbw.insert k hkdb).keys[res.keys.length + 1]? = some (F.head hFne) := by
rw [hins_keys, List.getElem?_cons_succ]
rw [List.getElem?_append]
rw [if_neg (not_lt.mpr (le_refl _)), Nat.sub_self]
rw [ite_eq_right (not_lt.mpr (le_refl _)), Nat.sub_self]
rw [List.getElem?_eq_getElem (by rw [hFlen]; omega), List.head_eq_getElem hFne]
have hre' : resolve (dbw.insert k hkdb) r.end_ =
((F.head hFne : Key) : WithTop Key) := by
@@ -396,7 +396,7 @@ theorem exists_witness_above_begin_of_negCross_trunc_strict_top {r : RangeRead}
have hD'get? : (dbw.erase k).keys[res.keys.length - 1]? =
some (res.keys.getLast hne) := by
rw [hD', List.getElem?_append]
rw [if_pos (by omega : res.keys.length - 1 < res.keys.length)]
rw [ite_eq_left (by omega : res.keys.length - 1 < res.keys.length)]
rw [List.getElem?_eq_getElem (by omega : res.keys.length - 1 < res.keys.length)]
congr 1
rw [List.getLast_eq_getElem hne]
@@ -511,7 +511,7 @@ theorem minimal_fullRange_of_negCross_trunc_strict_top {r : RangeRead} {res : Re
rw [toggle_eq_erase_of_mem hkdb]; exact hnot⟩
/-- The compact closed form for the sentinel-end strict cell. -/
noncomputable def closedFormNegCrossTruncStrictTop (r : RangeRead) (_res : Result) :
noncomputable def closedFormNegCrossTruncStrictTop (_r : RangeRead) (_res : Result) :
ConflictRange :=
⟨(([] : Key) : WithTop Key), (⊤ : WithTop Key)⟩