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-basic_pairs.ma".
16 include "o-basic_topologies.ma".
18 alias symbol "eq" = "setoid1 eq".
20 (* qui la notazione non va *)
21 lemma leq_to_eq_join: ∀S:OA.∀p,q:S. p ≤ q → q = (binary_join ? p q).
24 [ apply oa_density; intros;
26 unfold binary_join; simplify;
27 apply (. (oa_join_split : ?));
28 exists; [ apply false ]
31 | unfold binary_join; simplify;
32 apply (. (oa_join_sup : ?)); intro;
33 cases i; whd in ⊢ (? ? ? ? ? % ?);
34 [ assumption | apply oa_leq_refl ]]
37 lemma overlap_monotone_left: ∀S:OA.∀p,q,r:S. p ≤ q → p >< r → q >< r.
39 apply (. (leq_to_eq_join : ?)‡#);
42 | apply oa_overlap_sym;
43 unfold binary_join; simplify;
44 apply (. (oa_join_split : ?));
50 (* Part of proposition 9.9 *)
51 lemma f_minus_image_monotone: ∀S,T.∀R:arrows2 OA S T.∀p,q. p ≤ q → R⎻ p ≤ R⎻ q.
53 apply (. (or_prop2 : ?));
54 apply oa_leq_trans; [2: apply f; | skip | apply (. (or_prop2 : ?)^ -1); apply oa_leq_refl;]
57 (* Part of proposition 9.9 *)
58 lemma f_minus_star_image_monotone: ∀S,T.∀R:arrows2 OA S T.∀p,q. p ≤ q → R⎻* p ≤ R⎻* q.
60 apply (. (or_prop2 : ?)^ -1);
61 apply oa_leq_trans; [3: apply f; | skip | apply (. (or_prop2 : ?)); apply oa_leq_refl;]
64 (* Part of proposition 9.9 *)
65 lemma f_image_monotone: ∀S,T.∀R:arrows2 OA S T.∀p,q. p ≤ q → R p ≤ R q.
67 apply (. (or_prop1 : ?));
68 apply oa_leq_trans; [2: apply f; | skip | apply (. (or_prop1 : ?)^ -1); apply oa_leq_refl;]
71 (* Part of proposition 9.9 *)
72 lemma f_star_image_monotone: ∀S,T.∀R:arrows2 OA S T.∀p,q. p ≤ q → R* p ≤ R* q.
74 apply (. (or_prop1 : ?)^ -1);
75 apply oa_leq_trans; [3: apply f; | skip | apply (. (or_prop1 : ?)); apply oa_leq_refl;]
78 lemma lemma_10_2_a: ∀S,T.∀R:arrows2 OA S T.∀p. p ≤ R⎻* (R⎻ p).
80 apply (. (or_prop2 : ?)^-1);
84 lemma lemma_10_2_b: ∀S,T.∀R:arrows2 OA S T.∀p. R⎻ (R⎻* p) ≤ p.
86 apply (. (or_prop2 : ?));
90 lemma lemma_10_2_c: ∀S,T.∀R:arrows2 OA S T.∀p. p ≤ R* (R p).
92 apply (. (or_prop1 : ?)^-1);
96 lemma lemma_10_2_d: ∀S,T.∀R:arrows2 OA S T.∀p. R (R* p) ≤ p.
98 apply (. (or_prop1 : ?));
102 lemma lemma_10_3_a: ∀S,T.∀R:arrows2 OA S T.∀p. R⎻ (R⎻* (R⎻ p)) = R⎻ p.
103 intros; apply oa_leq_antisym;
104 [ apply lemma_10_2_b;
105 | apply f_minus_image_monotone;
106 apply lemma_10_2_a; ]
109 lemma lemma_10_3_b: ∀S,T.∀R:arrows2 OA S T.∀p. R* (R (R* p)) = R* p.
110 intros; apply oa_leq_antisym;
111 [ apply f_star_image_monotone;
112 apply (lemma_10_2_d ?? R p);
113 | apply lemma_10_2_c; ]
116 lemma lemma_10_3_c: ∀S,T.∀R:arrows2 OA S T.∀p. R (R* (R p)) = R p.
117 intros; apply oa_leq_antisym;
118 [ apply lemma_10_2_d;
119 | apply f_image_monotone;
120 apply (lemma_10_2_c ?? R p); ]
123 lemma lemma_10_3_d: ∀S,T.∀R:arrows2 OA S T.∀p. R⎻* (R⎻ (R⎻* p)) = R⎻* p.
124 intros; apply oa_leq_antisym;
125 [ apply f_minus_star_image_monotone;
126 apply (lemma_10_2_b ?? R p);
127 | apply lemma_10_2_a; ]
130 lemma lemma_10_4_a: ∀S,T.∀R:arrows2 OA S T.∀p. R⎻* (R⎻ (R⎻* (R⎻ p))) = R⎻* (R⎻ p).
131 intros; apply (†(lemma_10_3_a ?? R p));
134 lemma lemma_10_4_b: ∀S,T.∀R:arrows2 OA S T.∀p. R (R* (R (R* p))) = R (R* p).
135 intros; apply (†(lemma_10_3_b ?? R p));
138 lemma oa_overlap_sym': ∀o:OA.∀U,V:o. (U >< V) = (V >< U).
139 intros; split; intro; apply oa_overlap_sym; assumption.
142 (* Qui, per fare le cose per bene, ci serve la nozione di funtore categorico *)
143 definition o_basic_topology_of_o_basic_pair: BP → BTop.
147 | apply (□_t ∘ Ext⎽t);
148 | apply (◊_t ∘ Rest⎽t);
149 | intros 2; split; intro;
150 [ change with ((⊩) \sup ⎻* ((⊩) \sup ⎻ U) ≤ (⊩) \sup ⎻* ((⊩) \sup ⎻ V));
151 apply (. (#‡(lemma_10_4_a ?? (⊩) V)^-1));
152 apply f_minus_star_image_monotone;
153 apply f_minus_image_monotone;
155 | apply oa_leq_trans;
158 | change with (U ≤ (⊩)⎻* ((⊩)⎻ U));
159 apply (. (or_prop2 : ?) ^ -1);
160 apply oa_leq_refl; ]]
161 | intros 2; split; intro;
162 [ change with (◊_t ((⊩) \sup * U) ≤ ◊_t ((⊩) \sup * V));
163 apply (. ((lemma_10_4_b ?? (⊩) U)^-1)‡#);
164 apply (f_image_monotone ?? (⊩) ? ((⊩)* V));
165 apply f_star_image_monotone;
167 | apply oa_leq_trans;
170 | change with ((⊩) ((⊩)* V) ≤ V);
171 apply (. (or_prop1 : ?));
172 apply oa_leq_refl; ]]
174 apply (.= (oa_overlap_sym' : ?));
175 change with ((◊_t ((⊩)* V) >< (⊩)⎻* ((⊩)⎻ U)) = (U >< (◊_t ((⊩)* V))));
176 apply (.= (or_prop3 ?? (⊩) ((⊩)* V) ?));
177 apply (.= #‡(lemma_10_3_a : ?));
178 apply (.= (or_prop3 : ?)^-1);
179 apply (oa_overlap_sym' ? ((⊩) ((⊩)* V)) U); ]
182 definition o_continuous_relation_of_o_relation_pair:
183 ∀BP1,BP2.arrows2 BP BP1 BP2 →
184 arrows2 BTop (o_basic_topology_of_o_basic_pair BP1) (o_basic_topology_of_o_basic_pair BP2).
188 | unfold o_basic_topology_of_o_basic_pair; simplify; intros;
191 change in ⊢ (? ? ? (? ? ? ? %) ?) with ((t \sub \f ∘ (⊩)) ((⊩)* U));
192 cut ((t \sub \f ∘ (⊩)) ((⊩)* U) = ((⊩) ∘ t \sub \c) ((⊩)* U)) as COM;[2:
193 cases (commute ?? t); apply (e3 ^ -1 ((⊩)* U));]
195 change in ⊢ (? ? ? % ?) with (((⊩) ∘ (⊩)* ) (((⊩) ∘ t \sub \c ∘ (⊩)* ) U));
196 apply (.= (lemma_10_3_c ?? (⊩) (t \sub \c ((⊩)* U))));
198 change in ⊢ (? ? ? % ?) with (t \sub \f (((⊩) ∘ (⊩)* ) U));
199 change in e with (U=((⊩)∘(⊩ \sub BP1) \sup * ) U);
201 | unfold o_basic_topology_of_o_basic_pair; simplify; intros;
204 change in ⊢ (? ? ? (? ? ? ? %) ?) with ((t \sub \f⎻* ∘ (⊩)⎻* ) ((⊩)⎻ U));
205 cut ((t \sub \f⎻* ∘ (⊩)⎻* ) ((⊩)⎻ U) = ((⊩)⎻* ∘ t \sub \c⎻* ) ((⊩)⎻ U)) as COM;[2:
206 cases (commute ?? t); apply (e1 ^ -1 ((⊩)⎻ U));]
208 change in ⊢ (? ? ? % ?) with (((⊩)⎻* ∘ (⊩)⎻ ) (((⊩)⎻* ∘ t \sub \c⎻* ∘ (⊩)⎻ ) U));
209 apply (.= (lemma_10_3_d ?? (⊩) (t \sub \c⎻* ((⊩)⎻ U))));
211 change in ⊢ (? ? ? % ?) with (t \sub \f⎻* (((⊩)⎻* ∘ (⊩)⎻ ) U));
212 change in e with (U=((⊩)⎻* ∘(⊩ \sub BP1)⎻ ) U);