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 "o-algebra.ma".
16 include "notation.ma".
18 record Obasic_pair: Type2 ≝
21 Orel: arrows2 ? Oconcr Oform
24 interpretation "basic pair relation indexed" 'Vdash2 x y c = (Orel c x y).
25 interpretation "basic pair relation (non applied)" 'Vdash c = (Orel c).
27 alias symbol "eq" = "setoid1 eq".
28 alias symbol "compose" = "category1 composition".
31 alias symbol "eq" = "setoid2 eq".
32 alias symbol "compose" = "category2 composition".
33 record Orelation_pair (BP1,BP2: Obasic_pair): Type2 ≝
34 { Oconcr_rel: arrows2 ? (Oconcr BP1) (Oconcr BP2);
35 Oform_rel: arrows2 ? (Oform BP1) (Oform BP2);
36 Ocommute: ⊩ ∘ Oconcr_rel = Oform_rel ∘ ⊩
39 interpretation "concrete relation" 'concr_rel r = (Oconcr_rel __ r).
40 interpretation "formal relation" 'form_rel r = (Oform_rel __ r).
42 definition Orelation_pair_equality:
43 ∀o1,o2. equivalence_relation2 (Orelation_pair o1 o2).
46 [ apply (λr,r'. ⊩ ∘ r \sub\c = ⊩ ∘ r' \sub\c);
59 (* qui setoid1 e' giusto: ma non lo e'!!! *)
60 definition Orelation_pair_setoid: Obasic_pair → Obasic_pair → setoid2.
63 [ apply (Orelation_pair o o1)
64 | apply Orelation_pair_equality
68 definition Orelation_pair_of_Orelation_pair_setoid:
69 ∀P,Q. Orelation_pair_setoid P Q → Orelation_pair P Q ≝ λP,Q,x.x.
70 coercion Orelation_pair_of_Orelation_pair_setoid.
72 lemma eq_to_eq': ∀o1,o2.∀r,r': Orelation_pair_setoid o1 o2. r=r' → r \sub\f ∘ ⊩ = r'\sub\f ∘ ⊩.
73 intros 5 (o1 o2 r r' H); change in H with (⊩ ∘ r\sub\c = ⊩ ∘ r'\sub\c);
74 apply (.= ((Ocommute ?? r) ^ -1));
76 apply (.= (Ocommute ?? r'));
81 definition Oid_relation_pair: ∀o:Obasic_pair. Orelation_pair o o.
85 | lapply (id_neutral_right2 ? (Oconcr o) ? (⊩)) as H;
86 lapply (id_neutral_left2 ?? (Oform o) (⊩)) as H1;
91 definition Orelation_pair_composition:
92 ∀o1,o2,o3. binary_morphism2 (Orelation_pair_setoid o1 o2) (Orelation_pair_setoid o2 o3) (Orelation_pair_setoid o1 o3).
97 [ apply (r1 \sub\c ∘ r \sub\c)
98 | apply (r1 \sub\f ∘ r \sub\f)
99 | lapply (Ocommute ?? r) as H;
100 lapply (Ocommute ?? r1) as H1;
101 apply rule (.= ASSOC);
103 apply rule (.= ASSOC ^ -1);
107 change with (⊩ ∘ (b\sub\c ∘ a\sub\c) = ⊩ ∘ (b'\sub\c ∘ a'\sub\c));
108 change in e with (⊩ ∘ a \sub\c = ⊩ ∘ a' \sub\c);
109 change in e1 with (⊩ ∘ b \sub\c = ⊩ ∘ b' \sub\c);
110 apply rule (.= ASSOC);
112 apply (.= #‡(Ocommute ?? b'));
113 apply rule (.= ASSOC \sup -1);
115 apply rule (.= ASSOC);
116 apply (.= #‡(Ocommute ?? b')\sup -1);
117 apply rule (ASSOC \sup -1)]
120 definition OBP: category2.
123 | apply Orelation_pair_setoid
124 | apply Oid_relation_pair
125 | apply Orelation_pair_composition
127 change with (⊩ ∘ (a34\sub\c ∘ (a23\sub\c ∘ a12\sub\c)) =
128 ⊩ ∘ ((a34\sub\c ∘ a23\sub\c) ∘ a12\sub\c));
129 apply rule (ASSOC‡#);
131 change with (⊩ ∘ (a\sub\c ∘ (Oid_relation_pair o1)\sub\c) = ⊩ ∘ a\sub\c);
132 apply ((id_neutral_right2 ????)‡#);
134 change with (⊩ ∘ ((Oid_relation_pair o2)\sub\c ∘ a\sub\c) = ⊩ ∘ a\sub\c);
135 apply ((id_neutral_left2 ????)‡#);]
138 definition Obasic_pair_of_objs2_OBP: objs2 OBP → Obasic_pair ≝ λx.x.
139 coercion Obasic_pair_of_objs2_OBP.
141 definition Orelation_pair_setoid_of_arrows2_OBP:
142 ∀P,Q.arrows2 OBP P Q → Orelation_pair_setoid P Q ≝ λP,Q,c.c.
143 coercion Orelation_pair_setoid_of_arrows2_OBP.
146 definition BPext: ∀o: BP. form o ⇒ Ω \sup (concr o).
147 intros; constructor 1;
148 [ apply (ext ? ? (rel o));
154 definition BPextS: ∀o: BP. Ω \sup (form o) ⇒ Ω \sup (concr o) ≝
159 definition fintersects: ∀o: BP. binary_morphism1 (form o) (form o) (Ω \sup (form o)).
160 intros (o); constructor 1;
161 [ apply (λa,b: form o.{c | BPext o c ⊆ BPext o a ∩ BPext o b });
162 intros; simplify; apply (.= (†H)‡#); apply refl1
163 | intros; split; simplify; intros;
164 [ apply (. #‡((†H)‡(†H1))); assumption
165 | apply (. #‡((†H\sup -1)‡(†H1\sup -1))); assumption]]
168 interpretation "fintersects" 'fintersects U V = (fun1 ___ (fintersects _) U V).
170 definition fintersectsS:
171 ∀o:BP. binary_morphism1 (Ω \sup (form o)) (Ω \sup (form o)) (Ω \sup (form o)).
172 intros (o); constructor 1;
173 [ apply (λo: basic_pair.λa,b: Ω \sup (form o).{c | BPext o c ⊆ BPextS o a ∩ BPextS o b });
174 intros; simplify; apply (.= (†H)‡#); apply refl1
175 | intros; split; simplify; intros;
176 [ apply (. #‡((†H)‡(†H1))); assumption
177 | apply (. #‡((†H\sup -1)‡(†H1\sup -1))); assumption]]
180 interpretation "fintersectsS" 'fintersects U V = (fun1 ___ (fintersectsS _) U V).
184 definition relS: ∀o: BP. binary_morphism1 (concr o) (Ω \sup (form o)) CPROP.
185 intros (o); constructor 1;
186 [ apply (λx:concr o.λS: Ω \sup (form o).∃y: form o.y ∈ S ∧ x ⊩ y);
187 | intros; split; intros; cases H2; exists [1,3: apply w]
188 [ apply (. (#‡H1)‡(H‡#)); assumption
189 | apply (. (#‡H1 \sup -1)‡(H \sup -1‡#)); assumption]]
192 interpretation "basic pair relation for subsets" 'Vdash2 x y = (fun1 (concr _) __ (relS _) x y).
193 interpretation "basic pair relation for subsets (non applied)" 'Vdash = (fun1 ___ (relS _)).
196 notation "□ \sub b" non associative with precedence 90 for @{'box $b}.
197 notation > "□_term 90 b" non associative with precedence 90 for @{'box $b}.
198 interpretation "Universal image ⊩⎻*" 'box x = (fun12 _ _ (or_f_minus_star _ _) (Orel x)).
200 notation "◊ \sub b" non associative with precedence 90 for @{'diamond $b}.
201 notation > "◊_term 90 b" non associative with precedence 90 for @{'diamond $b}.
202 interpretation "Existential image ⊩" 'diamond x = (fun12 _ _ (or_f _ _) (Orel x)).
204 notation "'Rest' \sub b" non associative with precedence 90 for @{'rest $b}.
205 notation > "'Rest'⎽term 90 b" non associative with precedence 90 for @{'rest $b}.
206 interpretation "Universal pre-image ⊩*" 'rest x = (fun12 _ _ (or_f_star _ _) (Orel x)).
208 notation "'Ext' \sub b" non associative with precedence 90 for @{'ext $b}.
209 notation > "'Ext'⎽term 90 b" non associative with precedence 90 for @{'ext $b}.
210 interpretation "Existential pre-image ⊩⎻" 'ext x = (fun12 _ _ (or_f_minus _ _) (Orel x)).