(* 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        *)
(*****************************************************************************)
(*									     *)
(*	              Equalizers in SET                  		     *)
(*									     *)
(*****************************************************************************)
(*									     *)
(*                     A. SAIBI	  May 95                  		     *)
(*									     *)
(*****************************************************************************)
Require Export Equalizers.
Require Export Setoid_prop.
Require Export SET.
Set Implicit Arguments.
Unset Strict Implicit.
Section s_equaz_def.
Variables (A B : Setoid) (I : Type) (f : I -> Map A B).
Definition S_equaz_pred (a : A) := forall i j : I, f i a =_S f j a.

(* Specifications: *)
Lemma S_equaz_reg : Reg_law S_equaz_pred.
Canonical Structure S_equaz_constr := Build_Setoid_pred S_equaz_reg.