proposition: Theorem listReplace_getSomes_Permutation : forall (A : Set) l1 l2 n2 (y : A), nth n2 l1 None = None -> Permutation (getSomes l1) l2 -> Permutation (getSomes (listReplace l1 n2 (Some y) None)) (y :: l2).
proof: Proof. intuition. eapply listReplace_getSomes_Permutation_h; eauto. Qed.
imports: FCF.Rat List Permutation Arith FCF.EqDec FCF.StdNat Bool Permutation