def h.eg_del_other.c

bend-kit-collections@0.1.4.1 · PROOF.bend:2331

import Base
import bend-kit-collections@0.1.4.1/hmap.bend as M

2331def h.eg_del_other.c(
2332  ~K: Data, ~V: Data, ~eq: K -> K -> Bool,
2333  ~sound: @x: K -> @y: K -> {eq(x, y) == True{} : Bool} -> {x == y : K},
2334  +key: K, +val: V, +rest: List<&2, M.Entry<K, V>>, +k2: K, +k: K,
2335  +ne: {eq(k, k2) == False{} : Bool}, b: Bool, eb: {b == eq(k2, key) : Bool},
2336  ih: {M.HMap.entries.get(~K, ~V, ~eq, M.HMap.entries.del(~K, ~V, ~eq, rest, k2), k)
2337       == M.HMap.entries.get(~K, ~V, ~eq, rest, k) : Maybe<&2, V>}
2338) -> {M.HMap.entries.get(~K, ~V, ~eq, h.edc(~K, ~V, ~eq, b, key, val, rest, k2), k)
2339      == h.egc(~K, ~V, ~eq, eq(k, key), val, rest, k) : Maybe<&2, V>}:
2340  match b:
2341    case True{}:
2342      %h.sb(eq(k, key), False{}, h.nk(~K, ~eq, ~sound, k2, key, k, h.sb(True{}, eq(k2, key), eb), ne))
2343        : {M.HMap.entries.get(~K, ~V, ~eq, rest, k) == h.egc(~K, ~V, ~eq, _, val, rest, k) : Maybe<&2, V>}
2344      {==}
2345    case False{}:
2346      h.egc2(~K, ~V, ~eq, eq(k, key), val, M.HMap.entries.del(~K, ~V, ~eq, rest, k2), rest, k, ih)