Compare commits

...

2 Commits

Author SHA1 Message Date
Kim Morrison
b99f3c336b fix namespace 2025-06-02 22:57:50 +10:00
Kim Morrison
f3e42d0be9 chore: adjustments to grind lemmas for List.Pairwise 2025-06-02 22:32:17 +10:00

View File

@@ -211,6 +211,7 @@ theorem pairwise_append_comm {R : αα → Prop} (s : ∀ {x y}, R x y →
@[grind] theorem Pairwise.take {l : List α} {i : Nat} (h : List.Pairwise R l) : List.Pairwise R (l.take i) :=
h.sublist (take_sublist _ _)
@[grind =]
theorem pairwise_iff_forall_sublist : l.Pairwise R ( {a b}, [a,b] <+ l R a b) := by
induction l with
| nil => simp
@@ -268,6 +269,8 @@ theorem pairwise_of_forall_mem_list {l : List α} {r : αα → Prop} (h :
/-! ### Nodup -/
@[grind =] theorem nodup_iff_pairwise_ne : List.Nodup l List.Pairwise (· ·) l := Iff.rfl
@[simp, grind]
theorem nodup_nil : @Nodup α [] :=
Pairwise.nil