X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=helm%2Fmatita%2Ftests%2Finversion2.ma;fp=helm%2Fmatita%2Ftests%2Finversion2.ma;h=0000000000000000000000000000000000000000;hb=55b82bd235d82ff7f0a40d980effe1efde1f5073;hp=65dc75d4082f1ddecd21bd866d5de31e705f2d69;hpb=771ee8b9d122fa963881c876e86f90531bb7434f;p=helm.git

diff --git a/helm/matita/tests/inversion2.ma b/helm/matita/tests/inversion2.ma
deleted file mode 100644
index 65dc75d40..000000000
--- a/helm/matita/tests/inversion2.ma
+++ /dev/null
@@ -1,63 +0,0 @@
-(**************************************************************************)
-(*       ___                                                              *)
-(*      ||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                  *)
-(*                                                                        *)
-(**************************************************************************)
-
-set "baseuri" "cic:/matita/tests/inversion/".
-include "legacy/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_inv:
- \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. discriminate H3.
-qed.