]> matita.cs.unibo.it Git - helm.git/blob - helm/software/matita/contribs/procedural/Coq/Sets/Constructive_sets.mma
Preparing for 0.5.9 release.
[helm.git] / helm / software / matita / contribs / procedural / Coq / Sets / Constructive_sets.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: Constructive_sets.v,v 1.5.2.1 2004/07/16 19:31:17 herbelin Exp $ i*)
70
71 include "Sets/Ensembles.ma".
72
73 (* UNEXPORTED
74 Section Ensembles_facts
75 *)
76
77 (* UNEXPORTED
78 cic:/Coq/Sets/Constructive_sets/Ensembles_facts/U.var
79 *)
80
81 inline procedural "cic:/Coq/Sets/Constructive_sets/Extension.con" as lemma.
82
83 inline procedural "cic:/Coq/Sets/Constructive_sets/Noone_in_empty.con" as lemma.
84
85 (* UNEXPORTED
86 Hint Resolve Noone_in_empty.
87 *)
88
89 inline procedural "cic:/Coq/Sets/Constructive_sets/Included_Empty.con" as lemma.
90
91 (* UNEXPORTED
92 Hint Resolve Included_Empty.
93 *)
94
95 inline procedural "cic:/Coq/Sets/Constructive_sets/Add_intro1.con" as lemma.
96
97 (* UNEXPORTED
98 Hint Resolve Add_intro1.
99 *)
100
101 inline procedural "cic:/Coq/Sets/Constructive_sets/Add_intro2.con" as lemma.
102
103 (* UNEXPORTED
104 Hint Resolve Add_intro2.
105 *)
106
107 inline procedural "cic:/Coq/Sets/Constructive_sets/Inhabited_add.con" as lemma.
108
109 (* UNEXPORTED
110 Hint Resolve Inhabited_add.
111 *)
112
113 inline procedural "cic:/Coq/Sets/Constructive_sets/Inhabited_not_empty.con" as lemma.
114
115 (* UNEXPORTED
116 Hint Resolve Inhabited_not_empty.
117 *)
118
119 inline procedural "cic:/Coq/Sets/Constructive_sets/Add_not_Empty.con" as lemma.
120
121 (* UNEXPORTED
122 Hint Resolve Add_not_Empty.
123 *)
124
125 inline procedural "cic:/Coq/Sets/Constructive_sets/not_Empty_Add.con" as lemma.
126
127 (* UNEXPORTED
128 Hint Resolve not_Empty_Add.
129 *)
130
131 inline procedural "cic:/Coq/Sets/Constructive_sets/Singleton_inv.con" as lemma.
132
133 (* UNEXPORTED
134 Hint Resolve Singleton_inv.
135 *)
136
137 inline procedural "cic:/Coq/Sets/Constructive_sets/Singleton_intro.con" as lemma.
138
139 (* UNEXPORTED
140 Hint Resolve Singleton_intro.
141 *)
142
143 inline procedural "cic:/Coq/Sets/Constructive_sets/Union_inv.con" as lemma.
144
145 inline procedural "cic:/Coq/Sets/Constructive_sets/Add_inv.con" as lemma.
146
147 inline procedural "cic:/Coq/Sets/Constructive_sets/Intersection_inv.con" as lemma.
148
149 (* UNEXPORTED
150 Hint Resolve Intersection_inv.
151 *)
152
153 inline procedural "cic:/Coq/Sets/Constructive_sets/Couple_inv.con" as lemma.
154
155 (* UNEXPORTED
156 Hint Resolve Couple_inv.
157 *)
158
159 inline procedural "cic:/Coq/Sets/Constructive_sets/Setminus_intro.con" as lemma.
160
161 (* UNEXPORTED
162 Hint Resolve Setminus_intro.
163 *)
164
165 inline procedural "cic:/Coq/Sets/Constructive_sets/Strict_Included_intro.con" as lemma.
166
167 (* UNEXPORTED
168 Hint Resolve Strict_Included_intro.
169 *)
170
171 inline procedural "cic:/Coq/Sets/Constructive_sets/Strict_Included_strict.con" as lemma.
172
173 (* UNEXPORTED
174 Hint Resolve Strict_Included_strict.
175 *)
176
177 (* UNEXPORTED
178 End Ensembles_facts
179 *)
180
181 (* UNEXPORTED
182 Hint Resolve Singleton_inv Singleton_intro Add_intro1 Add_intro2
183   Intersection_inv Couple_inv Setminus_intro Strict_Included_intro
184   Strict_Included_strict Noone_in_empty Inhabited_not_empty Add_not_Empty
185   not_Empty_Add Inhabited_add Included_Empty: sets v62.
186 *)
187