proposition: Lemma lastkeyPtUnE u2 u1 h t : last_key (t \-> u1 \+ h) = last_key (t \-> u2 \+ h).
proof: Proof. by rewrite !lastkeyPtUn_max !validPtUn. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)