(* 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 Coq - Calculus of Inductive Constructions V5.10           *)
(*****************************************************************************)
(*                                                                           *)
(*  Category Theory : Natural Transformations between Hom-Functors           *)
(*                                                                           *)
(*          Amokrane Saibi May 1994                                          *)
(*                                                                           *)
(*****************************************************************************)
Require Export HomFunctor.
Require Export Ntransformation.
Set Implicit Arguments.
Unset Strict Implicit.
(* Natural transformation Y(f):C(b,-)-->C(a,-), with f:a-->b in C *)
Section funset_nt.
Variables (C : Category) (b a : C) (f : a --> b).
Section nth_map_def.
Variable c : C.
Definition NtH_arrow (h : b --> c) := f o h.

Lemma NtH_map_law : Map_law NtH_arrow.
Definition NtH_map : Map (FunSET b c) (FunSET a c) := NtH_map_law.