X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fcontribs%2FLAMBDA-TYPES%2FBase-1%2Fext%2Ftactics.ma;fp=matita%2Fcontribs%2FLAMBDA-TYPES%2FBase-1%2Fext%2Ftactics.ma;h=79551495d86e5e699ba5d1ef301cf0a87b74fbe1;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1

diff --git a/matita/contribs/LAMBDA-TYPES/Base-1/ext/tactics.ma b/matita/contribs/LAMBDA-TYPES/Base-1/ext/tactics.ma
new file mode 100644
index 000000000..79551495d
--- /dev/null
+++ b/matita/contribs/LAMBDA-TYPES/Base-1/ext/tactics.ma
@@ -0,0 +1,41 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||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 "Base-1/preamble.ma".
+
+theorem insert_eq:
+ \forall (S: Set).(\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: Set).(\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))))))).
+
+theorem unintro:
+ \forall (A: Set).(\forall (a: A).(\forall (P: ((A \to Prop))).(((\forall (x: 
+A).(P x))) \to (P a))))
+\def
+ \lambda (A: Set).(\lambda (a: A).(\lambda (P: ((A \to Prop))).(\lambda (H: 
+((\forall (x: A).(P x)))).(H a)))).
+
+theorem xinduction:
+ \forall (A: Set).(\forall (t: A).(\forall (P: ((A \to Prop))).(((\forall (x: 
+A).((eq A t x) \to (P x)))) \to (P t))))
+\def
+ \lambda (A: Set).(\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))))).
+