proposition: Lemma uniq_dom0 A (h : natmap A) : uniq (0 :: dom h).
proof: Proof. by rewrite /= uniq_dom cond_dom. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)