proposition: Theorem exp_plus_iso : forall a n m, exp (n + m) a ≅ exp n a * exp m a.
proof: Proof. induction n; intros. rewrite one_mul_iso. reflexivity. autorewrite with isos. rewrite IHn, mul_assoc_iso. reflexivity. Qed.
imports: Hask.Ltac Hask.Prelude Hask.Control.Applicative Hask.Control.Monad Hask.Control.Monad.Cont Hask.Control.Monad.State Hask.Data.Functor.Contravariant Hask.Data.Functor.Identity Hask.Data.Functor.Kan Hask.Data.Functor.Yoneda Hask.Control.Lens Coq.Classes.Morphisms Coq.Setoids.Setoid Coq.Init.Datatypes Coq.Relations.Relation_Definitions FunctionalExtensionality