- Procedural convertible rewrites in the conclusion are now detected and replaced...

[helm.git] / helm / software / matita / library / Z / z.ma

diff --git a/helm/software/matita/library/Z/z.ma b/helm/software/matita/library/Z/z.ma
index 64b608cb9524602afa01054b31624d833f9d8d0c..31c3a7003bdffca309780ce3e38122712efe4368 100644 (file)
--- a/helm/software/matita/library/Z/z.ma
+++ b/helm/software/matita/library/Z/z.ma
@@ -12,8 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/Z/z".
-
 include "datatypes/bool.ma".
 include "nat/nat.ma".
 
@@ -22,12 +20,14 @@ inductive Z : Set \def
 | pos : nat \to Z
 | neg : nat \to Z.
 
+interpretation "Integers" 'Z = Z.
+
 definition Z_of_nat \def
 \lambda n. match n with
 [ O \Rightarrow  OZ 
 | (S n)\Rightarrow  pos n].
 
-coercion cic:/matita/Z/z/Z_of_nat.con.
+coercion Z_of_nat.
 
 definition neg_Z_of_nat \def
 \lambda n. match n with
@@ -122,7 +122,7 @@ elim x.
   (* goal: x=pos y=pos *)
     elim (decidable_eq_nat n n1:((n=n1) \lor ((n=n1) \to False))).
     left.apply eq_f.assumption.
-    right.unfold Not.intros (H_inj).apply H. destruct H_inj. assumption.
+    right.unfold Not.intros (H_inj).apply H. destruct H_inj. reflexivity.
   (* goal: x=pos y=neg *)
     right.unfold Not.intro.apply (not_eq_pos_neg n n1). assumption.
 (* goal: x=neg *)