]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/procedural/Coq/Sets/Integers.mma
made executable again
[helm.git] / matita / matita / contribs / procedural / Coq / Sets / Integers.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: Integers.v,v 1.6.2.1 2004/07/16 19:31:17 herbelin Exp $ i*)
70
71 include "Sets/Finite_sets.ma".
72
73 include "Sets/Constructive_sets.ma".
74
75 include "Logic/Classical_Type.ma".
76
77 include "Sets/Classical_sets.ma".
78
79 include "Sets/Powerset.ma".
80
81 include "Sets/Powerset_facts.ma".
82
83 include "Sets/Powerset_Classical_facts.ma".
84
85 include "Arith/Gt.ma".
86
87 include "Arith/Lt.ma".
88
89 include "Arith/Le.ma".
90
91 include "Sets/Finite_sets_facts.ma".
92
93 include "Sets/Image.ma".
94
95 include "Sets/Infinite_sets.ma".
96
97 include "Arith/Compare_dec.ma".
98
99 include "Sets/Relations_1.ma".
100
101 include "Sets/Partial_Order.ma".
102
103 include "Sets/Cpo.ma".
104
105 (* UNEXPORTED
106 Section Integers_sect
107 *)
108
109 inline procedural "cic:/Coq/Sets/Integers/Integers.ind".
110
111 (* UNEXPORTED
112 Hint Resolve Integers_defn.
113 *)
114
115 inline procedural "cic:/Coq/Sets/Integers/le_reflexive.con" as lemma.
116
117 inline procedural "cic:/Coq/Sets/Integers/le_antisym.con" as lemma.
118
119 inline procedural "cic:/Coq/Sets/Integers/le_trans.con" as lemma.
120
121 (* UNEXPORTED
122 Hint Resolve le_reflexive le_antisym le_trans.
123 *)
124
125 inline procedural "cic:/Coq/Sets/Integers/le_Order.con" as lemma.
126
127 (* UNEXPORTED
128 Hint Resolve le_Order.
129 *)
130
131 inline procedural "cic:/Coq/Sets/Integers/triv_nat.con" as lemma.
132
133 (* UNEXPORTED
134 Hint Resolve triv_nat.
135 *)
136
137 inline procedural "cic:/Coq/Sets/Integers/nat_po.con" as definition.
138
139 (* UNEXPORTED
140 Hint Unfold nat_po.
141 *)
142
143 inline procedural "cic:/Coq/Sets/Integers/le_total_order.con" as lemma.
144
145 (* UNEXPORTED
146 Hint Resolve le_total_order.
147 *)
148
149 inline procedural "cic:/Coq/Sets/Integers/Finite_subset_has_lub.con" as lemma.
150
151 inline procedural "cic:/Coq/Sets/Integers/Integers_has_no_ub.con" as lemma.
152
153 inline procedural "cic:/Coq/Sets/Integers/Integers_infinite.con" as lemma.
154
155 (* UNEXPORTED
156 End Integers_sect
157 *)
158