(* 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        *)
(*****************************************************************************)
(*									     *)
(*	                Adjunction Example : Cartesian         		     *)
(*									     *)
(*****************************************************************************)
(*									     *)
(*                     A. SAIBI	  May 95                  		     *)
(*									     *)
(*****************************************************************************)
Require Export Diagonal.
Require Export CCC.
Require Export Terminal1.
Set Implicit Arguments.
Unset Strict Implicit.
(* Diag(C) a un RAdj -> C admet les produits *)
Section diag_hasprod1.
Variable C : Category.
SubClass HasBinProd1 := RightAdj (Diag C).
Structure IsCartesian1 : Type :=
{Car_terminal1 :> Terminal1 C; Car_BP1 :> HasBinProd1}.
Variable H : HasBinProd1.
Section diag_prod1.
Variable a b : C.
Let ua' := CoUnit H (Build_POb a b).
Definition Obj_prod1 := CoUA_ob ua'.
Definition Proj1_prod1 := Hom_l (CoUA_mor ua').
Definition Proj2_prod1 := Hom_r (CoUA_mor ua').
Section together1_def.
Variable c : C.
Definition Together1 (f : c --> a) (g : c --> b) :=
CoUA_diese ua' (Build_Pmor (u:=Build_POb c c) (t:=Build_POb a b) f g).

Lemma Together1_r : Map2_congr_law Together1.
Definition Op_together1 := Build_Map2 Together1_l Together1_r.