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