proposition: Lemma oev_consN a k ks f z0 : k \notin dom f -> oeval a (k :: ks) f z0 = oeval a ks f z0.
proof: Proof. by case: dom_find=>//= ->. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)