X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_1%2Fext%2Ftactics.ma;fp=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground_1%2Fext%2Ftactics.ma;h=0000000000000000000000000000000000000000;hb=d2545ffd201b1aa49887313791386add78fa8603;hp=c2dff1889f818761797bfb517f05adf4f0d8960a;hpb=57ae1762497a5f3ea75740e2908e04adb8642cc2;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma b/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
deleted file mode 100644
index c2dff1889..000000000
--- a/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
+++ /dev/null
@@ -1,41 +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                  *)
-(*                                                                        *)
-(**************************************************************************)
-
-(* This file was automatically generated: do not edit *********************)
-
-include "ground_1/preamble.ma".
-
-lemma insert_eq:
- \forall (S: Type[0]).(\forall (x: S).(\forall (P: ((S \to Prop))).(\forall 
-(G: ((S \to Prop))).(((\forall (y: S).((P y) \to ((eq S y x) \to (G y))))) 
-\to ((P x) \to (G x))))))
-\def
- \lambda (S: Type[0]).(\lambda (x: S).(\lambda (P: ((S \to Prop))).(\lambda 
-(G: ((S \to Prop))).(\lambda (H: ((\forall (y: S).((P y) \to ((eq S y x) \to 
-(G y)))))).(\lambda (H0: (P x)).(H x H0 (refl_equal S x))))))).
-
-lemma unintro:
- \forall (A: Type[0]).(\forall (a: A).(\forall (P: ((A \to Prop))).(((\forall 
-(x: A).(P x))) \to (P a))))
-\def
- \lambda (A: Type[0]).(\lambda (a: A).(\lambda (P: ((A \to Prop))).(\lambda 
-(H: ((\forall (x: A).(P x)))).(H a)))).
-
-lemma xinduction:
- \forall (A: Type[0]).(\forall (t: A).(\forall (P: ((A \to Prop))).(((\forall 
-(x: A).((eq A t x) \to (P x)))) \to (P t))))
-\def
- \lambda (A: Type[0]).(\lambda (t: A).(\lambda (P: ((A \to Prop))).(\lambda 
-(H: ((\forall (x: A).((eq A t x) \to (P x))))).(H t (refl_equal A t))))).
-