helm/software/matita/contribs/procedural/Coq/Sets/Permut.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 include "Init/Prelude.ma".
  20
  21 (*#***********************************************************************)
  22
  23 (*  v      *   The Coq Proof Assistant  /  The Coq Development Team     *)
  24
  25 (* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
  26
  27 (*   \VV/  **************************************************************)
  28
  29 (*    //   *      This file is distributed under the terms of the       *)
  30
  31 (*         *       GNU Lesser General Public License Version 2.1        *)
  32
  33 (*#***********************************************************************)
  34
  35 (*i $Id: Permut.v,v 1.6.2.1 2004/07/16 19:31:18 herbelin Exp $ i*)
  36
  37 (* G. Huet 1-9-95 *)
  38
  39 (*#* We consider a Set [U], given with a commutative-associative operator [op],
  40     and a congruence [cong]; we show permutation lemmas *)
  41
  42 (* UNEXPORTED
  43 Section Axiomatisation
  44 *)
  45
  46 (* UNEXPORTED
  47 cic:/Coq/Sets/Permut/Axiomatisation/U.var
  48 *)
  49
  50 (* UNEXPORTED
  51 cic:/Coq/Sets/Permut/Axiomatisation/op.var
  52 *)
  53
  54 (* UNEXPORTED
  55 cic:/Coq/Sets/Permut/Axiomatisation/cong.var
  56 *)
  57
  58 (* UNEXPORTED
  59 cic:/Coq/Sets/Permut/Axiomatisation/op_comm.var
  60 *)
  61
  62 (* UNEXPORTED
  63 cic:/Coq/Sets/Permut/Axiomatisation/op_ass.var
  64 *)
  65
  66 (* UNEXPORTED
  67 cic:/Coq/Sets/Permut/Axiomatisation/cong_left.var
  68 *)
  69
  70 (* UNEXPORTED
  71 cic:/Coq/Sets/Permut/Axiomatisation/cong_right.var
  72 *)
  73
  74 (* UNEXPORTED
  75 cic:/Coq/Sets/Permut/Axiomatisation/cong_trans.var
  76 *)
  77
  78 (* UNEXPORTED
  79 cic:/Coq/Sets/Permut/Axiomatisation/cong_sym.var
  80 *)
  81
  82 (*#* Remark. we do not need: [Hypothesis cong_refl : (x:U)(cong x x)]. *)
  83
  84 inline procedural "cic:/Coq/Sets/Permut/cong_congr.con" as lemma.
  85
  86 inline procedural "cic:/Coq/Sets/Permut/comm_right.con" as lemma.
  87
  88 inline procedural "cic:/Coq/Sets/Permut/comm_left.con" as lemma.
  89
  90 inline procedural "cic:/Coq/Sets/Permut/perm_right.con" as lemma.
  91
  92 inline procedural "cic:/Coq/Sets/Permut/perm_left.con" as lemma.
  93
  94 inline procedural "cic:/Coq/Sets/Permut/op_rotate.con" as lemma.
  95
  96 (* Needed for treesort ... *)
  97
  98 inline procedural "cic:/Coq/Sets/Permut/twist.con" as lemma.
  99
 100 (* UNEXPORTED
 101 End Axiomatisation
 102 *)
 103