proposition: Lemma CoYoneda_embedding_iso : forall a b : Type, (forall x : Type, (a -> x) -> (b -> x)) ≅ (b -> a).
proof: Proof. intros. rewrite <- (Cont_iso a). rewrite exp_exp_sym_dep_iso. apply iso_ext; intros. rewrite exp_exp_sym_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 Hask.Data.Functor.Fix Hask.Control.Monad.Freer