coercion command now requires an uri

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

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index 663656e05faf57e38008a240a72f10f893267123..5429b1f82fb0aa427e8d0e55180664b0e2d5c77a 100644 (file)
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -36,13 +36,29 @@ let rec pos2nat x \def
 
 definition nat2int \def \lambda x. positive x.
 
-coercion pos2nat.
+coercion cic:/matita/tests/coercions/pos2nat.con.
 
-coercion nat2int.
+coercion cic:/matita/tests/coercions/nat2int.con.
 
 definition fst \def \lambda x,y:int.x.
-alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
 
 theorem a: fst O one = fst (positive O) (next one).
 reflexivity.
 qed.
+
+definition double: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (nat2int x).
+  
+definition double1: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (pos2nat x).
+
+definition double2: 
+  \forall f:int \to int. pos \to int 
+\def 
+  \lambda f:int \to int. \lambda x : pos .f (nat2int (pos2nat x)).
+  
+