ocaml 3.09 transition

[helm.git] / helm / matita / tests / fguidi.ma

diff --git a/helm/matita/tests/fguidi.ma b/helm/matita/tests/fguidi.ma
index 19f527e8f722099e501b571db8f5fba9911a3181..567f15c97c88ca976c0ecf8b71b389df700da752 100644 (file)
--- a/helm/matita/tests/fguidi.ma
+++ b/helm/matita/tests/fguidi.ma
@@ -50,7 +50,7 @@ intros. auto.
 qed.
 
 theorem eq_gen_S_S: \forall m,n. (S m) = (S n) \to m = n. 
-intros. cut (pred (S m)) = (pred (S n)). 
+intros. cut ((pred (S m)) = (pred (S n))). 
 assumption. elim H. auto paramodulation.
 qed.
 
@@ -83,7 +83,7 @@ theorem le_gen_S_x_aux: \forall m,x,y. (le y x) \to (y = S m) \to
                         (\exists n. x = (S n) \land (le m n)).
 intros 4. elim H. 
 apply eq_gen_S_O. exact m. elim H1. auto paramodulation.
-cut n = m. elim Hcut. apply ex_intro. exact n1. auto paramodulation. auto. (* paramodulation non trova la prova *)
+cut (n = m). elim Hcut. apply ex_intro. exact n1. auto paramodulation. auto. (* paramodulation non trova la prova *)
 qed.
 
 theorem le_gen_S_x: \forall m,x. (le (S m) x) \to 
@@ -93,7 +93,7 @@ qed.
 
 theorem le_gen_S_x_cc: \forall m,x. (\exists n. x = (S n) \land (le m n)) \to
                        (le (S m) x).
-intros. elim H. elim H1. cut (S x1) = x. elim Hcut. auto paramodulation. elim H2. auto paramodulation.
+intros. elim H. elim H1. cut ((S x1) = x). elim Hcut. auto paramodulation. elim H2. auto paramodulation.
 qed.
 
 theorem le_gen_S_S: \forall m,n. (le (S m) (S n)) \to (le m n).