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 (**************************************************************************)
17 record binary_relation (A,B: SET) : Type1 ≝
18 { satisfy:> binary_morphism1 A B CPROP }.
20 notation < "hvbox (x \nbsp \natur term 90 r \nbsp y)" with precedence 45 for @{'satisfy $r $x $y}.
21 notation > "hvbox (x \natur term 90 r y)" with precedence 45 for @{'satisfy $r $x $y}.
22 interpretation "relation applied" 'satisfy r x y = (fun21 ??? (satisfy ?? r) x y).
24 definition binary_relation_setoid: SET → SET → setoid1.
27 [ apply (binary_relation A B)
29 [ apply (λA,B.λr,r': binary_relation A B. ∀x,y. r x y ↔ r' x y)
30 | simplify; intros 3; split; intro; assumption
31 | simplify; intros 5; split; intro;
32 [ apply (fi ?? (f ??)) | apply (if ?? (f ??))] assumption
33 | simplify; intros 7; split; intro;
34 [ apply (if ?? (f1 ??)) | apply (fi ?? (f ??)) ]
35 [ apply (if ?? (f ??)) | apply (fi ?? (f1 ??)) ]
39 definition binary_relation_of_binary_relation_setoid :
40 ∀A,B.binary_relation_setoid A B → binary_relation A B ≝ λA,B,c.c.
41 coercion binary_relation_of_binary_relation_setoid.
43 definition composition:
45 (binary_relation_setoid A B) × (binary_relation_setoid B C) ⇒_1 (binary_relation_setoid A C).
51 [ apply (λs1:A.λs3:C.∃s2:B. s1 ♮R12 s2 ∧ s2 ♮R23 s3);
53 split; intro; cases e2 (w H3); clear e2; exists; [1,3: apply w ]
54 [ apply (. (e^-1‡#)‡(#‡e1^-1)); assumption
55 | apply (. (e‡#)‡(#‡e1)); assumption]]
56 | intros 8; split; intro H2; simplify in H2 ⊢ %;
57 cases H2 (w H3); clear H2; exists [1,3: apply w] cases H3 (H2 H4); clear H3;
58 [ lapply (if ?? (e x w) H2) | lapply (fi ?? (e x w) H2) ]
59 [ lapply (if ?? (e1 w y) H4)| lapply (fi ?? (e1 w y) H4) ]
60 exists; try assumption;
64 definition REL: category1.
67 | intros (T T1); apply (binary_relation_setoid T T1)
68 | intros; constructor 1;
69 constructor 1; unfold setoid1_of_setoid; simplify;
70 [ (* changes required to avoid universe inconsistency *)
71 change with (carr o → carr o → CProp); intros; apply (eq ? c c1)
72 | intros; split; intro; change in a a' b b' with (carr o);
73 change in e with (eq ? a a'); change in e1 with (eq ? b b');
74 [ apply (.= (e ^ -1));
83 cases f (w H); clear f; cases H; clear H;
84 [cases f (w1 H); clear f | cases f1 (w1 H); clear f1]
86 exists; try assumption;
87 split; try assumption;
88 exists; try assumption;
90 |6,7: intros 5; unfold composition; simplify; split; intro;
91 unfold setoid1_of_setoid in x y; simplify in x y;
92 [1,3: cases e (w H1); clear e; cases H1; clear H1; unfold;
93 [ apply (. (e : eq1 ? x w)‡#); assumption
94 | apply (. #‡(e : eq1 ? w y)^-1); assumption]
95 |2,4: exists; try assumption; split;
96 (* change required to avoid universe inconsistency *)
97 change in x with (carr o1); change in y with (carr o2);
98 first [apply refl | assumption]]]
101 definition setoid_of_REL : objs1 REL → setoid ≝ λx.x.
102 coercion setoid_of_REL.
104 definition binary_relation_setoid_of_arrow1_REL :
105 ∀P,Q. arrows1 REL P Q → binary_relation_setoid P Q ≝ λP,Q,x.x.
106 coercion binary_relation_setoid_of_arrow1_REL.
108 definition full_subset: ∀s:REL. Ω^s.
109 apply (λs.{x | True});
110 intros; simplify; split; intro; assumption.
113 coercion full_subset.
115 alias symbol "arrows1_SET" (instance 2) = "'arrows1_SET low".
116 definition comprehension: ∀b:REL. (b ⇒_1 CPROP) → Ω^b.
117 apply (λb:REL. λP: b ⇒_1 CPROP. {x | P x});
119 apply (.= †e); apply refl1.
122 interpretation "subset comprehension" 'comprehension s p =
123 (comprehension s (mk_unary_morphism1 ?? p ?)).
125 definition ext: ∀X,S:REL. (arrows1 ? X S) × S ⇒_1 (Ω^X).
126 apply (λX,S.mk_binary_morphism1 ??? (λr:arrows1 REL X S.λf:S.{x ∈ X | x ♮r f}) ?);
127 [ intros; simplify; apply (.= (e‡#)); apply refl1
128 | intros; simplify; split; intros; simplify;
129 [ change with (∀x. x ♮a b → x ♮a' b'); intros;
130 apply (. (#‡e1^-1)); whd in e; apply (if ?? (e ??)); assumption
131 | change with (∀x. x ♮a' b' → x ♮a b); intros;
132 apply (. (#‡e1)); whd in e; apply (fi ?? (e ??));assumption]]
135 definition extS: ∀X,S:REL. ∀r: arrows1 ? X S. Ω \sup S ⇒ Ω \sup X.
136 (* ∃ is not yet a morphism apply (λX,S,r,F.{x ∈ X | ∃a. a ∈ F ∧ x ♮r a});*)
137 intros (X S r); constructor 1;
138 [ intro F; constructor 1; constructor 1;
139 [ apply (λx. x ∈ X ∧ ∃a:S. a ∈ F ∧ x ♮r a);
140 | intros; split; intro; cases f (H1 H2); clear f; split;
141 [ apply (. (H‡#)); assumption
142 |3: apply (. (H\sup -1‡#)); assumption
143 |2,4: cases H2 (w H3); exists; [1,3: apply w]
144 [ apply (. (#‡(H‡#))); assumption
145 | apply (. (#‡(H \sup -1‡#))); assumption]]]
146 | intros; split; simplify; intros; cases f; cases H1; split;
148 |2,4: exists; [1,3: apply w]
149 [ apply (. (#‡H)‡#); assumption
150 | apply (. (#‡H\sup -1)‡#); assumption]]]
153 lemma equalset_extS_id_X_X: ∀o:REL.∀X.extS ?? (id1 ? o) X = X.
155 unfold extS; simplify;
157 [ intros 2; change with (a ∈ X);
161 change in f2 with (eq1 ? a w);
162 apply (. (f2\sup -1‡#));
164 | intros 2; change in f with (a ∈ X);
167 | exists; [ apply a ]
170 | change with (a = a); apply refl]]]
173 lemma extS_com: ∀o1,o2,o3,c1,c2,S. extS o1 o3 (c2 ∘ c1) S = extS o1 o2 c1 (extS o2 o3 c2 S).
174 intros; unfold extS; simplify; split; intros; simplify; intros;
175 [ cases f (H1 H2); cases H2 (w H3); clear f H2; split; [assumption]
176 cases H3 (H4 H5); cases H5 (w1 H6); clear H3 H5; cases H6 (H7 H8); clear H6;
177 exists; [apply w1] split [2: assumption] constructor 1; [assumption]
178 exists; [apply w] split; assumption
179 | cases f (H1 H2); cases H2 (w H3); clear f H2; split; [assumption]
180 cases H3 (H4 H5); cases H4 (w1 H6); clear H3 H4; cases H6 (w2 H7); clear H6;
181 cases H7; clear H7; exists; [apply w2] split; [assumption] exists [apply w] split;
186 (* the same as ⋄ for a basic pair *)
187 definition image: ∀U,V:REL. (arrows1 ? U V) × Ω^U ⇒_1 Ω^V.
188 intros; constructor 1;
189 [ apply (λr: arrows1 ? U V.λS: Ω \sup U. {y | ∃x:U. x ♮r y ∧ x ∈ S });
190 intros; simplify; split; intro; cases e1; exists [1,3: apply w]
191 [ apply (. (#‡e^-1)‡#); assumption
192 | apply (. (#‡e)‡#); assumption]
193 | intros; split; simplify; intros; cases e2; exists [1,3: apply w]
194 [ apply (. #‡(#‡e1^-1)); cases x; split; try assumption;
195 apply (if ?? (e ??)); assumption
196 | apply (. #‡(#‡e1)); cases x; split; try assumption;
197 apply (if ?? (e ^ -1 ??)); assumption]]
200 (* the same as □ for a basic pair *)
201 definition minus_star_image: ∀U,V:REL. (arrows1 ? U V) × Ω^U ⇒_1 Ω^V.
202 intros; constructor 1;
203 [ apply (λr: arrows1 ? U V.λS: Ω \sup U. {y | ∀x:U. x ♮r y → x ∈ S});
204 intros; simplify; split; intros; apply f;
205 [ apply (. #‡e); assumption
206 | apply (. #‡e ^ -1); assumption]
207 | intros; split; simplify; intros; [ apply (. #‡e1^ -1); | apply (. #‡e1 )]
208 apply f; [ apply (if ?? (e ^ -1 ??)); | apply (if ?? (e ??)) ] assumption]
211 (* the same as Rest for a basic pair *)
212 definition star_image: ∀U,V:REL. (arrows1 ? U V) × Ω^V ⇒_1 Ω^U.
213 intros; constructor 1;
214 [ apply (λr: arrows1 ? U V.λS: Ω \sup V. {x | ∀y:V. x ♮r y → y ∈ S});
215 intros; simplify; split; intros; apply f;
216 [ apply (. e ‡#); assumption
217 | apply (. e^ -1‡#); assumption]
218 | intros; split; simplify; intros; [ apply (. #‡e1 ^ -1); | apply (. #‡e1)]
219 apply f; [ apply (if ?? (e ^ -1 ??)); | apply (if ?? (e ??)) ] assumption]
222 (* the same as Ext for a basic pair *)
223 definition minus_image: ∀U,V:REL. (arrows1 ? U V) × Ω^V ⇒_1 Ω^U.
224 intros; constructor 1;
225 [ apply (λr: arrows1 ? U V.λS: Ω \sup V. {x | (*∃x:U. x ♮r y ∧ x ∈ S*)
226 exT ? (λy:V.x ♮r y ∧ y ∈ S) });
227 intros; simplify; split; intro; cases e1; exists [1,3: apply w]
228 [ apply (. (e ^ -1‡#)‡#); assumption
229 | apply (. (e‡#)‡#); assumption]
230 | intros; split; simplify; intros; cases e2; exists [1,3: apply w]
231 [ apply (. #‡(#‡e1 ^ -1)); cases x; split; try assumption;
232 apply (if ?? (e ??)); assumption
233 | apply (. #‡(#‡e1)); cases x; split; try assumption;
234 apply (if ?? (e ^ -1 ??)); assumption]]
238 (* minus_image is the same as ext *)
240 theorem image_id: ∀o,U. image o o (id1 REL o) U = U.
241 intros; unfold image; simplify; split; simplify; intros;
242 [ change with (a ∈ U);
243 cases H; cases x; change in f with (eq1 ? w a); apply (. f‡#); assumption
244 | change in f with (a ∈ U);
245 exists; [apply a] split; [ change with (a = a); apply refl | assumption]]
248 theorem minus_star_image_id: ∀o,U. minus_star_image o o (id1 REL o) U = U.
249 intros; unfold minus_star_image; simplify; split; simplify; intros;
250 [ change with (a ∈ U); apply H; change with (a=a); apply refl
251 | change in f1 with (eq1 ? x a); apply (. f1 \sup -1‡#); apply f]
254 theorem image_comp: ∀A,B,C,r,s,X. image A C (r ∘ s) X = image B C r (image A B s X).
255 intros; unfold image; simplify; split; simplify; intros; cases H; clear H; cases x;
256 clear x; [ cases f; clear f; | cases f1; clear f1 ]
257 exists; try assumption; cases x; clear x; split; try assumption;
258 exists; try assumption; split; assumption.
261 theorem minus_star_image_comp:
263 minus_star_image A C (r ∘ s) X = minus_star_image B C r (minus_star_image A B s X).
264 intros; unfold minus_star_image; simplify; split; simplify; intros; whd; intros;
265 [ apply H; exists; try assumption; split; assumption
266 | change with (x ∈ X); cases f; cases x1; apply H; assumption]
274 ∀x. ext ?? (b∘a) x = extS ?? a (ext ?? b x).
276 unfold ext; unfold extS; simplify; split; intro; simplify; intros;
277 cases f; clear f; split; try assumption;
278 [ cases f2; clear f2; cases x1; clear x1; exists; [apply w] split;
279 [1: split] assumption;
280 | cases H; clear H; cases x1; clear x1; exists [apply w]; split;
281 [2: cases f] assumption]
284 theorem extS_singleton:
285 ∀o1,o2.∀a:arrows1 ? o1 o2.∀x.extS o1 o2 a (singleton o2 x) = ext o1 o2 a x.
286 intros; unfold extS; unfold ext; unfold singleton; simplify;
287 split; intros 2; simplify; cases f; split; try assumption;
288 [ cases H; cases x1; change in f2 with (eq1 ? x w); apply (. #‡f2 \sup -1);
290 | exists; try assumption; split; try assumption; change with (x = x); apply refl]