proposition: Lemma dom_ordfresh0 h x t : fresh h <= t -> x \in 0::dom h -> x < t.
proof: Proof. by rewrite inE=>D /orP [/eqP ->|/dom_ordfresh H]; apply: leq_ltn_trans D. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)