(* 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        *)
(*****************************************************************************)
(*									     *)
(*	                       Adjunctions                		     *)
(*									     *)
(*****************************************************************************)
(*									     *)
(*                     A. SAIBI	  May 95                  		     *)
(*									     *)
(*****************************************************************************)
Require Export NatIso.
Require Export HomFunctor2.
Set Implicit Arguments.
Unset Strict Implicit.
Section adj_def.
Variables (C D : Category) (F : Functor D C) (G : Functor C D).
SubClass Adj := NatIso (FunSET2_r F) (FunSET2_l G).
Variables (phi : NT (FunSET2_r F) (FunSET2_l G))
(phi_1 : NT (FunSET2_l G) (FunSET2_r F)).
Variable phi_iso : AreNatIsos phi phi_1.
Definition Build_Adj : Adj := Build_NatIso phi_iso.
Variables (d : D) (c : C) (ad : Adj).
Definition ApAphi (f : F d --> c) : d --> G c := ad (Build_POb1 d c) f.
Definition ApAphi_inv (g : d --> G c) : F d --> c :=
NatIso_inv ad (Build_POb1 d c) g.
(* rewrite rules *)

Lemma AphiPres : forall f g : F d --> c, f =_S g -> ApAphi f =_S ApAphi g.