ocaml 3.09 transition

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

diff --git a/helm/matita/tests/elim.ma b/helm/matita/tests/elim.ma
index 7c4031971307cd524eeca3379431c823ad7d2e1f..9d48bc970ecd46c576942a3911f45b7d974527fe 100644 (file)
--- a/helm/matita/tests/elim.ma
+++ b/helm/matita/tests/elim.ma
@@ -38,10 +38,10 @@ intros.
 elim a.
 clear a.left.left.
   reflexivity.
-clear H.clear H1.clear a.right.
-  exists.exact s.exists.exact s1.reflexivity.
 clear H.clear a.left.right.
   exists.exact s.reflexivity.
+clear H.clear H1.clear a.right.
+  exists.exact s.exists.exact s1.reflexivity.  
 qed.
 
 theorem t: 0=0 \to stupidtype.
@@ -62,7 +62,7 @@ alias id "O" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/1)".
 inductive sum (n:nat) : nat \to nat \to Set \def
   k: \forall x,y. n = x + y \to sum n x y.
   
-theorem t: \forall x,y. \forall H: sum x y O.
+theorem t': \forall x,y. \forall H: sum x y O.
           match H with [ (k a b p) \Rightarrow a ] = x.
  intros.
  cut (y = y \to O = O \to match H with [ (k a b p) \Rightarrow a] = x).
@@ -72,6 +72,7 @@ theorem t: \forall x,y. \forall H: sum x y O.
     (\lambda a,b,K. y=a \to O=b \to
         match K with [ (k a b p) \Rightarrow a ] = x)
      ? ? ? H).
+ goal 16.
  simplify. intros.
  generalize in match H1.
  rewrite < H2; rewrite < H3.intro.