- 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 9532ea95deb4d3ffb2a7c66b1665f58aa7a6c462..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,18 +20,25 @@ 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
 [ O \Rightarrow  OZ 
 | (S n)\Rightarrow  neg n].
 
+lemma pos_n_eq_S_n : \forall n : nat.
+  (pos n) = (S n).
+intro.reflexivity. 
+qed.
+
 definition abs \def
 \lambda z.
  match z with 
@@ -55,9 +60,9 @@ match OZ_test z with
 intros.elim z.
 simplify.reflexivity.
 simplify. unfold Not. intros (H).
-discriminate H.
+destruct H.
 simplify. unfold Not. intros (H).
-discriminate H.
+destruct H.
 qed.
 
 (* discrimination *)
@@ -85,17 +90,17 @@ variant inj_neg : \forall n,m:nat. neg n = neg m \to n = m
 
 theorem not_eq_OZ_pos: \forall n:nat. OZ \neq pos n.
 unfold Not.intros (n H).
-discriminate H.
+destruct H.
 qed.
 
 theorem not_eq_OZ_neg :\forall n:nat. OZ \neq neg n.
 unfold Not.intros (n H).
-discriminate H.
+destruct H.
 qed.
 
 theorem not_eq_pos_neg :\forall n,m:nat. pos n \neq neg m.
 unfold Not.intros (n m H).
-discriminate H.
+destruct H.
 qed.
 
 theorem decidable_eq_Z : \forall x,y:Z. decidable (x=y).
@@ -117,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. injection 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 *)