X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Fcoercions.ma;h=337ef50edc1fc2a63bb1600e0ca6f0f32dc005f8;hb=8aaf525856e25bcd8f355e505fd00f45c62bc18f;hp=1e92364fe61387e0918c1657f39be361050368e8;hpb=5ceecb1346e44ea4dbf6ca635efecdf155bd9258;p=helm.git

diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma
index 1e92364fe..337ef50ed 100644
--- a/helm/matita/tests/coercions.ma
+++ b/helm/matita/tests/coercions.ma
@@ -1,50 +1,31 @@
+inductive pos: Set \def
+| one : pos
+| next : pos \to pos.
 
-Inductive nat : Set \def
+inductive nat:Set \def
 | O : nat
 | S : nat \to nat.
 
-Inductive list (A:Set) : Set \def
-| nil : list A
-| cons : A \to list A \to list A.
+inductive int: Set \def
+| positive: nat \to int
+| negative : nat \to int.
 
-Inductive bool: Set \def
-| true : bool
-| false : bool.
+inductive empty : Set \def .
 
+let rec pos2nat x \def 
+  match x with  
+  [ one \Rightarrow (S O)
+  | (next z) \Rightarrow S (pos2nat z)].
 
+definition nat2int \def \lambda x. positive x.
 
+coercion pos2nat.
 
-let rec len (A:Set)(l:list A) on l : nat \def
- match l:list with [
-   nil \Rightarrow O
- | (cons e tl) \Rightarrow (S (len A tl))].
+coercion nat2int.
 
-let rec plus (n,m:nat) : nat \def
- match n:nat with [
-   O \Rightarrow m
- | (S x) \Rightarrow (S (plus x m)) ].  
-
-let rec is_zero (n:nat) : bool \def
-  match n:nat with [
-    O \Rightarrow true
-  | (S x) \Rightarrow false].  
-
-let rec nat_eq_dec (n,m:nat) : bool \def
-  match n:nat with [
-    O \Rightarrow 
-         match m:nat with [
-           O \Rightarrow true
-	 | (S x) \Rightarrow false]
-  | (S x) \Rightarrow
-             match m:nat with [
-               O \Rightarrow false
-	     | (S y) \Rightarrow (nat_eq_dec x y)]
-  ].
-
-
-Coercion is_zero.
-Coercion len.
-
-Print Coer.
-Print Env.
+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.