proposition: Lemma pts_injT A1 A2 x (v1 : A1) (v2 : A2) : def (x :-> v1) -> x :-> v1 = x :-> v2 -> A1 = A2.
proof: Proof. by move=>D; case/(pts_injP D). Qed.
imports: mathcomp(ssreflect ssrfun ssrnat div ssrbool seq) LemmaOverloading(prelude finmap ordtype) mathcomp(path eqtype) Eqdep