proposition: Lemma InA_eqk_eqke k e l : InA eqk (k,e) l -> exists e', InA eqke (k,e') l.
proof: Proof. rewrite InA_alt. intros ((k',e') & E & IN). compute in E. exists e'. rewrite InA_alt. firstorder. Qed.
imports: Coq(Bool Equalities Orders OrdersFacts OrdersLists) Coq(Morphisms Permutation SetoidPermutation) MMaps(Utils Comparisons Interface)