legacy_1, ground_1, and basic_1 recommitted without anticipation

[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 ef7d48075c148b5adf6db4c302b34026f16b0bca..e6e1faf02c1f8af3e9af95cdf704e46c7e2c06b8 100644 (file)
--- a/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
+++ b/matita/matita/contribs/lambdadelta/ground_1/ext/tactics.ma
@@ -23,8 +23,7 @@ theorem insert_eq:
 \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)).(let TMP_1 \def (refl_equal S x) in (H x H0 
-TMP_1))))))).
+(G y)))))).(\lambda (H0: (P x)).(H x H0 (refl_equal S x))))))).
 
 theorem unintro:
  \forall (A: Type[0]).(\forall (a: A).(\forall (P: ((A \to Prop))).(((\forall 
@@ -38,6 +37,5 @@ theorem xinduction:
 (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))))).(let TMP_1 \def (refl_equal A 
-t) in (H t TMP_1))))).
+(H: ((\forall (x: A).((eq A t x) \to (P x))))).(H t (refl_equal A t))))).