proposition: Lemma lookPtUnO A h x (v : A) (f : partition (x :-> v) h) : valid (untag f) -> find x (untag f) = Some (idyn v).
proof: Proof. by rewrite partitionE; apply: findPtUn. Qed.
imports: Coq(ssreflect ssrbool ssrfun Eqdep) mathcomp(ssrnat eqtype seq path) pcm(options axioms finmap) pcm(pcm unionmap)