(**************************************************************************)
set "baseuri" "cic:/matita/tests/discriminate".
-include "legacy/coq.ma".
+include "../legacy/coq.ma".
alias id "not" = "cic:/Coq/Init/Logic/not.con".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
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.
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
\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
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
theorem stupid4: kkk1 False = kkk2 False \to False.
intros;
- discriminate H.
-qed.
\ No newline at end of file
+ destruct H.
+qed.
+
+theorem recursive: S (S (S O)) = S (S O) \to False.
+ intros;
+ destruct H.
+qed.