∀ {α : Type u} {β : Type v} {x : BEq α} {x_1 : Hashable α} {m : Std.HashMap α β} [EquivBEq α] [LawfulHashable α] {k : α}
  {v : β}, (m.insert k v).toList.Perm ((k, v) :: List.filter (fun x_2 => decide ¬(k == x_2.1) = true) m.toList)