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

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index 9e47c3e1e..ae69759bf 100644
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -1,3 +1,20 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||M||                                                             *)
+(*      ||A||       A project by Andrea Asperti                           *)
+(*      ||T||                                                             *)
+(*      ||I||       Developers:                                           *)
+(*      ||T||         The HELM team.                                      *)
+(*      ||A||         http://helm.cs.unibo.it                             *)
+(*      \   /                                                             *)
+(*       \ /        This file is distributed under the terms of the       *)
+(*        v         GNU General Public License Version 2                  *)
+(*                                                                        *)
+(**************************************************************************)
+
+set "baseuri" "cic:/matita/tests/coercions/".
+include "coq.ma".
+
 inductive pos: Set \def
 | one : pos
 | next : pos \to pos.
@@ -17,28 +34,14 @@ 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.
 
+theorem a: fst O one = fst (positive O) (next one).
+reflexivity.
+qed.