ocaml 3.09 transition

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

diff --git a/helm/matita/tests/discriminate.ma b/helm/matita/tests/discriminate.ma
index ca55591ee88c7366dc61bc9c632dea5e26cfb078..f873dd8f722e09d87d4ac5a3131bcbd0a356f196 100644 (file)
--- a/helm/matita/tests/discriminate.ma
+++ b/helm/matita/tests/discriminate.ma
@@ -1,5 +1,5 @@
 (**************************************************************************)
-(*       ___                                                               *)
+(*       ___                                                              *)
 (*      ||M||                                                             *)
 (*      ||A||       A project by Andrea Asperti                           *)
 (*      ||T||                                                             *)
@@ -13,14 +13,28 @@
 (**************************************************************************)
 
 set "baseuri" "cic:/matita/tests/discriminate".
+include "coq.ma".
 alias id "not" = "cic:/Coq/Init/Logic/not.con".
 alias num (instance 0) = "natural number".
-alias symbol "eq" (instance 0) = "leibnitz's equality".
+alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
 
+inductive foo: Prop \def I_foo: foo.
 
 theorem stupid:
   1 = 0 \to (\forall p:Prop. p \to not p).
   intros.
+  generalize in match I_foo.
   discriminate H.
-  qed.
-  
+qed.
+
+inductive bar_list (A:Set): Set \def
+  | bar_nil: bar_list A
+  | bar_cons: A \to bar_list A \to bar_list A.
+
+alias id "False" = "cic:/Coq/Init/Logic/False.ind#xpointer(1/1)".
+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.
+qed.