proposition: Lemma iter_param {A B} (f : A -> A) (g : B -> B) (h : A -> B) : (forall x, g (h x) = h (f x)) -> (forall x n, iterate g n (h x) = h (iterate f n x)).
proof: Proof. intros E x n. induction n. reflexivity. now rewrite !iterate_S, IHn, E. Qed.
imports: Autosubst_Basics Autosubst_MMap Autosubst_Classes Autosubst_Tactics Autosubst_Lemmas