ported to new syntactic requirement about terms being surrounded by parens

[helm.git] / helm / matita / library / Z / z.ma

diff --git a/helm/matita/library/Z/z.ma b/helm/matita/library/Z/z.ma
index 8ce0047e169f6b6a8b014d4614877e6e9c2eb7c4..d1a846da4754c07161cbaf668a895c0b22846096 100644 (file)
--- a/helm/matita/library/Z/z.ma
+++ b/helm/matita/library/Z/z.ma
@@ -54,9 +54,9 @@ match OZ_test z with
 |false \Rightarrow z \neq OZ].
 intros.elim z.
 simplify.reflexivity.
-simplify.intros [H].
+simplify.intros (H).
 discriminate H.
-simplify.intros [H].
+simplify.intros (H).
 discriminate H.
 qed.
 
@@ -64,7 +64,7 @@ qed.
 theorem injective_pos: injective nat Z pos.
 simplify.
 intros.
-change with abs (pos x) = abs (pos y).
+change with (abs (pos x) = abs (pos y)).
 apply eq_f.assumption.
 qed.
 
@@ -74,7 +74,7 @@ variant inj_pos : \forall n,m:nat. pos n = pos m \to n = m
 theorem injective_neg: injective nat Z neg.
 simplify.
 intros.
-change with abs (neg x) = abs (neg y).
+change with (abs (neg x) = abs (neg y)).
 apply eq_f.assumption.
 qed.
 
@@ -82,17 +82,17 @@ variant inj_neg : \forall n,m:nat. neg n = neg m \to n = m
 \def injective_neg.
 
 theorem not_eq_OZ_pos: \forall n:nat. OZ \neq pos n.
-simplify.intros [n; H].
+simplify.intros (n H).
 discriminate H.
 qed.
 
 theorem not_eq_OZ_neg :\forall n:nat. OZ \neq neg n.
-simplify.intros [n; H].
+simplify.intros (n H).
 discriminate H.
 qed.
 
 theorem not_eq_pos_neg :\forall n,m:nat. pos n \neq neg m.
-simplify.intros [n; m; H].
+simplify.intros (n m H).
 discriminate H.
 qed.
 
@@ -111,20 +111,20 @@ elim x.
   elim y.
   (* goal: x=pos y=OZ *)
     right.intro.
-    apply not_eq_OZ_pos n. symmetry. assumption.
+    apply (not_eq_OZ_pos n). symmetry. assumption.
   (* goal: x=pos y=pos *)
     elim (decidable_eq_nat n n1:((n=n1) \lor ((n=n1) \to False))).
     left.apply eq_f.assumption.
-    right.intros [H_inj].apply H. injection H_inj. assumption.
+    right.intros (H_inj).apply H. injection H_inj. assumption.
   (* goal: x=pos y=neg *)
-    right.intro.apply not_eq_pos_neg n n1. assumption.
+    right.intro.apply (not_eq_pos_neg n n1). assumption.
 (* goal: x=neg *)
   elim y.
   (* goal: x=neg y=OZ *)
     right.intro.
-    apply not_eq_OZ_neg n. symmetry. assumption.
+    apply (not_eq_OZ_neg n). symmetry. assumption.
   (* goal: x=neg y=pos *)
-    right. intro. apply not_eq_pos_neg n1 n. symmetry. assumption.
+    right. intro. apply (not_eq_pos_neg n1 n). symmetry. assumption.
   (* goal: x=neg y=neg *)
     elim (decidable_eq_nat n n1:((n=n1) \lor ((n=n1) \to False))).
     left.apply eq_f.assumption.