proposition: Lemma umcnt_le_last A p (h : natmap A) t : last_key h <= t -> um_count (predI p (le t)) h = um_count p h.
proof: Proof. by move=>K; rewrite -!umcnt_umfilt umfilt_le_last. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)