uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/fwd.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/fwd.ma
index 11e130cc27af7819af6665b4ae5751d651cf1e8d..b378f61fc55862e5bb3643960a68be53fc2d4c25 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/fwd.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/fwd.ma
@@ -14,11 +14,11 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/getl/defs.ma".
+include "Basic-1/getl/defs.ma".
 
-include "LambdaDelta-1/drop/fwd.ma".
+include "Basic-1/drop/fwd.ma".
 
-include "LambdaDelta-1/clear/fwd.ma".
+include "Basic-1/clear/fwd.ma".
 
 theorem getl_gen_all:
  \forall (c1: C).(\forall (c2: C).(\forall (i: nat).((getl i c1 c2) \to (ex2 
@@ -29,6 +29,9 @@ c2)).(getl_ind i c1 c2 (ex2 C (\lambda (e: C).(drop i O c1 e)) (\lambda (e:
 C).(clear e c2))) (\lambda (e: C).(\lambda (H0: (drop i O c1 e)).(\lambda 
 (H1: (clear e c2)).(ex_intro2 C (\lambda (e0: C).(drop i O c1 e0)) (\lambda 
 (e0: C).(clear e0 c2)) e H0 H1)))) H)))).
+(* COMMENTS
+Initial nodes: 95
+END *)
 
 theorem getl_gen_sort:
  \forall (n: nat).(\forall (h: nat).(\forall (x: C).((getl h (CSort n) x) \to 
@@ -43,6 +46,9 @@ e x)) P (\lambda (x0: C).(\lambda (H1: (drop h O (CSort n) x0)).(\lambda (H2:
 (eq nat O O)).(let H6 \def (eq_ind C x0 (\lambda (c: C).(clear c x)) H2 
 (CSort n) H3) in (clear_gen_sort x n H6 P))))) (drop_gen_sort n h O x0 
 H1))))) H0)))))).
+(* COMMENTS
+Initial nodes: 179
+END *)
 
 theorem getl_gen_O:
  \forall (e: C).(\forall (x: C).((getl O e x) \to (clear e x)))
@@ -52,6 +58,9 @@ theorem getl_gen_O:
 (\lambda (e0: C).(clear e0 x)) (clear e x) (\lambda (x0: C).(\lambda (H1: 
 (drop O O e x0)).(\lambda (H2: (clear x0 x)).(let H3 \def (eq_ind_r C x0 
 (\lambda (c: C).(clear c x)) H2 e (drop_gen_refl e x0 H1)) in H3)))) H0)))).
+(* COMMENTS
+Initial nodes: 99
+END *)
 
 theorem getl_gen_S:
  \forall (k: K).(\forall (c: C).(\forall (x: C).(\forall (u: T).(\forall (h: 
@@ -63,6 +72,9 @@ nat).(\lambda (H: (getl (S h) (CHead c k u) x)).(let H0 \def (getl_gen_all
 k u) e)) (\lambda (e: C).(clear e x)) (getl (r k h) c x) (\lambda (x0: 
 C).(\lambda (H1: (drop (S h) O (CHead c k u) x0)).(\lambda (H2: (clear x0 
 x)).(getl_intro (r k h) c x x0 (drop_gen_drop k c x0 u h H1) H2)))) H0))))))).
+(* COMMENTS
+Initial nodes: 145
+END *)
 
 theorem getl_gen_2:
  \forall (c1: C).(\forall (c2: C).(\forall (i: nat).((getl i c1 c2) \to (ex_3 
@@ -85,6 +97,9 @@ x0) x2) (\lambda (c: C).(ex_3 B C T (\lambda (b: B).(\lambda (c0: C).(\lambda
 B).(\lambda (c: C).(\lambda (v: T).(eq C (CHead x1 (Bind x0) x2) (CHead c 
 (Bind b) v))))) x0 x1 x2 (refl_equal C (CHead x1 (Bind x0) x2))) c2 H4)))))) 
 H3))))) H0))))).
+(* COMMENTS
+Initial nodes: 325
+END *)
 
 theorem getl_gen_flat:
  \forall (f: F).(\forall (e: C).(\forall (d: C).(\forall (v: T).(\forall (i: 
@@ -97,6 +112,9 @@ e d))) (\lambda (H: (getl O (CHead e (Flat f) v) d)).(getl_intro O e d e
 H)))) (\lambda (n: nat).(\lambda (_: (((getl n (CHead e (Flat f) v) d) \to 
 (getl n e d)))).(\lambda (H0: (getl (S n) (CHead e (Flat f) v) 
 d)).(getl_gen_S (Flat f) e d v n H0)))) i))))).
+(* COMMENTS
+Initial nodes: 155
+END *)
 
 theorem getl_gen_bind:
  \forall (b: B).(\forall (e: C).(\forall (d: C).(\forall (v: T).(\forall (i: 
@@ -124,4 +142,7 @@ v))) (ex2 nat (\lambda (j: nat).(eq nat (S n) (S j))) (\lambda (j: nat).(getl
 j e d))) (ex_intro2 nat (\lambda (j: nat).(eq nat (S n) (S j))) (\lambda (j: 
 nat).(getl j e d)) n (refl_equal nat (S n)) (getl_gen_S (Bind b) e d v n 
 H0)))))) i))))).
+(* COMMENTS
+Initial nodes: 525
+END *)