∀ {α : Type u} {x : BEq α} {x_1 : Hashable α} {β : Type v} {m : Std.DHashMap α fun x => β} [EquivBEq α]
  [LawfulHashable α] {k : α} {f : Option β → Option β},
  (Std.DHashMap.Const.alter m k f).isEmpty =
    ((m.isEmpty || m.size == 1 && m.contains k) && (f (Std.DHashMap.Const.get? m k)).isNone)