From e4ce76f25622fade1f74432537acff9daef251d8 Mon Sep 17 00:00:00 2001
From: Ferruccio Guidi <ferruccio.guidi@unibo.it>
Date: Mon, 22 Jan 2007 18:12:54 +0000
Subject: [PATCH] some patches

---
 .../matita/contribs/LAMBDA-TYPES/Level-1/Base/preamble.ma | 8 +++-----
 helm/software/matita/matita.lang                          | 1 -
 2 files changed, 3 insertions(+), 6 deletions(-)

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Level-1/Base/preamble.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Level-1/Base/preamble.ma
index 5f5915958..be7a43586 100644
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Level-1/Base/preamble.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Level-1/Base/preamble.ma
@@ -138,13 +138,11 @@ theorem sym_not_eq: \forall A:Type. \forall x,y:A. x \neq y \to y \neq x.
  unfold not. intros. apply H. symmetry. assumption.
 qed.
 
-theorem trans_eq : ∀A:Type.∀x,y,z:A.x=y→y=z→x=z.
- intros;
- transitivity y;
- assumption.
+theorem trans_eq : \forall A:Type. \forall x,y,z:A. x=y \to y=z \to x=z.
+ intros. transitivity y; assumption.
 qed.
 
-theorem plus_reg_l: \forall (n,m,p:nat). n + m = n + p \to m = p.
+theorem plus_reg_l: \forall n,m,p. n + m = n + p \to m = p.
  intros. apply plus_reg_l; auto.
 qed.
 
diff --git a/helm/software/matita/matita.lang b/helm/software/matita/matita.lang
index 0ba60d173..fbb21d6d1 100644
--- a/helm/software/matita/matita.lang
+++ b/helm/software/matita/matita.lang
@@ -115,7 +115,6 @@
     <keyword>normalize</keyword>
     <keyword>reduce</keyword>
     <keyword>reflexivity</keyword>
-    <keyword>rename</keyword>
     <keyword>replace</keyword>
     <keyword>rewrite</keyword>
     <keyword>ring</keyword>
-- 
2.39.2