Dict.filter (\k _ -> k /= foo) => Dict.remove foo

[miniBill]

What the rule should do:
Dict.filter (\k _ -> k /= foo) => Dict.remove foo

What problems does it solve:
Change from O(n) to O(log n) complexity, and reduce memory usage.

Should this be part of the Simplify rule or should it be a new rule?
Part of Simplify

I am looking for:

• Someone to implement it with/for me

[lue-bird]

also

Set.filter (\k -> k /= needle) set
--> Set.remove needle set

would be nice if a fuzz test can verify these always works with NaN