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 "relations.ma".
17 record basic_pair: Type1 ≝
20 rel: arrows1 ? concr form
23 notation "x ⊩ y" with precedence 45 for @{'Vdash2 $x $y}.
24 notation "⊩" with precedence 60 for @{'Vdash}.
26 interpretation "basic pair relation" 'Vdash2 x y = (rel _ x y).
27 interpretation "basic pair relation (non applied)" 'Vdash = (rel _).
29 alias symbol "eq" = "setoid1 eq".
30 alias symbol "compose" = "category1 composition".
31 record relation_pair (BP1,BP2: basic_pair): Type1 ≝
32 { concr_rel: arrows1 ? (concr BP1) (concr BP2);
33 form_rel: arrows1 ? (form BP1) (form BP2);
34 commute: ⊩ ∘ concr_rel = form_rel ∘ ⊩
37 notation "hvbox (r \sub \c)" with precedence 90 for @{'concr_rel $r}.
38 notation "hvbox (r \sub \f)" with precedence 90 for @{'form_rel $r}.
40 interpretation "concrete relation" 'concr_rel r = (concr_rel __ r).
41 interpretation "formal relation" 'form_rel r = (form_rel __ r).
43 include "o-basic_pairs.ma".
44 (* Qui, per fare le cose per bene, ci serve la nozione di funtore categorico *)
45 definition o_basic_pair_of_basic_pair: cic:/matita/formal_topology/basic_pairs/basic_pair.ind#xpointer(1/1) → basic_pair.
48 [ apply (SUBSETS (concr b));
49 | apply (SUBSETS (form b));
50 | apply (orelation_of_relation ?? (rel b)); ]
53 definition o_relation_pair_of_relation_pair:
54 ∀BP1,BP2.cic:/matita/formal_topology/basic_pairs/relation_pair.ind#xpointer(1/1) BP1 BP2 →
55 relation_pair (o_basic_pair_of_basic_pair BP1) (o_basic_pair_of_basic_pair BP2).
58 [ apply (orelation_of_relation ?? (r \sub \c));
59 | apply (orelation_of_relation ?? (r \sub \f));
64 definition relation_pair_equality:
65 ∀o1,o2. equivalence_relation1 (relation_pair o1 o2).
68 [ apply (λr,r'. ⊩ ∘ r \sub\c = ⊩ ∘ r' \sub\c);
81 definition relation_pair_setoid: basic_pair → basic_pair → setoid1.
84 [ apply (relation_pair b b1)
85 | apply relation_pair_equality
89 lemma eq_to_eq': ∀o1,o2.∀r,r': relation_pair_setoid o1 o2. r=r' → r \sub\f ∘ ⊩ = r'\sub\f ∘ ⊩.
90 intros 7 (o1 o2 r r' H c1 f2);
92 [ lapply (fi ?? (commute ?? r c1 f2) H1) as H2;
93 lapply (if ?? (H c1 f2) H2) as H3;
94 apply (if ?? (commute ?? r' c1 f2) H3);
95 | lapply (fi ?? (commute ?? r' c1 f2) H1) as H2;
96 lapply (fi ?? (H c1 f2) H2) as H3;
97 apply (if ?? (commute ?? r c1 f2) H3);
101 definition id_relation_pair: ∀o:basic_pair. relation_pair o o.
105 | lapply (id_neutral_right1 ? (concr o) ? (⊩)) as H;
106 lapply (id_neutral_left1 ?? (form o) (⊩)) as H1;
111 definition relation_pair_composition:
112 ∀o1,o2,o3. binary_morphism1 (relation_pair_setoid o1 o2) (relation_pair_setoid o2 o3) (relation_pair_setoid o1 o3).
117 [ apply (r1 \sub\c ∘ r \sub\c)
118 | apply (r1 \sub\f ∘ r \sub\f)
119 | lapply (commute ?? r) as H;
120 lapply (commute ?? r1) as H1;
123 apply (.= ASSOC1\sup -1);
127 change with (⊩ ∘ (b\sub\c ∘ a\sub\c) = ⊩ ∘ (b'\sub\c ∘ a'\sub\c));
128 change in H with (⊩ ∘ a \sub\c = ⊩ ∘ a' \sub\c);
129 change in H1 with (⊩ ∘ b \sub\c = ⊩ ∘ b' \sub\c);
132 apply (.= #‡(commute ?? b'));
133 apply (.= ASSOC1 \sup -1);
136 apply (.= #‡(commute ?? b')\sup -1);
137 apply (ASSOC1 \sup -1)]
140 definition BP: category1.
143 | apply relation_pair_setoid
144 | apply id_relation_pair
145 | apply relation_pair_composition
147 change with (⊩ ∘ (a34\sub\c ∘ (a23\sub\c ∘ a12\sub\c)) =
148 ⊩ ∘ ((a34\sub\c ∘ a23\sub\c) ∘ a12\sub\c));
151 change with (⊩ ∘ (a\sub\c ∘ (id_relation_pair o1)\sub\c) = ⊩ ∘ a\sub\c);
152 apply ((id_neutral_right1 ????)‡#);
154 change with (⊩ ∘ ((id_relation_pair o2)\sub\c ∘ a\sub\c) = ⊩ ∘ a\sub\c);
155 apply ((id_neutral_left1 ????)‡#);]
158 definition BPext: ∀o: BP. form o ⇒ Ω \sup (concr o).
159 intros; constructor 1;
160 [ apply (ext ? ? (rel o));
166 definition BPextS: ∀o: BP. Ω \sup (form o) ⇒ Ω \sup (concr o) ≝
169 definition fintersects: ∀o: BP. binary_morphism1 (form o) (form o) (Ω \sup (form o)).
170 intros (o); constructor 1;
171 [ apply (λa,b: form o.{c | BPext o c ⊆ BPext o a ∩ BPext o b });
172 intros; simplify; apply (.= (†H)‡#); apply refl1
173 | intros; split; simplify; intros;
174 [ apply (. #‡((†H)‡(†H1))); assumption
175 | apply (. #‡((†H\sup -1)‡(†H1\sup -1))); assumption]]
178 interpretation "fintersects" 'fintersects U V = (fun1 ___ (fintersects _) U V).
180 definition fintersectsS:
181 ∀o:BP. binary_morphism1 (Ω \sup (form o)) (Ω \sup (form o)) (Ω \sup (form o)).
182 intros (o); constructor 1;
183 [ apply (λo: basic_pair.λa,b: Ω \sup (form o).{c | BPext o c ⊆ BPextS o a ∩ BPextS o b });
184 intros; simplify; apply (.= (†H)‡#); apply refl1
185 | intros; split; simplify; intros;
186 [ apply (. #‡((†H)‡(†H1))); assumption
187 | apply (. #‡((†H\sup -1)‡(†H1\sup -1))); assumption]]
190 interpretation "fintersectsS" 'fintersects U V = (fun1 ___ (fintersectsS _) U V).
192 definition relS: ∀o: BP. binary_morphism1 (concr o) (Ω \sup (form o)) CPROP.
193 intros (o); constructor 1;
194 [ apply (λx:concr o.λS: Ω \sup (form o).∃y: form o.y ∈ S ∧ x ⊩ y);
195 | intros; split; intros; cases H2; exists [1,3: apply w]
196 [ apply (. (#‡H1)‡(H‡#)); assumption
197 | apply (. (#‡H1 \sup -1)‡(H \sup -1‡#)); assumption]]
200 interpretation "basic pair relation for subsets" 'Vdash2 x y = (fun1 (concr _) __ (relS _) x y).
201 interpretation "basic pair relation for subsets (non applied)" 'Vdash = (fun1 ___ (relS _)).