One half done.

[helm.git] / helm / software / matita / contribs / formal_topology / overlap / relations.ma

diff --git a/helm/software/matita/contribs/formal_topology/overlap/relations.ma b/helm/software/matita/contribs/formal_topology/overlap/relations.ma
index 74a7c7d7839bb26fee44529654fc3cc5ff653bb2..662c7d048d5cf254efed08b4e85bcf10d58c6406 100644 (file)
--- a/helm/software/matita/contribs/formal_topology/overlap/relations.ma
+++ b/helm/software/matita/contribs/formal_topology/overlap/relations.ma
@@ -19,7 +19,7 @@ record binary_relation (A,B: SET) : Type1 ≝
 
 notation < "hvbox (x \nbsp \natur term 90 r \nbsp y)"  with precedence 45 for @{'satisfy $r $x $y}.
 notation > "hvbox (x \natur term 90 r y)"  with precedence 45 for @{'satisfy $r $x $y}.
-interpretation "relation applied" 'satisfy r x y = (fun21 ___ (satisfy __ r) x y).
+interpretation "relation applied" 'satisfy r x y = (fun21 ??? (satisfy ?? r) x y).
 
 definition binary_relation_setoid: SET → SET → setoid1.
  intros (A B);
@@ -98,10 +98,8 @@ definition REL: category1.
           first [apply refl | assumption]]]
 qed.
 
-(* 
 definition setoid_of_REL : objs1 REL → setoid ≝ λx.x.
 coercion setoid_of_REL.
-*)
 
 definition binary_relation_setoid_of_arrow1_REL : 
   ∀P,Q. arrows1 REL P Q → binary_relation_setoid P Q ≝ λP,Q,x.x.
@@ -123,7 +121,7 @@ definition comprehension: ∀b:REL. (unary_morphism1 b CPROP) → Ω \sup b.
 qed.
 
 interpretation "subset comprehension" 'comprehension s p =
- (comprehension s (mk_unary_morphism1 __ p _)).
+ (comprehension s (mk_unary_morphism1 ?? p ?)).
 
 definition ext: ∀X,S:REL. binary_morphism1 (arrows1 ? X S) S (Ω \sup X).
  apply (λX,S.mk_binary_morphism1 ??? (λr:arrows1 REL X S.λf:S.{x ∈ X | x ♮r f}) ?);