helm/software/matita/contribs/procedural/Coq/Wellfounded/Lexicographic_Exponentiation.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: Lexicographic_Exponentiation.v,v 1.10.2.1 2004/07/16 19:31:19 herbelin Exp $ i*)
  34
  35 (*#* Author: Cristina Cornes
  36
  37     From : Constructing Recursion Operators in Type Theory
  38            L. Paulson  JSC (1986) 2, 325-355  *)
  39
  40 include "Logic/Eqdep.ma".
  41
  42 include "Lists/List.ma".
  43
  44 include "Relations/Relation_Operators.ma".
  45
  46 include "Wellfounded/Transitive_Closure.ma".
  47
  48 (* UNEXPORTED
  49 Section Wf_Lexicographic_Exponentiation
  50 *)
  51
  52 (* UNEXPORTED
  53 cic:/Coq/Wellfounded/Lexicographic_Exponentiation/Wf_Lexicographic_Exponentiation/A.var
  54 *)
  55
  56 (* UNEXPORTED
  57 cic:/Coq/Wellfounded/Lexicographic_Exponentiation/Wf_Lexicographic_Exponentiation/leA.var
  58 *)
  59
  60 (* NOTATION
  61 Notation Power := (Pow A leA).
  62 *)
  63
  64 (* NOTATION
  65 Notation Lex_Exp := (lex_exp A leA).
  66 *)
  67
  68 (* NOTATION
  69 Notation ltl := (Ltl A leA).
  70 *)
  71
  72 (* NOTATION
  73 Notation Descl := (Desc A leA).
  74 *)
  75
  76 (* NOTATION
  77 Notation List := (list A).
  78 *)
  79
  80 (* NOTATION
  81 Notation Nil := (nil (A:=A)).
  82 *)
  83
  84 (* useless but symmetric *)
  85
  86 (* NOTATION
  87 Notation Cons := (cons (A:=A)).
  88 *)
  89
  90 (* NOTATION
  91 Notation "<< x , y >>" := (exist Descl x y) (at level 0, x, y at level 100).
  92 *)
  93
  94 (* UNEXPORTED
  95 Hint Resolve d_one d_nil t_step.
  96 *)
  97
  98 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/left_prefix.con" as lemma.
  99
 100 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/right_prefix.con" as lemma.
 101
 102 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/desc_prefix.con" as lemma.
 103
 104 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/desc_tail.con" as lemma.
 105
 106 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/dist_aux.con" as lemma.
 107
 108 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/dist_Desc_concat.con" as lemma.
 109
 110 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/desc_end.con" as lemma.
 111
 112 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/ltl_unit.con" as lemma.
 113
 114 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/acc_app.con" as lemma.
 115
 116 inline procedural "cic:/Coq/Wellfounded/Lexicographic_Exponentiation/wf_lex_exp.con" as theorem.
 117
 118 (* UNEXPORTED
 119 End Wf_Lexicographic_Exponentiation
 120 *)
 121