helm/software/matita/contribs/procedural/Coq/Wellfounded/Well_Ordering.mma

   1 (**************************************************************************)
   2 (*       ___                                                              *)
   3 (*      ||M||                                                             *)
   4 (*      ||A||       A project by Andrea Asperti                           *)
   5 (*      ||T||                                                             *)
   6 (*      ||I||       Developers:                                           *)
   7 (*      ||T||         The HELM team.                                      *)
   8 (*      ||A||         http://helm.cs.unibo.it                             *)
   9 (*      \   /                                                             *)
  10 (*       \ /        This file is distributed under the terms of the       *)
  11 (*        v         GNU General Public License Version 2                  *)
  12 (*                                                                        *)
  13 (**************************************************************************)
  14
  15 (* This file was automatically generated: do not edit *********************)
  16
  17 include "Coq.ma".
  18
  19 (*#***********************************************************************)
  20
  21 (*  v      *   The Coq Proof Assistant  /  The Coq Development Team     *)
  22
  23 (* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
  24
  25 (*   \VV/  **************************************************************)
  26
  27 (*    //   *      This file is distributed under the terms of the       *)
  28
  29 (*         *       GNU Lesser General Public License Version 2.1        *)
  30
  31 (*#***********************************************************************)
  32
  33 (*i $Id: Well_Ordering.v,v 1.7.2.1 2004/07/16 19:31:19 herbelin Exp $ i*)
  34
  35 (*#* Author: Cristina Cornes.
  36     From: Constructing Recursion Operators in Type Theory
  37     L. Paulson  JSC (1986) 2, 325-355 *)
  38
  39 include "Logic/Eqdep.ma".
  40
  41 (* UNEXPORTED
  42 Section WellOrdering
  43 *)
  44
  45 (* UNEXPORTED
  46 cic:/Coq/Wellfounded/Well_Ordering/WellOrdering/A.var
  47 *)
  48
  49 (* UNEXPORTED
  50 cic:/Coq/Wellfounded/Well_Ordering/WellOrdering/B.var
  51 *)
  52
  53 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/WO.ind".
  54
  55 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/le_WO.ind".
  56
  57 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/wf_WO.con" as theorem.
  58
  59 (* UNEXPORTED
  60 End WellOrdering
  61 *)
  62
  63 (* UNEXPORTED
  64 Section Characterisation_wf_relations
  65 *)
  66
  67 (*#* Wellfounded relations are the inverse image of wellordering types *)
  68
  69 (*  in course of development                                          *)
  70
  71 (* UNEXPORTED
  72 cic:/Coq/Wellfounded/Well_Ordering/Characterisation_wf_relations/A.var
  73 *)
  74
  75 (* UNEXPORTED
  76 cic:/Coq/Wellfounded/Well_Ordering/Characterisation_wf_relations/leA.var
  77 *)
  78
  79 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/B.con" as definition.
  80
  81 inline procedural "cic:/Coq/Wellfounded/Well_Ordering/wof.con" as definition.
  82
  83 (* UNEXPORTED
  84 End Characterisation_wf_relations
  85 *)
  86