∀ {α : Type u} {β : α → Type v} [inst : BEq α] [inst_1 : Hashable α] {m₁ m₂ : Std.DHashMap.Internal.Raw₀ α β}
  [EquivBEq α] [LawfulHashable α],
  (↑m₁).WF → (↑m₂).WF → ((↑(m₁.inter m₂)).isEmpty = true ↔ ∀ (k : α), m₁.contains k = true → m₂.contains k = false)