uri renaming and new nodes count

[helm.git] / helm / software / matita / contribs / LAMBDA-TYPES / Basic-1 / clear / fwd.ma

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/clear/fwd.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/clear/fwd.ma
index ede997e9537d028848be2d0996a0fd3c4c80ff9b..d64ff77becc37bfac84d3889f01ebf257c4457cf 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/clear/fwd.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/clear/fwd.ma
@@ -14,7 +14,7 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/clear/defs.ma".
+include "Basic-1/clear/defs.ma".
 
 theorem clear_gen_sort:
  \forall (x: C).(\forall (n: nat).((clear (CSort n) x) \to (\forall (P: 
@@ -34,6 +34,9 @@ n)) \to P))).(\lambda (f: F).(\lambda (u: T).(\lambda (H3: (eq C (CHead e
 (ee: C).(match ee in C return (\lambda (_: C).Prop) with [(CSort _) 
 \Rightarrow False | (CHead _ _ _) \Rightarrow True])) I (CSort n) H3) in 
 (False_ind P H4))))))))) y x H0))) H)))).
+(* COMMENTS
+Initial nodes: 215
+END *)
 
 theorem clear_gen_bind:
  \forall (b: B).(\forall (e: C).(\forall (x: C).(\forall (u: T).((clear 
@@ -68,6 +71,9 @@ f) u0) (CHead e (Bind b) u))).(let H4 \def (eq_ind C (CHead e0 (Flat f) u0)
 (_: K).Prop) with [(Bind _) \Rightarrow False | (Flat _) \Rightarrow 
 True])])) I (CHead e (Bind b) u) H3) in (False_ind (eq C c (CHead e0 (Flat f) 
 u0)) H4))))))))) y x H0))) H))))).
+(* COMMENTS
+Initial nodes: 525
+END *)
 
 theorem clear_gen_flat:
  \forall (f: F).(\forall (e: C).(\forall (x: C).(\forall (u: T).((clear 
@@ -100,6 +106,9 @@ H3) in (\lambda (_: (eq F f0 f)).(\lambda (H8: (eq C e0 e)).(let H9 \def
 (eq_ind C e0 (\lambda (c0: C).((eq C c0 (CHead e (Flat f) u)) \to (clear e 
 c))) H2 e H8) in (let H10 \def (eq_ind C e0 (\lambda (c0: C).(clear c0 c)) H1 
 e H8) in H10))))) H5)) H4))))))))) y x H0))) H))))).
+(* COMMENTS
+Initial nodes: 453
+END *)
 
 theorem clear_gen_flat_r:
  \forall (f: F).(\forall (x: C).(\forall (e: C).(\forall (u: T).((clear x 
@@ -122,6 +131,9 @@ u))).(let H4 \def (eq_ind C c (\lambda (c0: C).((eq C c0 (CHead e (Flat f)
 u)) \to P)) H2 (CHead e (Flat f) u) H3) in (let H5 \def (eq_ind C c (\lambda 
 (c0: C).(clear e0 c0)) H1 (CHead e (Flat f) u) H3) in (H4 (refl_equal C 
 (CHead e (Flat f) u)))))))))))) x y H0))) H)))))).
+(* COMMENTS
+Initial nodes: 303
+END *)
 
 theorem clear_gen_all:
  \forall (c1: C).(\forall (c2: C).((clear c1 c2) \to (ex_3 B C T (\lambda (b: 
@@ -146,4 +158,7 @@ T).(\lambda (H3: (eq C c (CHead x1 (Bind x0) x2))).(let H4 \def (eq_ind C c
 C T (\lambda (b: B).(\lambda (e0: C).(\lambda (u0: T).(eq C (CHead x1 (Bind 
 x0) x2) (CHead e0 (Bind b) u0))))) x0 x1 x2 (refl_equal C (CHead x1 (Bind x0) 
 x2))) c H3)))))) H2)))))))) c1 c2 H))).
+(* COMMENTS
+Initial nodes: 381
+END *)