1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 set "baseuri" "cic:/matita/tests/elim".
18 inductive stupidtype: Set \def
20 | Next : stupidtype \to stupidtype
21 | Pair : stupidtype \to stupidtype \to stupidtype.
23 alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
24 alias symbol "exists" (instance 0) = "Coq's exists".
25 alias symbol "or" (instance 0) = "Coq's logical or".
26 alias num (instance 0) = "natural number".
27 alias id "True" = "cic:/Coq/Init/Logic/True.ind#xpointer(1/1)".
28 alias id "refl_equal" = "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)".
34 (\exists b:stupidtype.a = Next b)
36 (\exists c,d:stupidtype.a = Pair c d).
41 clear H.clear H1.clear a.right.
42 exists.exact s.exists.exact s1.reflexivity.
43 clear H.clear a.left.right.
44 exists.exact s.reflexivity.
47 theorem t: 0=0 \to stupidtype.
48 intros; constructor 1.
51 (* In this test "elim t" should open a new goal 0=0 and put it in the *)
52 (* goallist so that the THEN tactical closes it using reflexivity. *)
53 theorem foo: let ax \def refl_equal ? 0 in t ax = t ax.