proposition: Lemma map_eq_nth : forall (A B C : Set) i def1 def2 (f1 : A -> C)(f2 : B -> C)(lsa : list A)(lsb : list B), length lsa = length lsb -> map f1 lsa = map f2 lsb -> i < length lsa -> f1 (nth i lsa def1) = f2 (nth i lsb def2).
proof: Proof. intuition. eapply map_eq_nth_h; intuition. Qed.
imports: FCF.FCF Permutation