fact: Record Adjunction {C D : Type} (F : C -> D) (G : D -> C) `{Is1Cat C, Is1Cat D, !Is0Functor F, !Is0Functor G} := { equiv_adjunction (x : C) (y : D) : (F x $-> y) <~> (x $-> G y) ; is1natural_equiv_adjunction_l (y : D) : Is1Natural (A := C^op) (yon y o F) (is0functor_F := is0functor_compose (A:=C^op) (B:=D^op) (C:=Type) _ _) (yon (G y)) (fun x => equiv_adjunction _ y) ; is1natural_equiv_adjunction_r (x : C) : Is1Natural (opyon (F x)) (opyon x o G) (equiv_adjunction x) ; }.
imports: Basics.Utf8 Basics.Overture Basics.Tactics Basics.Equivalences WildCat.Core WildCat.NatTrans WildCat.Equiv WildCat.Prod WildCat.Opposite WildCat.Yoneda WildCat.FunctorCat WildCat.Universe Types.Prod