dependences update

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/csubst1/getl.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/csubst1/getl.ma
index 499d2e13e4e0258c2682ec9534bcbe7e89674231..e24ba95339b0cc80f9506682a566a525ca067855 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/csubst1/getl.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/csubst1/getl.ma
@@ -14,13 +14,13 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/csubst1/props.ma".
+include "Basic-1/csubst1/props.ma".
 
-include "LambdaDelta-1/csubst0/getl.ma".
+include "Basic-1/csubst0/getl.ma".
 
-include "LambdaDelta-1/subst1/props.ma".
+include "Basic-1/subst1/props.ma".
 
-include "LambdaDelta-1/drop/props.ma".
+include "Basic-1/drop/props.ma".
 
 theorem csubst1_getl_ge:
  \forall (i: nat).(\forall (n: nat).((le i n) \to (\forall (c1: C).(\forall 
@@ -33,6 +33,9 @@ c2)).(csubst1_ind i v c1 (\lambda (c: C).(\forall (e: C).((getl n c1 e) \to
 (getl n c e)))) (\lambda (e: C).(\lambda (H1: (getl n c1 e)).H1)) (\lambda 
 (c3: C).(\lambda (H1: (csubst0 i v c1 c3)).(\lambda (e: C).(\lambda (H2: 
 (getl n c1 e)).(csubst0_getl_ge i n H c1 c3 v H1 e H2))))) c2 H0))))))).
+(* COMMENTS
+Initial nodes: 111
+END *)
 
 theorem csubst1_getl_lt:
  \forall (i: nat).(\forall (n: nat).((lt n i) \to (\forall (c1: C).(\forall 
@@ -136,6 +139,9 @@ x0) x3) e2)) (\lambda (e2: C).(getl n c3 e2)) (CHead x2 (Bind x0) x4)
 (csubst1_sing (S (minus i (S n))) v (CHead x1 (Bind x0) x3) (CHead x2 (Bind 
 x0) x4) (csubst0_both_bind x0 (minus i (S n)) v x3 x4 H7 x1 x2 H8)) H6) e1 
 H5)))))))))) H4)) H3)) (minus i n) (minus_x_Sy i n H)))))) c2 H0))))))).
+(* COMMENTS
+Initial nodes: 2035
+END *)
 
 theorem csubst1_getl_ge_back:
  \forall (i: nat).(\forall (n: nat).((le i n) \to (\forall (c1: C).(\forall 
@@ -148,6 +154,9 @@ c2)).(csubst1_ind i v c1 (\lambda (c: C).(\forall (e: C).((getl n c e) \to
 (getl n c1 e)))) (\lambda (e: C).(\lambda (H1: (getl n c1 e)).H1)) (\lambda 
 (c3: C).(\lambda (H1: (csubst0 i v c1 c3)).(\lambda (e: C).(\lambda (H2: 
 (getl n c3 e)).(csubst0_getl_ge_back i n H c1 c3 v H1 e H2))))) c2 H0))))))).
+(* COMMENTS
+Initial nodes: 111
+END *)
 
 theorem getl_csubst1:
  \forall (d: nat).(\forall (c: C).(\forall (e: C).(\forall (u: T).((getl d c 
@@ -268,4 +277,7 @@ x1)).(ex2_2_intro C C (\lambda (a0: C).(\lambda (_: C).(csubst1 (S n) u
 n) a0 a))) (CHead x0 (Flat f) (lift (S O) (S n) x)) (CHead x1 (Flat f) x) 
 (csubst1_flat f (S n) u t (lift (S O) (S n) x) H3 c0 x0 H5) (drop_skip_flat 
 (S O) n x0 x1 H6 f x)))))) H4)))) H2)))))))) k)))) c)))) d).
+(* COMMENTS
+Initial nodes: 2467
+END *)