X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Felim.ma;h=7c4031971307cd524eeca3379431c823ad7d2e1f;hb=5a702cea95883f7095c16b450e065ccb1714fc5a;hp=cf4e1eb22301551cbdb510c5d91eef59a6b091c4;hpb=6dcce596f1e6e2c352f67f5602556a0c41efd7bb;p=helm.git

diff --git a/helm/matita/tests/elim.ma b/helm/matita/tests/elim.ma
index cf4e1eb22..7c4031971 100644
--- a/helm/matita/tests/elim.ma
+++ b/helm/matita/tests/elim.ma
@@ -1,5 +1,5 @@
 (**************************************************************************)
-(*       ___	                                                            *)
+(*       ___                                                              *)
 (*      ||M||                                                             *)
 (*      ||A||       A project by Andrea Asperti                           *)
 (*      ||T||                                                             *)
@@ -13,15 +13,16 @@
 (**************************************************************************)
 
 set "baseuri" "cic:/matita/tests/elim".
+include "coq.ma".
 
 inductive stupidtype: Set \def
   | Base : stupidtype
   | Next : stupidtype \to stupidtype
   | Pair : stupidtype \to stupidtype \to stupidtype.
   
-alias symbol "eq" (instance 0) = "leibnitz's equality".
-alias symbol "exists" (instance 0) = "exists".
-alias symbol "or" (instance 0) = "logical or".
+alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
+alias symbol "exists" (instance 0) = "Coq's exists".
+alias symbol "or" (instance 0) = "Coq's logical or".
 alias num (instance 0) = "natural number".
 alias id "True" = "cic:/Coq/Init/Logic/True.ind#xpointer(1/1)".
 alias id "refl_equal" = "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)".
@@ -52,3 +53,27 @@ qed.
 theorem foo: let ax \def refl_equal ? 0 in t ax = t ax.
  elim t; reflexivity.
 qed.
+
+(* This test shows a bug where elim opens a new unus{ed,eful} goal *)
+
+alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
+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.
+          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).
+ apply Hcut; reflexivity.
+ apply
+  (sum_ind ?
+    (\lambda a,b,K. y=a \to O=b \to
+        match K with [ (k a b p) \Rightarrow a ] = x)
+     ? ? ? H).
+ simplify. intros.
+ generalize in match H1.
+ rewrite < H2; rewrite < H3.intro.
+ rewrite > H4.auto.
+qed.