trans_eq and sym_eq indexing restored. Apparently they are useful for several(?)

theorems in CerCo (file positive.ma).

diff --git a/matita/matita/lib/basics/logic.ma b/matita/matita/lib/basics/logic.ma
index bf3bae3a8dc7cb45142b8c2c4657e7953808878c..2fbe45f370cb71a589d8bff1fbe1029be2ef84bc 100644 (file)
--- a/matita/matita/lib/basics/logic.ma
+++ b/matita/matita/lib/basics/logic.ma
@@ -47,7 +47,7 @@ theorem rewrite_l: ∀A:Type[2].∀x.∀P:A → Type[2]. P x → ∀y. x = y →
 #A #x #P #Hx #y #Heq (cases Heq); //; qed.
 
 theorem sym_eq: ∀A.∀x,y:A. x = y → y = x.
-#A #x #y #Heq @(rewrite_l A x (λz.z=x)) // qed-.
+#A #x #y #Heq @(rewrite_l A x (λz.z=x)) // qed.
 
 theorem rewrite_r: ∀A:Type[2].∀x.∀P:A → Type[2]. P x → ∀y. y = x → P y.
 #A #x #P #Hx #y #Heq (cases (sym_eq ? ? ? Heq)); //; qed.
@@ -56,7 +56,7 @@ theorem eq_coerc: ∀A,B:Type[0].A→(A=B)→B.
 #A #B #Ha #Heq (elim Heq); //; qed.
 
 theorem trans_eq : ∀A.∀x,y,z:A. x = y → y = z → x = z.
-#A #x #y #z #H1 #H2 >H1; //; qed-.
+#A #x #y #z #H1 #H2 >H1; //; qed.
 
 theorem eq_f: ∀A,B.∀f:A→B.∀x,y:A. x=y → f x = f y.
 #A #B #f #x #y #H >H; //; qed.