diff options
Diffstat (limited to 'LeanAStar')
| -rw-r--r-- | LeanAStar/Finite.lean | 2 | ||||
| -rw-r--r-- | LeanAStar/HashSet.lean | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/LeanAStar/Finite.lean b/LeanAStar/Finite.lean index cbd8ee3..e028cf6 100644 --- a/LeanAStar/Finite.lean +++ b/LeanAStar/Finite.lean @@ -164,7 +164,7 @@ protected theorem Finite.set_worker_size (α : Type u) [Finite α] [BEq α] [Has split case h_1 m isLt he => simp at he - simp[Std.HashSet.size_insert, Std.HashSet.mem_iff_contains, h₂, he] + simp[Std.HashSet.size_insert, h₂, he] case h_2 m isLt he => simp have h₄ : m < n := have : n = m.succ := Fin.val_eq_of_eq he; this.substr (Nat.lt_succ_self m) diff --git a/LeanAStar/HashSet.lean b/LeanAStar/HashSet.lean index 87f351a..31691ed 100644 --- a/LeanAStar/HashSet.lean +++ b/LeanAStar/HashSet.lean @@ -23,7 +23,7 @@ protected theorem size_le_finite_worker_size (α : Type u) [Finite α] [BEq α] cases h₄ : set.contains (Finite.nth ⟨0,h₂⟩) case false => have h₅ : ∀(o : Fin (Finite.cardinality α)), Finite.nth o ∉ set := by - simp[←Bool.not_eq_true, ←HashSet.mem_iff_contains] at h₄ + simp[←Bool.not_eq_true] at h₄ intro o cases o case mk o ho => |