- we generate the terms in anticipated form (the are easier to debug)

[helm.git] / matita / matita / contribs / lambdadelta / ground_1 / ext / tactics.ma

diff --git a/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma b/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
index 766db9f1f48279c86aa1d2ae8435e84ebd8fd9a6..a868d6db8c53a5f15dc620389313368086c02ca8 100644 (file)
--- a/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
+++ b/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
@@ -14,37 +14,30 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "Ground-1/preamble.ma".
+include "ground_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))))))
+ \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: 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))))))).
-(* COMMENTS
-Initial nodes: 45
-END *)
+ \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)).(let TMP_1 \def (refl_equal S x) in (H x H0 
+TMP_1))))))).
 
 theorem unintro:
- \forall (A: Set).(\forall (a: A).(\forall (P: ((A \to Prop))).(((\forall (x: 
-A).(P x))) \to (P a))))
+ \forall (A: Type[0]).(\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)))).
-(* COMMENTS
-Initial nodes: 17
-END *)
+ \lambda (A: Type[0]).(\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))))
+ \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: 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))))).
-(* COMMENTS
-Initial nodes: 31
-END *)
+ \lambda (A: Type[0]).(\lambda (t: A).(\lambda (P: ((A \to Prop))).(\lambda 
+(H: ((\forall (x: A).((eq A t x) \to (P x))))).(let TMP_2 \def (refl_equal A 
+t) in (H t TMP_2))))).