proposition: Lemma eval_le_gapless A R a (h1 h2 : [pcm of natmap A]) t (z0 : R) : gapless h1 -> valid h2 -> [pcm h1 <= h2] -> t <= last_key h1 -> eval a (le t) h2 z0 = eval a (le t) h1 z0.
proof: Proof. by move=>G V H K; apply: eq_filt_eval; apply: umfilt_le_gapless. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)