helm/software/matita/contribs/procedural/Coq/Sets/Relations_1_facts.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 (*#***************************************************************************)
  34
  35 (*                                                                          *)
  36
  37 (*                         Naive Set Theory in Coq                          *)
  38
  39 (*                                                                          *)
  40
  41 (*                     INRIA                        INRIA                   *)
  42
  43 (*              Rocquencourt                        Sophia-Antipolis        *)
  44
  45 (*                                                                          *)
  46
  47 (*                                 Coq V6.1                                 *)
  48
  49 (*                                                                          *)
  50
  51 (*                               Gilles Kahn                                *)
  52
  53 (*                               Gerard Huet                                *)
  54
  55 (*                                                                          *)
  56
  57 (*                                                                          *)
  58
  59 (*                                                                          *)
  60
  61 (* Acknowledgments: This work was started in July 1993 by F. Prost. Thanks  *)
  62
  63 (* to the Newton Institute for providing an exceptional work environment    *)
  64
  65 (* in Summer 1995. Several developments by E. Ledinot were an inspiration.  *)
  66
  67 (*#***************************************************************************)
  68
  69 (*i $Id: Relations_1_facts.v,v 1.7.2.1 2004/07/16 19:31:18 herbelin Exp $ i*)
  70
  71 include "Sets/Relations_1.ma".
  72
  73 inline procedural "cic:/Coq/Sets/Relations_1_facts/Complement.con" as definition.
  74
  75 inline procedural "cic:/Coq/Sets/Relations_1_facts/Rsym_imp_notRsym.con" as theorem.
  76
  77 inline procedural "cic:/Coq/Sets/Relations_1_facts/Equiv_from_preorder.con" as theorem.
  78
  79 (* UNEXPORTED
  80 Hint Resolve Equiv_from_preorder.
  81 *)
  82
  83 inline procedural "cic:/Coq/Sets/Relations_1_facts/Equiv_from_order.con" as theorem.
  84
  85 (* UNEXPORTED
  86 Hint Resolve Equiv_from_order.
  87 *)
  88
  89 inline procedural "cic:/Coq/Sets/Relations_1_facts/contains_is_preorder.con" as theorem.
  90
  91 (* UNEXPORTED
  92 Hint Resolve contains_is_preorder.
  93 *)
  94
  95 inline procedural "cic:/Coq/Sets/Relations_1_facts/same_relation_is_equivalence.con" as theorem.
  96
  97 (* UNEXPORTED
  98 Hint Resolve same_relation_is_equivalence.
  99 *)
 100
 101 inline procedural "cic:/Coq/Sets/Relations_1_facts/cong_reflexive_same_relation.con" as theorem.
 102
 103 inline procedural "cic:/Coq/Sets/Relations_1_facts/cong_symmetric_same_relation.con" as theorem.
 104
 105 inline procedural "cic:/Coq/Sets/Relations_1_facts/cong_antisymmetric_same_relation.con" as theorem.
 106
 107 inline procedural "cic:/Coq/Sets/Relations_1_facts/cong_transitive_same_relation.con" as theorem.
 108