∀ {α : Type u} {β : α → Type v} (m : Std.DHashMap.Internal.Raw₀ α β) [inst : BEq α] [inst_1 : Hashable α]
  [inst_2 : LawfulBEq α] {p : (a : α) → β a → Bool},
  (↑m).WF → ((↑m).all p = true ↔ ∀ (a : α) (h : m.contains a = true), p a (m.get a h) = true)