uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/props.ma
index 4bcf2521cdd39c1b0e2b7e8b93cece7f1ff4b9b9..9399ad4abfd36b13857e12ff20e7032a3710fe91 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/getl/props.ma
@@ -14,11 +14,11 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/getl/fwd.ma".
+include "Basic-1/getl/fwd.ma".
 
-include "LambdaDelta-1/drop/props.ma".
+include "Basic-1/drop/props.ma".
 
-include "LambdaDelta-1/clear/props.ma".
+include "Basic-1/clear/props.ma".
 
 theorem getl_refl:
  \forall (b: B).(\forall (c: C).(\forall (u: T).(getl O (CHead c (Bind b) u) 
@@ -27,6 +27,9 @@ theorem getl_refl:
  \lambda (b: B).(\lambda (c: C).(\lambda (u: T).(getl_intro O (CHead c (Bind 
 b) u) (CHead c (Bind b) u) (CHead c (Bind b) u) (drop_refl (CHead c (Bind b) 
 u)) (clear_bind b c u)))).
+(* COMMENTS
+Initial nodes: 59
+END *)
 
 theorem getl_head:
  \forall (k: K).(\forall (h: nat).(\forall (c: C).(\forall (e: C).((getl (r k 
@@ -38,6 +41,9 @@ h) H) in (ex2_ind C (\lambda (e0: C).(drop (r k h) O c e0)) (\lambda (e0:
 C).(clear e0 e)) (getl (S h) (CHead c k u) e) (\lambda (x: C).(\lambda (H1: 
 (drop (r k h) O c x)).(\lambda (H2: (clear x e)).(getl_intro (S h) (CHead c k 
 u) e x (drop_drop k h c x H1 u) H2)))) H0))))))).
+(* COMMENTS
+Initial nodes: 137
+END *)
 
 theorem getl_flat:
  \forall (c: C).(\forall (e: C).(\forall (h: nat).((getl h c e) \to (\forall 
@@ -55,6 +61,9 @@ x)).(\lambda (H2: (clear x e)).(nat_ind (\lambda (n: nat).((drop n O c x) \to
 (((drop h0 O c x) \to (getl h0 (CHead c (Flat f) u) e)))).(\lambda (H3: (drop 
 (S h0) O c x)).(getl_intro (S h0) (CHead c (Flat f) u) e x (drop_drop (Flat 
 f) h0 c x H3 u) H2)))) h H1)))) H0))))))).
+(* COMMENTS
+Initial nodes: 285
+END *)
 
 theorem getl_ctail:
  \forall (b: B).(\forall (c: C).(\forall (d: C).(\forall (u: T).(\forall (i: 
@@ -69,6 +78,9 @@ u))) (getl i (CTail k v c) (CHead (CTail k v d) (Bind b) u)) (\lambda (x:
 C).(\lambda (H1: (drop i O c x)).(\lambda (H2: (clear x (CHead d (Bind b) 
 u))).(getl_intro i (CTail k v c) (CHead (CTail k v d) (Bind b) u) (CTail k v 
 x) (drop_ctail c x O i H1 k v) (clear_ctail b x d u H2 k v))))) H0))))))))).
+(* COMMENTS
+Initial nodes: 203
+END *)
 
 theorem getl_mono:
  \forall (c: C).(\forall (x1: C).(\forall (h: nat).((getl h c x1) \to 
@@ -86,4 +98,7 @@ x0 x1)).(let H7 \def (eq_ind C x (\lambda (c0: C).(drop h O c c0)) H2 x0
 C).(drop h O c c0)) H7 x (drop_mono c x O h H2 x0 H5)) in (let H9 \def 
 (eq_ind_r C x0 (\lambda (c0: C).(clear c0 x1)) H6 x (drop_mono c x O h H2 x0 
 H5)) in (clear_mono x x1 H9 x2 H3))))))) H4))))) H1))))))).
+(* COMMENTS
+Initial nodes: 269
+END *)