X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Finversion.ma;h=c76851f59fa8dd1240d87fdb04d8072a5544ba5f;hb=22964c949671af4b5e739b06b915a81a4fc2c5b5;hp=e61e123d791d687bbc0323ea5f16fc0aa6f6c25a;hpb=c0f06261e5626228e4681de9973b6412524f09a2;p=helm.git

diff --git a/helm/matita/tests/inversion.ma b/helm/matita/tests/inversion.ma
index e61e123d7..c76851f59 100644
--- a/helm/matita/tests/inversion.ma
+++ b/helm/matita/tests/inversion.ma
@@ -1,3 +1,5 @@
+set "baseuri" "cic:/matita/tests/inversion/".
+
 inductive nat : Set \def
    O : nat
  | S : nat \to nat.
@@ -10,13 +12,37 @@ alias symbol "eq" (instance 0) = "leibnitz's equality".
 
 theorem test_inversion: \forall n. le n O \to n=O.
  intros.
+ (* inversion begins *)
  cut O=O.
   (* goal 2: 0 = 0 *)
   goal 7. reflexivity.
   (* goal 1 *)
-  generalize Hcut.      (* non attaccata. Dovrebbe dare 0=0 -> n=0 *)
+  generalize in match Hcut.
   apply (le_ind ? (\lambda x. O=x \to n=x) ? ? ? H).
-  intro. reflexivity.
+  (* first goal (left open) *)
+  intro. rewrite < H1.
+  clear Hcut.
+  (* second goal (closed) *)
+  goal 14.
   simplify. intros.
   discriminate H3.
-qed.
\ No newline at end of file
+  (* inversion ends *)
+  reflexivity.
+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.
+ (* inversion begins *)
+ generalize in match (refl_equal nat O).
+ apply (le_ind ? (\lambda x. O=x \to n=x) ? ? ? H).
+ (* first goal (left open) *)
+ intro. rewrite < H1.
+ (* second goal (closed) *)
+ goal 13.
+ simplify. intros.
+ discriminate H3.
+ (* inversion ends *)
+ reflexivity.
+qed.