include "o-algebra.ma".
include "o-saturations.ma".
-record basic_topology: Type ≝
+record basic_topology: Type2 ≝
{ carrbt:> OA;
A: carrbt ⇒ carrbt;
J: carrbt ⇒ carrbt;
qed.
coercion hint.
-record continuous_relation (S,T: basic_topology) : Type ≝
+record continuous_relation (S,T: basic_topology) : Type2 ≝
{ cont_rel:> arrows2 OA S T;
(* reduces uses eq1, saturated uses eq!!! *)
reduced: ∀U. U = J ? U → cont_rel U = J ? (cont_rel U);
qed.
*)
-axiom daemon: False.
definition continuous_relation_comp:
∀o1,o2,o3.
continuous_relation_setoid o1 o2 →
|apply ((saturation_idempotent ?? (A_is_saturation o1) x)^-1);]]
| intros; simplify;
change with (((a34⎻* ∘ a23⎻* ) ∘ a12⎻* ) ∘ A o1 = ((a34⎻* ∘ (a23⎻* ∘ a12⎻* )) ∘ A o1));
- apply rule (#‡ASSOC1\sup -1);
+ apply rule (#‡ASSOC ^ -1);
| intros; simplify;
change with ((a⎻* ∘ (id2 ? o1)⎻* ) ∘ A o1 = a⎻* ∘ A o1);
apply (#‡(id_neutral_right2 : ?));
apply (#‡(id_neutral_left2 : ?));]
qed.
+definition btop_carr: BTop → Type1 ≝ λo:BTop. carr1 (oa_P (carrbt o)).
+coercion btop_carr.
+
(*
(*CSC: unused! *)
(* this proof is more logic-oriented than set/lattice oriented *)
[2,4: intros; apply saturation_monotone; try (apply A_is_saturation); apply Hcut;]
apply Hcut2; assumption.
qed.
-*)
\ No newline at end of file
+*)