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 include "logic/cprop_connectives.ma".
17 definition Type0 := Type.
18 definition Type1 := Type.
19 definition Type2 := Type.
20 definition Type3 := Type.
21 definition Type0_lt_Type1 := (Type0 : Type1).
22 definition Type1_lt_Type2 := (Type1 : Type2).
23 definition Type2_lt_Type3 := (Type2 : Type3).
25 definition Type_OF_Type0: Type0 → Type := λx.x.
26 definition Type_OF_Type1: Type1 → Type := λx.x.
27 definition Type_OF_Type2: Type2 → Type := λx.x.
28 definition Type_OF_Type3: Type3 → Type := λx.x.
29 coercion Type_OF_Type0.
30 coercion Type_OF_Type1.
31 coercion Type_OF_Type2.
32 coercion Type_OF_Type3.
34 definition CProp0 := CProp.
35 definition CProp1 := CProp.
36 definition CProp2 := CProp.
37 definition CProp0_lt_CProp1 := (CProp0 : CProp1).
38 definition CProp1_lt_CProp2 := (CProp1 : CProp2).
40 definition CProp_OF_CProp0: CProp0 → CProp := λx.x.
41 definition CProp_OF_CProp1: CProp1 → CProp := λx.x.
42 definition CProp_OF_CProp2: CProp2 → CProp := λx.x.
44 record equivalence_relation (A:Type0) : Type1 ≝
45 { eq_rel:2> A → A → CProp0;
46 refl: reflexive ? eq_rel;
47 sym: symmetric ? eq_rel;
48 trans: transitive ? eq_rel
51 record setoid : Type1 ≝
53 eq: equivalence_relation carr
56 definition reflexive1 ≝ λA:Type1.λR:A→A→CProp1.∀x:A.R x x.
57 definition symmetric1 ≝ λC:Type1.λlt:C→C→CProp1. ∀x,y:C.lt x y → lt y x.
58 definition transitive1 ≝ λA:Type1.λR:A→A→CProp1.∀x,y,z:A.R x y → R y z → R x z.
60 record equivalence_relation1 (A:Type1) : Type1 ≝
61 { eq_rel1:2> A → A → CProp1;
62 refl1: reflexive1 ? eq_rel1;
63 sym1: symmetric1 ? eq_rel1;
64 trans1: transitive1 ? eq_rel1
67 record setoid1: Type2 ≝
69 eq1: equivalence_relation1 carr1
72 definition setoid1_of_setoid: setoid → setoid1.
84 (* questa coercion e' necessaria per problemi di unificazione *)
85 coercion setoid1_of_setoid.
87 definition reflexive2 ≝ λA:Type2.λR:A→A→CProp2.∀x:A.R x x.
88 definition symmetric2 ≝ λC:Type2.λlt:C→C→CProp2. ∀x,y:C.lt x y → lt y x.
89 definition transitive2 ≝ λA:Type2.λR:A→A→CProp2.∀x,y,z:A.R x y → R y z → R x z.
91 record equivalence_relation2 (A:Type2) : Type2 ≝
92 { eq_rel2:2> A → A → CProp2;
93 refl2: reflexive2 ? eq_rel2;
94 sym2: symmetric2 ? eq_rel2;
95 trans2: transitive2 ? eq_rel2
98 record setoid2: Type3 ≝
100 eq2: equivalence_relation2 carr2
104 definition Leibniz: Type → setoid.
109 [ apply (λx,y:T.cic:/matita/logic/equality/eq.ind#xpointer(1/1) ? x y)
110 | alias id "refl_eq" = "cic:/matita/logic/equality/eq.ind#xpointer(1/1/1)".
112 | alias id "sym_eq" = "cic:/matita/logic/equality/sym_eq.con".
114 | alias id "trans_eq" = "cic:/matita/logic/equality/trans_eq.con".
121 interpretation "setoid2 eq" 'eq x y = (eq_rel2 _ (eq2 _) x y).
122 interpretation "setoid1 eq" 'eq x y = (eq_rel1 _ (eq1 _) x y).
123 interpretation "setoid eq" 'eq x y = (eq_rel _ (eq _) x y).
124 interpretation "setoid2 symmetry" 'invert r = (sym2 ____ r).
125 interpretation "setoid1 symmetry" 'invert r = (sym1 ____ r).
126 interpretation "setoid symmetry" 'invert r = (sym ____ r).
127 notation ".= r" with precedence 50 for @{'trans $r}.
128 interpretation "trans2" 'trans r = (trans2 _____ r).
129 interpretation "trans1" 'trans r = (trans1 _____ r).
130 interpretation "trans" 'trans r = (trans _____ r).
132 record unary_morphism (A,B: setoid) : Type0 ≝
134 prop1: ∀a,a'. eq ? a a' → eq ? (fun1 a) (fun1 a')
137 record unary_morphism1 (A,B: setoid1) : Type1 ≝
139 prop11: ∀a,a'. eq1 ? a a' → eq1 ? (fun11 a) (fun11 a')
142 record unary_morphism2 (A,B: setoid2) : Type2 ≝
144 prop12: ∀a,a'. eq2 ? a a' → eq2 ? (fun12 a) (fun12 a')
147 record binary_morphism (A,B,C:setoid) : Type0 ≝
149 prop2: ∀a,a',b,b'. eq ? a a' → eq ? b b' → eq ? (fun2 a b) (fun2 a' b')
152 record binary_morphism1 (A,B,C:setoid1) : Type1 ≝
153 { fun21:2> A → B → C;
154 prop21: ∀a,a',b,b'. eq1 ? a a' → eq1 ? b b' → eq1 ? (fun21 a b) (fun21 a' b')
157 record binary_morphism2 (A,B,C:setoid2) : Type2 ≝
158 { fun22:2> A → B → C;
159 prop22: ∀a,a',b,b'. eq2 ? a a' → eq2 ? b b' → eq2 ? (fun22 a b) (fun22 a' b')
162 notation "† c" with precedence 90 for @{'prop1 $c }.
163 notation "l ‡ r" with precedence 90 for @{'prop2 $l $r }.
164 notation "#" with precedence 90 for @{'refl}.
165 interpretation "prop1" 'prop1 c = (prop1 _____ c).
166 interpretation "prop11" 'prop1 c = (prop11 _____ c).
167 interpretation "prop12" 'prop1 c = (prop12 _____ c).
168 interpretation "prop2" 'prop2 l r = (prop2 ________ l r).
169 interpretation "prop21" 'prop2 l r = (prop21 ________ l r).
170 interpretation "refl" 'refl = (refl ___).
171 interpretation "refl1" 'refl = (refl1 ___).
172 interpretation "refl2" 'refl = (refl2 ___).
174 definition CPROP: setoid1.
179 | intros 1; split; intro; assumption
180 | intros 3; cases H; split; assumption
181 | intros 5; cases H; cases H1; split; intro;
182 [ apply (H4 (H2 x1)) | apply (H3 (H5 z1))]]]
185 definition if': ∀A,B:CPROP. A = B → A → B.
186 intros; apply (if ?? e); assumption.
189 notation ". r" with precedence 50 for @{'if $r}.
190 interpretation "if" 'if r = (if' __ r).
192 definition and_morphism: binary_morphism1 CPROP CPROP CPROP.
195 | intros; split; intro; cases H; split;
197 | apply (if ?? e1 b1)
199 | apply (fi ?? e1 b1)]]
202 interpretation "and_morphism" 'and a b = (fun21 ___ and_morphism a b).
204 definition or_morphism: binary_morphism1 CPROP CPROP CPROP.
207 | intros; split; intro; cases H; [1,3:left |2,4: right]
210 | apply (if ?? e1 b1)
211 | apply (fi ?? e1 b1)]]
214 interpretation "or_morphism" 'or a b = (fun21 ___ or_morphism a b).
216 definition if_morphism: binary_morphism1 CPROP CPROP CPROP.
218 [ apply (λA,B. A → B)
219 | intros; split; intros;
220 [ apply (if ?? e1); apply H; apply (fi ?? e); assumption
221 | apply (fi ?? e1); apply H; apply (if ?? e); assumption]]
225 definition eq_morphism: ∀S:setoid. binary_morphism S S CPROP.
228 [ apply (eq_rel ? (eq S))
229 | intros; split; intro;
230 [ apply (.= H \sup -1);
239 record category : Type1 ≝
241 arrows: objs → objs → setoid;
242 id: ∀o:objs. arrows o o;
243 comp: ∀o1,o2,o3. binary_morphism1 (arrows o1 o2) (arrows o2 o3) (arrows o1 o3);
244 comp_assoc: ∀o1,o2,o3,o4. ∀a12,a23,a34.
245 comp o1 o3 o4 (comp o1 o2 o3 a12 a23) a34 = comp o1 o2 o4 a12 (comp o2 o3 o4 a23 a34);
246 id_neutral_left: ∀o1,o2. ∀a: arrows o1 o2. comp ??? (id o1) a = a;
247 id_neutral_right: ∀o1,o2. ∀a: arrows o1 o2. comp ??? a (id o2) = a
250 record category1 : Type2 ≝
252 arrows1: objs1 → objs1 → setoid1;
253 id1: ∀o:objs1. arrows1 o o;
254 comp1: ∀o1,o2,o3. binary_morphism1 (arrows1 o1 o2) (arrows1 o2 o3) (arrows1 o1 o3);
255 comp_assoc1: ∀o1,o2,o3,o4. ∀a12,a23,a34.
256 comp1 o1 o3 o4 (comp1 o1 o2 o3 a12 a23) a34 = comp1 o1 o2 o4 a12 (comp1 o2 o3 o4 a23 a34);
257 id_neutral_right1: ∀o1,o2. ∀a: arrows1 o1 o2. comp1 ??? (id1 o1) a = a;
258 id_neutral_left1: ∀o1,o2. ∀a: arrows1 o1 o2. comp1 ??? a (id1 o2) = a
261 record category2 : Type3 ≝
263 arrows2: objs2 → objs2 → setoid2;
264 id2: ∀o:objs2. arrows2 o o;
265 comp2: ∀o1,o2,o3. binary_morphism2 (arrows2 o1 o2) (arrows2 o2 o3) (arrows2 o1 o3);
266 comp_assoc2: ∀o1,o2,o3,o4. ∀a12,a23,a34.
267 comp2 o1 o3 o4 (comp2 o1 o2 o3 a12 a23) a34 = comp2 o1 o2 o4 a12 (comp2 o2 o3 o4 a23 a34);
268 id_neutral_right2: ∀o1,o2. ∀a: arrows2 o1 o2. comp2 ??? (id2 o1) a = a;
269 id_neutral_left2: ∀o1,o2. ∀a: arrows2 o1 o2. comp2 ??? a (id2 o2) = a
272 notation "'ASSOC'" with precedence 90 for @{'assoc}.
273 notation "'ASSOC1'" with precedence 90 for @{'assoc1}.
274 notation "'ASSOC2'" with precedence 90 for @{'assoc2}.
276 interpretation "category1 composition" 'compose x y = (fun22 ___ (comp2 ____) y x).
277 interpretation "category1 assoc" 'assoc1 = (comp_assoc2 ________).
278 interpretation "category1 composition" 'compose x y = (fun21 ___ (comp1 ____) y x).
279 interpretation "category1 assoc" 'assoc1 = (comp_assoc1 ________).
280 interpretation "category composition" 'compose x y = (fun2 ___ (comp ____) y x).
281 interpretation "category assoc" 'assoc = (comp_assoc ________).
283 (* bug grande come una casa?
284 Ma come fa a passare la quantificazione larga??? *)
285 definition unary_morphism_setoid: setoid → setoid → setoid.
288 [ apply (unary_morphism s s1);
290 [ intros (f g); apply (∀a:s. f a = g a);
291 | intros 1; simplify; intros; apply refl;
292 | simplify; intros; apply sym; apply H;
293 | simplify; intros; apply trans; [2: apply H; | skip | apply H1]]]
296 definition SET: category1.
299 | apply rule (λS,T:setoid.unary_morphism_setoid S T);
300 | intros; constructor 1; [ apply (λx:carr o.x); | intros; assumption ]
301 | intros; constructor 1; [ intros; constructor 1; [ apply (λx. t1 (t x)); | intros;
303 | intros; whd; intros; simplify; whd in H1; whd in H;
304 apply trans; [ apply (b (a' a1)); | lapply (prop1 ?? b (a a1) (a' a1));
305 [ apply Hletin | apply (e a1); ] | apply e1; ]]
306 | intros; whd; intros; simplify; apply refl;
307 | intros; simplify; whd; intros; simplify; apply refl;
308 | intros; simplify; whd; intros; simplify; apply refl;
312 definition setoid_of_SET: objs1 SET → setoid.
313 intros; apply o; qed.
314 coercion setoid_of_SET.
316 definition setoid1_of_SET: SET → setoid1.
317 intro; whd in t; apply setoid1_of_setoid; apply t.
319 coercion setoid1_of_SET.
321 definition eq': ∀w:SET.equivalence_relation ? := λw.eq w.
323 definition prop1_SET :
324 ∀A,B:SET.∀w:arrows1 SET A B.∀a,b:Type_OF_objs1 A.eq' ? a b→eq' ? (w a) (w b).
325 intros; apply (prop1 A B w a b e);
329 interpretation "SET dagger" 'prop1 h = (prop1_SET _ _ _ _ _ h).
330 notation "hbox(a break ⇒ b)" right associative with precedence 20 for @{ 'Imply $a $b }.
331 interpretation "unary morphism" 'Imply a b = (arrows1 SET a b).
332 interpretation "SET eq" 'eq x y = (eq_rel _ (eq' _) x y).
334 definition unary_morphism1_setoid1: setoid1 → setoid1 → setoid2.
337 [ apply (unary_morphism1 s s1);
339 [ intros (f g); apply (∀a: carr1 s. f a = g a);
340 | intros 1; simplify; intros; apply refl1;
341 | simplify; intros; apply sym1; apply H;
342 | simplify; intros; apply trans1; [2: apply H; | skip | apply H1]]]
345 definition SET1: category2.
348 | apply rule (λS,T.unary_morphism1_setoid1 S T);
349 | intros; constructor 1; [ apply (λx.x); | intros; assumption ]
350 | intros; constructor 1; [ intros; constructor 1; [ apply (λx. t1 (t x)); | intros;
352 | intros; whd; intros; simplify; whd in H1; whd in H;
353 apply trans1; [ apply (b (a' a1)); | lapply (prop11 ?? b (a a1) (a' a1));
354 [ apply Hletin | apply (e a1); ] | apply e1; ]]
355 | intros; whd; intros; simplify; apply refl1;
356 | intros; simplify; whd; intros; simplify; apply refl1;
357 | intros; simplify; whd; intros; simplify; apply refl1;
361 definition setoid1_OF_SET1: objs2 SET1 → setoid1.
362 intros; apply o; qed.
364 coercion setoid1_OF_SET1.
366 definition eq'': ∀w:SET1.equivalence_relation1 ? := λw.eq1 w.
368 definition prop11_SET1 :
369 ∀A,B:SET1.∀w:arrows2 SET1 A B.∀a,b:Type_OF_objs2 A.eq'' ? a b→eq'' ? (w a) (w b).
370 intros; apply (prop11 A B w a b e);
373 definition hint: Type_OF_category2 SET1 → Type1.
374 intro; whd in t; apply (carr1 t);
378 interpretation "SET dagger" 'prop1 h = (prop11_SET1 _ _ _ _ _ h).
379 notation "hbox(a break ⇒ b)" right associative with precedence 20 for @{ 'Imply $a $b }.
380 interpretation "unary morphism1" 'Imply a b = (arrows2 SET1 a b).
381 interpretation "SET1 eq" 'eq x y = (eq_rel1 _ (eq'' _) x y).