+(**************************************************************************)
+(* ___ *)
+(* ||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 "legacy/coq.ma".
inductive pos: Set \def
| one : pos
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)).
+
+