proposition: Lemma dom_freshN0 h x t : fresh h <= t -> x \in 0::dom h -> x != t.
proof: Proof. by move=>D /(dom_ordfresh0 D); case: ltngtP. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)