proposition: Theorem iter_swap : forall n (A:Type) (f:A -> A) (x:A), iter n f (f x) = f (iter n f x).
proof: Proof. intros. symmetry. now apply iter_swap_gen. Qed.
imports: BinNums BinPos RelationClasses Morphisms Setoid Equalities OrdersFacts GenericMinMax Bool NAxioms NMaxMin NProperties