proposition: Lemma override_new_val'': forall (V: Type) m k1 k2 (v: V), k2 = k1 -> (override m k1 v) k2 = v.
proof: Proof. intros. subst. unfold override. rewrite eq_nat_dec_eq. reflexivity. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)