X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Fcoercions.ma;h=507147cef8b1802a925746acdec4b097a5bf07ca;hb=d9394782ed9580f3565eb9b4682d8348aae6349e;hp=9e47c3e1e5b6b99ab0677a9344799b14e44bb4f1;hpb=d8cf90b2aa66f0170db0c35b8b5d53a1eb74008e;p=helm.git

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index 9e47c3e1e..507147cef 100644
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -1,3 +1,5 @@
+set "baseuri" "cic:/matita/tests/".
+
 inductive pos: Set \def
 | one : pos
 | next : pos \to pos.
@@ -17,28 +19,15 @@ let rec pos2nat x \def
   [ one \Rightarrow (S O)
   | (next z) \Rightarrow S (pos2nat z)].
 
-let rec nat2int x \def
-  match x with
-  [ O \Rightarrow positive O
-  | (S z) \Rightarrow positive (S z)].
+definition nat2int \def \lambda x. positive x.
 
 coercion pos2nat.
 
 coercion nat2int.
 
-let rec plus x y \def
-  match x with
-  [ (positive n) \Rightarrow x
-  | (negative z) \Rightarrow y].
-
-theorem a: plus O one.
-
-
-
-
-
-
-
-
-
+definition fst \def \lambda x,y:int.x.
+alias symbol "eq" (instance 0) = "leibnitz's equality".
 
+theorem a: fst O one = fst (positive O) (next one).
+reflexivity.
+qed.