(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(*****************************************************************************)
(*          Projet Formel - Calculus of Inductive Constructions V5.10        *)
(*****************************************************************************)
(*									     *)
(*	            Existence of Left Adjoint                		     *)
(*									     *)
(*****************************************************************************)
(*									     *)
(*                     A. SAIBI	  May 95                  		     *)
(*									     *)
(*****************************************************************************)
Require Export Adj_UA.
Set Implicit Arguments.
Unset Strict Implicit.
(* Maintenant a` partir d'un UA unit (pour tout d:D), *)
(* construire une adj *)
Section ua_to_ladj.
Variables (C D : Category) (G : Functor C D).
Hypothesis UA_of : forall d : D, UA d G.
Definition AdjointUA_ob (d : D) := UA_ob (UA_of d).
Section adjoint_ua_map_def.
Variable d d' : D.
Definition AdjointUA_mor (f : d --> d') :=
UA_diese (UA_of d) (f o UA_mor (UA_of d')).

Lemma AdjointUA_map_law : Map_law AdjointUA_mor.
Canonical Structure AdjointUA_map :
Map (d --> d') (AdjointUA_ob d --> AdjointUA_ob d') := AdjointUA_map_law.