injection_tac and discriminate_tac now replaced by destruct_tac that

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

diff --git a/matita/tests/discriminate.ma b/matita/tests/discriminate.ma
index f25061245e8ad7da6fc240302b9770997d0b1246..8b655de87bf8135c3494b88bea6ddcd2d5dbb682 100644 (file)
--- a/matita/tests/discriminate.ma
+++ b/matita/tests/discriminate.ma
@@ -21,6 +21,8 @@ alias id "False" = "cic:/Coq/Init/Logic/False.ind#xpointer(1/1)".
 alias id "True" = "cic:/Coq/Init/Logic/True.ind#xpointer(1/1)".
 alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
 alias id "bool" = "cic:/Coq/Init/Datatypes/bool.ind#xpointer(1/1)".
+alias id "S" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/2)".
+alias id "O" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/1)".
 
 inductive foo: Prop \def I_foo: foo.
 
@@ -29,7 +31,7 @@ theorem stupid:
   1 = 0 \to (\forall p:Prop. p \to not p).
   intros.
   generalize in match I_foo.
-  discriminate H.
+  destruct H.
 qed.
 
 inductive bar_list (A:Set): Set \def
@@ -41,7 +43,7 @@ theorem stupid2:
   \forall A:Set.\forall x:A.\forall l:bar_list A.
   bar_nil A = bar_cons A x l \to False.
   intros.
-  discriminate H.
+  destruct H.
 qed.
 
 inductive dt (A:Type): Type \to Type \def
@@ -51,7 +53,7 @@ inductive dt (A:Type): Type \to Type \def
 theorem stupid3:
  k1 False (False → True) = k2 False False True → False.
  intros;
- discriminate H.
+ destruct H.
 qed.
 
 inductive dddt (A:Type): Type \to Type \def
@@ -60,5 +62,10 @@ inductive dddt (A:Type): Type \to Type \def
  
 theorem stupid4: kkk1 False = kkk2 False \to False.
  intros;
- discriminate H.
+ destruct H.
+qed.
+
+theorem recursive: S (S (S O)) = S (S O) \to False.
+ intros;
+ destruct H.
 qed.
\ No newline at end of file