(* 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        *)
(*****************************************************************************)
(*									     *)
(*	         Category .->.<-. (used for Pullbacks)     		     *)
(*									     *)
(*****************************************************************************)
(*									     *)
(*                     A. SAIBI	  May 95                  		     *)
(*									     *)
(*****************************************************************************)
Require Export Category.
Require Export BasicTypes.
Set Implicit Arguments.
Unset Strict Implicit.
Inductive PULB_ob : Type :=
| P1 : PULB_ob
| P2 : PULB_ob
| P3 : PULB_ob.
Inductive PULB_mor : PULB_ob -> PULB_ob -> Type :=
| IP1 : PULB_mor P1 P1
| IP2 : PULB_mor P2 P2
| IP3 : PULB_mor P3 P3
| F12 : PULB_mor P1 P2
| F32 : PULB_mor P3 P2.
(* *)

(* Specifications: *)
Lemma PULB_11_P :
(PULB_mor P1 P1 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_22_P :
(PULB_mor P2 P2 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_33_P :
(PULB_mor P3 P3 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_12_P :
(PULB_mor P1 P2 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_32_P :
(PULB_mor P3 P2 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_21_P :
(PULB_mor P2 P1 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_21_T :
(PULB_mor P2 P1 -> Type) -> forall a b : PULB_ob, PULB_mor a b -> Type.
Lemma PULB_31_P :
(PULB_mor P3 P1 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_31_T :
(PULB_mor P3 P1 -> Type) -> forall a b : PULB_ob, PULB_mor a b -> Type.
Lemma PULB_13_P :
(PULB_mor P1 P3 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_13_T :
(PULB_mor P1 P3 -> Type) -> forall a b : PULB_ob, PULB_mor a b -> Type.
Lemma PULB_23_P :
(PULB_mor P2 P3 -> Prop) -> forall a b : PULB_ob, PULB_mor a b -> Prop.
Lemma PULB_23_T :
(PULB_mor P2 P3 -> Type) -> forall a b : PULB_ob, PULB_mor a b -> Type.