X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fformal_topology%2Foverlap%2Fo-saturations.ma;h=a1c83e70969009a9aabbd3338cdc6a612a30837f;hb=c2123cdb49560cc6ef2a86b71ab21b432581c076;hp=22c8fbdeaf7fe9e583a17a4d5230aa7a89b93545;hpb=4ead19b19835213b82e451ee6fd2ed026ed3f4a5;p=helm.git

diff --git a/helm/software/matita/contribs/formal_topology/overlap/o-saturations.ma b/helm/software/matita/contribs/formal_topology/overlap/o-saturations.ma
index 22c8fbdea..a1c83e709 100644
--- a/helm/software/matita/contribs/formal_topology/overlap/o-saturations.ma
+++ b/helm/software/matita/contribs/formal_topology/overlap/o-saturations.ma
@@ -15,29 +15,29 @@
 include "o-algebra.ma".
 
 alias symbol "eq" = "setoid1 eq".
-definition is_saturation ≝
- λC:OA.λA:unary_morphism (oa_P C) (oa_P C).
+definition is_o_saturation: ∀C:OA. unary_morphism1 C C → CProp1 ≝
+ λC:OA.λA:unary_morphism1 C C.
   ∀U,V. (U ≤ A V) = (A U ≤ A V).
 
-definition is_reduction ≝
- λC:OA.λJ:unary_morphism (oa_P C) (oa_P C).
+definition is_o_reduction: ∀C:OA. unary_morphism1 C C → CProp1 ≝
+ λC:OA.λJ:unary_morphism1 C C.
     ∀U,V. (J U ≤ V) = (J U ≤ J V).
 
-theorem saturation_expansive: ∀C,A. is_saturation C A → ∀U. U ≤ A U.
- intros; apply (fi ?? (H ??)); apply (oa_leq_refl C).
+theorem o_saturation_expansive: ∀C,A. is_o_saturation C A → ∀U. U ≤ A U.
+ intros; apply (fi ?? (i ??)); apply (oa_leq_refl C).
 qed.
 
-theorem saturation_monotone:
- ∀C,A. is_saturation C A →
+theorem o_saturation_monotone:
+ ∀C,A. is_o_saturation C A →
   ∀U,V. U ≤ V → A U ≤ A V.
- intros; apply (if ?? (H ??)); apply (oa_leq_trans C);
-  [apply V|3: apply saturation_expansive ]
+ intros; apply (if ?? (i ??)); apply (oa_leq_trans C);
+  [apply V|3: apply o_saturation_expansive ]
  assumption.
 qed.
 
-theorem saturation_idempotent: ∀C,A. is_saturation C A → ∀U. 
- eq (oa_P C) (A (A U)) (A U).
+theorem o_saturation_idempotent: ∀C,A. is_o_saturation C A → ∀U. 
+ eq1 C (A (A U)) (A U).
  intros; apply (oa_leq_antisym C);
-  [ apply (if ?? (H (A U) U)); apply (oa_leq_refl C).
-  | apply saturation_expansive; assumption]
+  [ apply (if ?? (i (A U) U)); apply (oa_leq_refl C).
+  | apply o_saturation_expansive; assumption]
 qed.