proposition: Lemma exp_exp_sym_dep_iso : forall (a c : Type) (d : c -> Type), (a -> forall b : c, d b) ≅ (forall b : c, a -> d b).
proof: Proof. intuition. unfold isomorphic. exists (fun f b a => f a b). exists (fun f a b => f b a). extensionalize. 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