1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* This file was automatically generated: do not edit *********************)
19 (*#***********************************************************************)
21 (* v * The Coq Proof Assistant / The Coq Development Team *)
23 (* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
25 (* \VV/ **************************************************************)
27 (* // * This file is distributed under the terms of the *)
29 (* * GNU Lesser General Public License Version 2.1 *)
31 (*#***********************************************************************)
33 (*i $Id: Well_Ordering.v,v 1.7.2.1 2004/07/16 19:31:19 herbelin Exp $ i*)
35 (*#* Author: Cristina Cornes.
36 From: Constructing Recursion Operators in Type Theory
37 L. Paulson JSC (1986) 2, 325-355 *)
39 include "Logic/Eqdep.ma".
46 cic:/Coq/Wellfounded/Well_Ordering/WellOrdering/A.var
50 cic:/Coq/Wellfounded/Well_Ordering/WellOrdering/B.var
53 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/WO.ind".
55 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/le_WO.ind".
57 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/wf_WO.con" as theorem.
64 Section Characterisation_wf_relations
67 (*#* Wellfounded relations are the inverse image of wellordering types *)
69 (* in course of development *)
72 cic:/Coq/Wellfounded/Well_Ordering/Characterisation_wf_relations/A.var
76 cic:/Coq/Wellfounded/Well_Ordering/Characterisation_wf_relations/leA.var
79 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/B.con" as definition.
81 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/wof.con" as definition.
84 End Characterisation_wf_relations