proposition: Lemma updE k v f : upd k v f = to (UM.upd k v (from f)).
proof: Proof. by case: f=>[|f H] //=; case: decP=>// H1; rewrite heapE. Qed.
imports: Coq(ssreflect ssrbool ssrfun Eqdep) mathcomp(ssrnat eqtype seq path) pcm(options axioms finmap) pcm(pcm unionmap)