set "baseuri" "cic:/matita/LAMBDA-TYPES/terms_defs".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias id "S" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/2)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/absurd/".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
alias id "not" = "cic:/Coq/Init/Logic/not.con".
(* test _with_ the WHD on the apply argument *)
set "baseuri" "cic:/matita/tests/apply/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "not" = "cic:/Coq/Init/Logic/not.con".
alias id "False" = "cic:/Coq/Init/Logic/False.ind#xpointer(1/1)".
term (to reveal a product) *)
theorem d: \forall A: Prop. \lnot A \to A \to False.
intros. apply H. assumption.
-qed.
\ No newline at end of file
+qed.
(**************************************************************************)
set "baseuri" "cic:/matita/tests/assumption".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias num (instance 0) = "natural number".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/auto/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "O" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/1)".
alias id "S" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/2)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/change/".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
alias symbol "plus" (instance 0) = "Coq's natural plus".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/clear".
-include "coq.ma".
+include "legacy/coq.ma".
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)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/clearbody".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
alias symbol "plus" (instance 0) = "Coq's natural plus".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/coercions/".
-include "coq.ma".
+include "legacy/coq.ma".
inductive pos: Set \def
| one : pos
(**************************************************************************)
set "baseuri" "cic:/matita/tests/comments/".
-include "coq.ma".
+include "legacy/coq.ma".
(* commento che va nell'ast, ma non viene contato
come step perche' non e' un executable
(**************************************************************************)
set "baseuri" "cic:/matita/tests/constructor".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/test/continuationals/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias id "S" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/2)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/contradiction".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "True" = "cic:/Coq/Init/Logic/True.ind#xpointer(1/1)".
alias id "not" = "cic:/Coq/Init/Logic/not.con".
alias num (instance 0) = "natural number".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/cut".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/decompose".
-include "coq.ma".
+include "legacy/coq.ma".
alias symbol "and" (instance 0) = "Coq's logical and".
alias symbol "or" (instance 0) = "Coq's logical or".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/discriminate".
-include "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".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/elim".
-include "coq.ma".
+include "legacy/coq.ma".
inductive stupidtype: Set \def
| Base : stupidtype
(**************************************************************************)
set "baseuri" "cic:/matita/tests/fguidi/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "O" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1/1)".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/fold".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/generalize".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/inversion_sum/".
-include "coq.ma".
+include "legacy/coq.ma".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/inversion/".
-include "coq.ma".
+include "legacy/coq.ma".
inductive nat : Set \def
O : nat
set "baseuri" "cic:/matita/tests/metasenv_ordering".
-include "coq.ma".
+include "legacy/coq.ma".
alias num (instance 0) = "natural number".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/paramodulation".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
alias symbol "plus" (instance 0) = "Coq's natural plus".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/replace/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias num (instance 0) = "natural number".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/rewrite/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias num (instance 0) = "natural number".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/simpl/".
-include "coq.ma".
+include "legacy/coq.ma".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
alias id "plus" = "cic:/Coq/Init/Peano/plus.con".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/test2/".
-include "coq.ma".
+include "legacy/coq.ma".
alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
alias symbol "and" (instance 0) = "Coq's logical and".
(**************************************************************************)
set "baseuri" "cic:/matita/tests/test3/".
-include "coq.ma".
+include "legacy/coq.ma".
alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
theorem a:\forall x.x=x.
(**************************************************************************)
set "baseuri" "cic:/matita/tests/test4/".
-include "coq.ma".
+include "legacy/coq.ma".
(* commento che va nell'ast, ma non viene contato
set "baseuri" "cic:/matita/unfold".
-include "coq.ma".
+include "legacy/coq.ma".
alias symbol "plus" (instance 0) = "Coq's natural plus".
definition myplus \def \lambda x,y. x+y.