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
@@ -31,7 +31,6 @@ reported last on both databases, so `completeKeys_filter_ge_eq_resolve_end` fini
|
||||
|
||||
namespace FormalConflictRange
|
||||
|
||||
set_option maxHeartbeats 1600000
|
||||
|
||||
/-- The large-gap crossed top subcell of the reversed truncated residual. -/
|
||||
abbrev negCrossTruncRevResidualTopLarge (r : RangeRead) (res : Result) : Prop :=
|
||||
@@ -298,7 +297,8 @@ theorem necessary_above_head_of_residual_top_large {r : RangeRead} {res : Result
|
||||
res.keys.countP (fun x => decide (((x : Key) : WithTop Key) < r.begin.key)) :=
|
||||
List.countP_reverse
|
||||
rw [h1]
|
||||
have h2 : ([k].countP (fun x => decide (((x : Key) : WithTop Key) < r.begin.key))) ≤ 1 := by
|
||||
have h2 : ([k].countP (fun x => decide (((x : Key) : WithTop Key) < r.begin.key))) ≤ 1
|
||||
:= by
|
||||
rw [List.countP_singleton]
|
||||
split <;> omega
|
||||
omega
|
||||
@@ -628,11 +628,13 @@ theorem necessary_gap_of_residual_top_large_finite {r : RangeRead} {res : Result
|
||||
rw [hGnil, hRself, hQself]
|
||||
simp
|
||||
rw [hfiltL, List.filter_append, hre]
|
||||
have hRself : List.filter (fun y : Key => decide ((y : WithTop Key) < ((Q : Key) : WithTop Key))) R = R := by
|
||||
have hRself : List.filter (fun y : Key => decide ((y : WithTop Key) < ((Q : Key) : WithTop
|
||||
Key))) R = R := by
|
||||
rw [List.filter_eq_self]
|
||||
intro x hx
|
||||
exact decide_eq_true (WithTop.coe_lt_coe.mpr (lt_of_le_of_lt (hRleH x hx) hHQ))
|
||||
have hQnil : List.filter (fun y : Key => decide ((y : WithTop Key) < ((Q : Key) : WithTop Key))) [Q] = [] := by
|
||||
have hQnil : List.filter (fun y : Key => decide ((y : WithTop Key) < ((Q : Key) : WithTop
|
||||
Key))) [Q] = [] := by
|
||||
rw [List.filter_eq_nil_iff]
|
||||
intro x hx hlt
|
||||
rw [List.mem_singleton] at hx
|
||||
|
||||
Reference in new issue
Block a user