∀ {α : Type u} {β : α → Type v} (m : Std.DHashMap.Internal.Raw₀ α β) [inst : BEq α] [inst_1 : Hashable α]
  [inst_2 : LawfulBEq α] {f : (a : α) → β a → Bool} {k : α},
  (↑m).WF → (Std.DHashMap.Internal.Raw₀.filter f m).contains k = Option.any (f k) (m.get? k)