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:
1 parent
a54a5f82f8
commit
af318a7d32
51 files changed
+2542
-1357
No files matched your search
@@ -529,7 +529,7 @@ theorem resolve_begin_eq_head_of_append_ge_begin {db : DB} {r : RangeRead} {res
|
||||
have hlt : (r.begin.anchor db).toNat < db.keys.length := by rw [htoNat]; exact hpos
|
||||
have hopt0 : db.keys[0]? = some (res.keys.head hne) := by
|
||||
rw [hdb, List.getElem?_append]
|
||||
rw [if_pos (List.length_pos_of_ne_nil hne)]
|
||||
rw [ite_eq_left (List.length_pos_of_ne_nil hne)]
|
||||
rw [← List.head?_eq_getElem?]
|
||||
exact List.head?_eq_some_head hne
|
||||
have hopt : db.keys[(r.begin.anchor db).toNat]? = some (res.keys.head hne) := by
|
||||
@@ -696,7 +696,7 @@ theorem exists_witness_negCross_trunc_nonclamp_nonposEnd {r : RangeRead} {res :
|
||||
have hDget? : dbw.keys[res.keys.length]? = some (F.head hFne) := by
|
||||
change D[res.keys.length]? = some (F.head hFne)
|
||||
rw [hD, 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 [hanchor_end]; omega)]
|
||||
@@ -779,7 +779,7 @@ theorem exists_witness_negCross_trunc_nonclamp_nonposEnd {r : RangeRead} {res :
|
||||
rw [hanchor_end', hEqInt, Int.toNat_natCast]
|
||||
have hD'get? : (dbw.erase k).keys[res.keys.length - 1]? = some last := 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 [hlast, List.getLast_eq_getElem hne]
|
||||
@@ -809,7 +809,8 @@ theorem exists_witness_negCross_trunc_nonclamp_nonposEnd {r : RangeRead} {res :
|
||||
exact ⟨fun h => h.2, fun h => ⟨hhead_le_all x hx, h⟩⟩]
|
||||
conv_lhs => rw [← List.dropLast_append_getLast hne, hlast]
|
||||
rw [List.filter_append]
|
||||
have hfil : res.keys.dropLast.filter (fun x : Key => decide (x < last)) = res.keys.dropLast := by
|
||||
have hfil : res.keys.dropLast.filter (fun x : Key => decide (x < last)) = res.keys.dropLast :=
|
||||
by
|
||||
rw [List.filter_eq_self]
|
||||
intro x hx
|
||||
rw [decide_eq_true_eq]
|
||||
|
||||
Reference in new issue
Block a user