X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Fcoercions.ma;h=2444b1d74a3a638dddb85a3b42cf84d11acf6a82;hb=12cc5b2b8e7f7bb0b5e315094b008a293a4df6b1;hp=1e92364fe61387e0918c1657f39be361050368e8;hpb=5ceecb1346e44ea4dbf6ca635efecdf155bd9258;p=helm.git diff --git a/helm/matita/tests/coercions.ma b/helm/matita/tests/coercions.ma index 1e92364fe..2444b1d74 100644 --- a/helm/matita/tests/coercions.ma +++ b/helm/matita/tests/coercions.ma @@ -1,50 +1,33 @@ +set "baseuri" "cic:/matita/tests/coercions/". -Inductive nat : Set \def +inductive pos: Set \def +| one : pos +| next : pos \to pos. + +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 bool: Set \def -| true : bool -| false : bool. - - - - -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))]. +inductive int: Set \def +| positive: nat \to int +| negative : nat \to int. -let rec plus (n,m:nat) : nat \def - match n:nat with [ - O \Rightarrow m - | (S x) \Rightarrow (S (plus x m)) ]. +inductive empty : Set \def . -let rec is_zero (n:nat) : bool \def - match n:nat with [ - O \Rightarrow true - | (S x) \Rightarrow false]. +let rec pos2nat x \def + match x with + [ one \Rightarrow (S O) + | (next z) \Rightarrow S (pos2nat z)]. -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)] - ]. +definition nat2int \def \lambda x. positive x. +coercion pos2nat. -Coercion is_zero. -Coercion len. +coercion nat2int. -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.