From: Claudio Sacerdoti Coen <claudio.sacerdoticoen@unibo.it>
Date: Thu, 30 Jun 2005 10:24:36 +0000 (+0000)
Subject: A simpler implementation of inversion that does not generate the dummy
X-Git-Tag: PRE_GETTER_STORAGE~101
X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=commitdiff_plain;h=17a25a7a5b9cb2ba69fe9fdf1989bba5b212cadc;p=helm.git

A simpler implementation of inversion that does not generate the dummy
hypothesis Hcut: 0=0.
---

diff --git a/helm/matita/tests/inversion.ma b/helm/matita/tests/inversion.ma
index 5f1733444..9c56069b2 100644
--- a/helm/matita/tests/inversion.ma
+++ b/helm/matita/tests/inversion.ma
@@ -22,3 +22,14 @@ theorem test_inversion: \forall n. le n O \to n=O.
   simplify. intros.
   discriminate H3.
 qed.
+
+(* Piu' semplice e non lascia l'ipotesi inutile Hcut *)
+alias id "refl_equal" = "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)".
+theorem test_inversion2: \forall n. le n O \to n=O.
+ intros.
+ generalize (refl_equal nat O).
+ apply (le_ind ? (\lambda x. O=x \to n=x) ? ? ? H).
+ intro. reflexivity.
+ simplify. intros.
+ discriminate H3.
+qed.