From 8db3969f87796ab4233e8dd70227bcbcc70aa9cd Mon Sep 17 00:00:00 2001 From: Kim Morrison <477956+kim-em@users.noreply.github.com> Date: Thu, 16 Oct 2025 15:00:42 +1100 Subject: [PATCH] chore: remove bad grind _=_ annotation on List.contains_iff_mem (#10800) --- src/Init/Data/Array/Lemmas.lean | 2 +- src/Init/Data/List/Lemmas.lean | 2 +- src/Init/Data/Vector/Lemmas.lean | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/Init/Data/Array/Lemmas.lean b/src/Init/Data/Array/Lemmas.lean index c5ec6e3b13..0a2e77b5b2 100644 --- a/src/Init/Data/Array/Lemmas.lean +++ b/src/Init/Data/Array/Lemmas.lean @@ -3761,7 +3761,7 @@ theorem contains_iff_exists_mem_beq [BEq α] {xs : Array α} {a : α} : -- With `LawfulBEq α`, it would be better to use `contains_iff_mem` directly. grind_pattern contains_iff_exists_mem_beq => xs.contains a -@[grind _=_] +@[grind =] theorem contains_iff_mem [BEq α] [LawfulBEq α] {xs : Array α} {a : α} : xs.contains a ↔ a ∈ xs := by simp diff --git a/src/Init/Data/List/Lemmas.lean b/src/Init/Data/List/Lemmas.lean index 1f8912b077..d0e9bc9057 100644 --- a/src/Init/Data/List/Lemmas.lean +++ b/src/Init/Data/List/Lemmas.lean @@ -2932,7 +2932,7 @@ theorem contains_iff_exists_mem_beq [BEq α] {l : List α} {a : α} : -- With `LawfulBEq α`, it would be better to use `contains_iff_mem` directly. grind_pattern contains_iff_exists_mem_beq => l.contains a -@[grind _=_] +@[grind =] theorem contains_iff_mem [BEq α] [LawfulBEq α] {l : List α} {a : α} : l.contains a ↔ a ∈ l := by simp diff --git a/src/Init/Data/Vector/Lemmas.lean b/src/Init/Data/Vector/Lemmas.lean index ecc418ca90..476718ef98 100644 --- a/src/Init/Data/Vector/Lemmas.lean +++ b/src/Init/Data/Vector/Lemmas.lean @@ -2698,7 +2698,7 @@ theorem contains_iff_exists_mem_beq [BEq α] {xs : Vector α n} {a : α} : -- With `LawfulBEq α`, it would be better to use `contains_iff_mem` directly. grind_pattern contains_iff_exists_mem_beq => xs.contains a -@[grind _=_] +@[grind =] theorem contains_iff_mem [BEq α] [LawfulBEq α] {xs : Vector α n} {a : α} : xs.contains a ↔ a ∈ xs := by simp