1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (******************* SETS OVER TYPES *****************)
17 include "logic/connectives.ma".
19 nrecord powerclass (A: Type[0]) : Type[1] ≝ { mem: A → CProp[0] }.
21 interpretation "mem" 'mem a S = (mem ? S a).
22 interpretation "powerclass" 'powerset A = (powerclass A).
23 interpretation "subset construction" 'subset \eta.x = (mk_powerclass ? x).
25 ndefinition subseteq ≝ λA.λU,V.∀a:A. a ∈ U → a ∈ V.
26 interpretation "subseteq" 'subseteq U V = (subseteq ? U V).
28 ndefinition overlaps ≝ λA.λU,V.∃x:A.x ∈ U ∧ x ∈ V.
29 interpretation "overlaps" 'overlaps U V = (overlaps ? U V).
31 ndefinition intersect ≝ λA.λU,V:Ω^A.{ x | x ∈ U ∧ x ∈ V }.
32 interpretation "intersect" 'intersects U V = (intersect ? U V).
34 ndefinition union ≝ λA.λU,V:Ω^A.{ x | x ∈ U ∨ x ∈ V }.
35 interpretation "union" 'union U V = (union ? U V).
37 ndefinition big_union ≝ λA,B.λT:Ω^A.λf:A → Ω^B.{ x | ∃i. i ∈ T ∧ x ∈ f i }.
39 ndefinition big_intersection ≝ λA,B.λT:Ω^A.λf:A → Ω^B.{ x | ∀i. i ∈ T → x ∈ f i }.
41 ndefinition full_set: ∀A. Ω^A ≝ λA.{ x | True }.
43 nlemma subseteq_refl: ∀A.∀S: Ω^A. S ⊆ S.
44 #A; #S; #x; #H; nassumption.
47 nlemma subseteq_trans: ∀A.∀S,T,U: Ω^A. S ⊆ T → T ⊆ U → S ⊆ U.
48 #A; #S; #T; #U; #H1; #H2; #x; #P; napply H2; napply H1; nassumption.
51 include "properties/relations1.ma".
53 ndefinition seteq: ∀A. equivalence_relation1 (Ω^A).
55 [ napply (λS,S'. S ⊆ S' ∧ S' ⊆ S)
56 | #S; @; napply subseteq_refl
57 | #S; #S'; *; #H1; #H2; @; nassumption
58 | #S; #T; #U; *; #H1; #H2; *; #H3; #H4; @; napply subseteq_trans;
59 ##[##2,5: nassumption |##1,4: ##skip |##*: nassumption]##]
62 include "sets/setoids1.ma".
64 (* this has to be declared here, so that it is combined with carr *)
65 ncoercion full_set : ∀A:Type[0]. Ω^A ≝ full_set on A: Type[0] to (Ω^?).
67 ndefinition powerclass_setoid: Type[0] → setoid1.
68 #A; @[ napply (Ω^A)| napply seteq ]
71 include "hints_declaration.ma".
73 alias symbol "hint_decl" = "hint_decl_Type2".
74 unification hint 0 ≔ A ⊢ carr1 (mk_setoid1 (Ω^A) (eq1 (powerclass_setoid A))) ≡ Ω^A.
76 (************ SETS OVER SETOIDS ********************)
78 include "logic/cprop.ma".
80 nrecord qpowerclass (A: setoid) : Type[1] ≝
81 { pc:> Ω^A; (* qui pc viene dichiarato con un target preciso...
82 forse lo si vorrebbe dichiarato con un target più lasco
83 ma la sintassi :> non lo supporta *)
84 mem_ok': ∀x,x':A. x=x' → (x ∈ pc) = (x' ∈ pc)
87 notation > "𝛀 ^ term 90 A" non associative with precedence 70
88 for @{ 'qpowerclass $A }.
90 notation "Ω term 90 A \atop ≈" non associative with precedence 70
91 for @{ 'qpowerclass $A }.
93 interpretation "qpowerclass" 'qpowerclass a = (qpowerclass a).
95 ndefinition Full_set: ∀A. 𝛀^A.
96 #A; @[ napply A | #x; #x'; #H; napply refl1]
98 ncoercion Full_set: ∀A. qpowerclass A ≝ Full_set on A: setoid to qpowerclass ?.
100 ndefinition qseteq: ∀A. equivalence_relation1 (𝛀^A).
102 [ napply (λS,S'. S = S')
103 | #S; napply (refl1 ? (seteq A))
104 | #S; #S'; napply (sym1 ? (seteq A))
105 | #S; #T; #U; napply (trans1 ? (seteq A))]
108 ndefinition qpowerclass_setoid: setoid → setoid1.
110 [ napply (qpowerclass A)
111 | napply (qseteq A) ]
114 unification hint 0 ≔ A ⊢
115 carr1 (mk_setoid1 (𝛀^A) (eq1 (qpowerclass_setoid A)))
118 ncoercion pc' : ∀A.∀x:qpowerclass_setoid A. Ω^A ≝ pc
119 on _x : (carr1 (qpowerclass_setoid ?)) to (Ω^?).
121 nlemma mem_ok: ∀A. binary_morphism1 (setoid1_of_setoid A) (qpowerclass_setoid A) CPROP.
123 [ napply (λx,S. x ∈ S)
124 | #a; #a'; #b; #b'; #Ha; *; #Hb1; #Hb2; @; #H;
125 ##[ napply Hb1; napply (. (mem_ok' …)); ##[##3: napply H| napply Ha^-1;##]
126 ##| napply Hb2; napply (. (mem_ok' …)); ##[##3: napply H| napply Ha;##]
131 unification hint 0 ≔ A:setoid, x, S;
133 TT ≟ (mk_binary_morphism1 ???
134 (λx:setoid1_of_setoid ?.λS:qpowerclass_setoid ?. x ∈ S)
135 (prop21 ??? (mem_ok A)))
137 (*-------------------------------------*) ⊢
141 nlemma subseteq_ok: ∀A. binary_morphism1 (qpowerclass_setoid A) (qpowerclass_setoid A) CPROP.
143 [ napply (λS,S'. S ⊆ S')
144 | #a; #a'; #b; #b'; *; #Ha1; #Ha2; *; #Hb1; #Hb2; @; #H
145 [ napply (subseteq_trans … a)
146 [ nassumption | napply (subseteq_trans … b); nassumption ]
147 ##| napply (subseteq_trans … a')
148 [ nassumption | napply (subseteq_trans … b'); nassumption ] ##]
151 unification hint 0 ≔ A,a,a'
152 (*-----------------------------------------------------------------*) ⊢
153 eq_rel ? (eq A) a a' ≡ eq_rel1 ? (eq1 (setoid1_of_setoid A)) a a'.
155 nlemma intersect_ok: ∀A. 𝛀^A → 𝛀^A → 𝛀^A.
156 #A; #S; #S'; @ (S ∩ S');
157 #a; #a'; #Ha; @; *; #H1; #H2; @
158 [##1,2: napply (. Ha^-1‡#); nassumption;
159 ##|##3,4: napply (. Ha‡#); nassumption]
162 alias symbol "hint_decl" = "hint_decl_Type1".
164 A : setoid, B,C : qpowerclass A ⊢
165 pc A (mk_qpowerclass ? (B ∩ C) (mem_ok' ? (intersect_ok ? B C)))
166 ≡ intersect ? (pc ? B) (pc ? C).
168 nlemma intersect_ok': ∀A. binary_morphism1 (powerclass_setoid A) (powerclass_setoid A) (powerclass_setoid A).
169 #A; @ (λS,S'. S ∩ S');
170 #a; #a'; #b; #b'; *; #Ha1; #Ha2; *; #Hb1; #Hb2; @; #x; nnormalize; *; #Ka; #Kb; @
171 [ napply Ha1; nassumption
172 | napply Hb1; nassumption
173 | napply Ha2; nassumption
174 | napply Hb2; nassumption]
177 alias symbol "hint_decl" = "hint_decl_Type1".
179 A : Type[0], B,C : powerclass A ⊢
181 (mk_binary_morphism1 …
183 (prop21 … (intersect_ok' A))) B C
186 ndefinition prop21_mem :
187 ∀A,C.∀f:binary_morphism1 (setoid1_of_setoid A) (qpowerclass_setoid A) C.
188 ∀a,a':setoid1_of_setoid A.
189 ∀b,b':qpowerclass_setoid A.a = a' → b = b' → f a b = f a' b'.
190 #A; #C; #f; #a; #a'; #b; #b'; #H1; #H2; napply prop21; nassumption;
193 interpretation "prop21 mem" 'prop2 l r = (prop21_mem ??????? l r).
195 nlemma intersect_ok'':
196 ∀A. binary_morphism1 (qpowerclass_setoid A) (qpowerclass_setoid A) (qpowerclass_setoid A).
197 #A; @ (intersect_ok A); nlapply (prop21 … (intersect_ok' A)); #H;
198 #a; #a'; #b; #b'; #H1; #H2; napply H; nassumption;
204 (mk_binary_morphism1 …
205 (λS,S':qpowerclass_setoid A.S ∩ S')
206 (prop21 … (intersect_ok'' A))) B C
212 nlemma test: ∀U.∀A,B:qpowerclass U. A ∩ B = A →
213 ∀x,y. x=y → x ∈ A → y ∈ A ∩ B.
214 #U; #A; #B; #H; #x; #y; #K; #K2; napply (. #‡(?));
215 ##[ nchange with (A ∩ B = ?);
216 napply (prop21 ??? (mk_binary_morphism1 … (λS,S'.S ∩ S') (prop21 … (intersect_ok' U))) A A B B ##);
222 nlemma intersect_ok: ∀A. binary_morphism1 (qpowerclass_setoid A) (qpowerclass_setoid A) (qpowerclass_setoid A).
227 nwhd in ⊢ (? ? ? % %); @; *; #H1; #H2; @
228 [##1,2: napply (. Ha^-1‡#); nassumption;
229 ##|##3,4: napply (. Ha‡#); nassumption]##]
230 ##| #a; #a'; #b; #b'; #Ha; #Hb; nwhd; @; #x; nwhd in ⊢ (% → %); #H
231 [ alias symbol "invert" = "setoid1 symmetry".
232 napply (. ((#‡Ha^-1)‡(#‡Hb^-1))); nassumption
233 | napply (. ((#‡Ha)‡(#‡Hb))); nassumption ]##]
236 (* unfold if intersect, exposing fun21 *)
237 alias symbol "hint_decl" = "hint_decl_Type1".
239 A : setoid, B,C : qpowerclass A ⊢
241 (mk_binary_morphism1 …
242 (λS,S':qpowerclass_setoid A.mk_qpowerclass ? (S ∩ S') (mem_ok' ? (intersect_ok ? S S')))
243 (prop21 … (intersect_ok A)))
246 ≡ intersect ? (pc ? B) (pc ? C).
248 nlemma test: ∀A:setoid. ∀U,V:qpowerclass A. ∀x,x':setoid1_of_setoid A. x=x' → x ∈ U ∩ V → x' ∈ U ∩ V.
249 #A; #U; #V; #x; #x'; #H; #p; napply (. (H^-1‡#)); nassumption.
253 ndefinition image: ∀A,B. (carr A → carr B) → Ω^A → Ω^B ≝
254 λA,B:setoid.λf:carr A → carr B.λSa:Ω^A.
255 {y | ∃x. x ∈ Sa ∧ eq_rel (carr B) (eq B) (f x) y}.
257 ndefinition counter_image: ∀A,B. (carr A → carr B) → Ω^B → Ω^A ≝
258 λA,B,f,Sb. {x | ∃y. y ∈ Sb ∧ f x = y}.
260 (******************* compatible equivalence relations **********************)
262 nrecord compatible_equivalence_relation (A: setoid) : Type[1] ≝
263 { rel:> equivalence_relation A;
264 compatibility: ∀x,x':A. x=x' → rel x x'
267 ndefinition quotient: ∀A. compatible_equivalence_relation A → setoid.
271 (******************* first omomorphism theorem for sets **********************)
273 ndefinition eqrel_of_morphism:
274 ∀A,B. unary_morphism A B → compatible_equivalence_relation A.
277 [ napply (λx,y. f x = f y)
278 | #x; napply refl | #x; #y; napply sym | #x; #y; #z; napply trans]
279 ##| #x; #x'; #H; nwhd; alias symbol "prop1" = "prop1".
280 napply (.= (†H)); napply refl ]
283 ndefinition canonical_proj: ∀A,R. unary_morphism A (quotient A R).
285 [ napply (λx.x) | #a; #a'; #H; napply (compatibility … R … H) ]
288 ndefinition quotiented_mor:
289 ∀A,B.∀f:unary_morphism A B.
290 unary_morphism (quotient … (eqrel_of_morphism … f)) B.
292 [ napply f | #a; #a'; #H; nassumption]
295 nlemma first_omomorphism_theorem_functions1:
296 ∀A,B.∀f: unary_morphism A B.
297 ∀x. f x = quotiented_mor … (canonical_proj … (eqrel_of_morphism … f) x).
298 #A; #B; #f; #x; napply refl;
301 ndefinition surjective ≝
302 λA,B.λS: qpowerclass A.λT: qpowerclass B.λf:unary_morphism A B.
303 ∀y. y ∈ T → ∃x. x ∈ S ∧ f x = y.
305 ndefinition injective ≝
306 λA,B.λS: qpowerclass A.λf:unary_morphism A B.
307 ∀x,x'. x ∈ S → x' ∈ S → f x = f x' → x = x'.
309 nlemma first_omomorphism_theorem_functions2:
310 ∀A,B.∀f: unary_morphism A B.
311 surjective … (Full_set ?) (Full_set ?) (canonical_proj ? (eqrel_of_morphism … f)).
312 #A; #B; #f; nwhd; #y; #Hy; @ y; @ I ; napply refl;
313 (* bug, prova @ I refl *)
316 nlemma first_omomorphism_theorem_functions3:
317 ∀A,B.∀f: unary_morphism A B.
318 injective … (Full_set ?) (quotiented_mor … f).
319 #A; #B; #f; nwhd; #x; #x'; #Hx; #Hx'; #K; nassumption.
322 nrecord isomorphism (A, B : setoid) (S: qpowerclass A) (T: qpowerclass B) : Type[0] ≝
323 { iso_f:> unary_morphism A B;
324 f_closed: ∀x. x ∈ S → iso_f x ∈ T;
325 f_sur: surjective … S T iso_f;
326 f_inj: injective … S iso_f
330 nrecord isomorphism (A, B : setoid) (S: qpowerclass A) (T: qpowerclass B) : CProp[0] ≝
331 { iso_f:> unary_morphism A B;
332 f_closed: ∀x. x ∈ pc A S → fun1 ?? iso_f x ∈ pc B T}.
339 λxxx:isomorphism A B S T.
341 return λxxx:isomorphism A B S T.
343 ∀x_72: mem (carr A) (pc A S) x.
344 mem (carr B) (pc B T) (fun1 A B ((λ_.?) A B S T xxx) x)
345 with [ mk_isomorphism _ yyy ⇒ yyy ] ).