X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Ftests%2Finversion2.ma;fp=matita%2Ftests%2Finversion2.ma;h=8261b33f07355eefe305b50c3e406de595116972;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1

diff --git a/matita/tests/inversion2.ma b/matita/tests/inversion2.ma
new file mode 100644
index 000000000..8261b33f0
--- /dev/null
+++ b/matita/tests/inversion2.ma
@@ -0,0 +1,63 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||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                  *)
+(*                                                                        *)
+(**************************************************************************)
+
+
+include "coq.ma".
+
+inductive nat : Set \def
+   O : nat
+ | S : nat \to nat.
+
+
+inductive le (n:nat) : nat \to Prop \def
+   leO : le n n
+ | leS : \forall m. le n m \to le n (S m).
+ 
+theorem le_inv2:
+ \forall n,m.
+  \forall P: nat -> nat -> Prop.
+   ? -> ? -> le n m -> P n m.
+[7:
+  intros;
+  inversion H;
+  [ apply x
+  | simplify;
+    apply x1
+  ]
+| skip
+| skip
+| skip
+| skip
+| skip
+| skip
+]
+qed.
+
+inductive ledx : nat \to nat \to Prop \def
+   ledxO : \forall n. ledx n n
+ | ledxS : \forall m.\forall n. ledx n m \to ledx n (S m).
+
+
+alias symbol "eq" (instance 0) = "Coq's leibnitz's equality".
+
+theorem test_inversion: \forall n. le n O \to n=O.
+ intros.
+ inversion H.
+ (* cut n=n \to O=O \to n=O.
+  apply Hcut; reflexivity. *)
+  (* elim H. BUG DI UNSHARING *)
+  (*apply (ledx_ind (\lambda x.\lambda y.  n=x \to O=y \to x=y) ? ? ? ? H).*)
+    simplify. intros. reflexivity.    
+    simplify. intros. destruct H3.
+qed.