uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/subst/fwd.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/subst/fwd.ma
index 5fec959ab142e68c258052734d5bf97179c4eeb5..a0678e5fba7541273d0ad153f15e7a5780544199 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/subst/fwd.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/subst/fwd.ma
@@ -14,7 +14,7 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/subst/defs.ma".
+include "Basic-1/subst/defs.ma".
 
 theorem subst_sort:
  \forall (v: T).(\forall (d: nat).(\forall (k: nat).(eq T (subst d v (TSort 
@@ -22,6 +22,9 @@ k)) (TSort k))))
 \def
  \lambda (_: T).(\lambda (_: nat).(\lambda (k: nat).(refl_equal T (TSort 
 k)))).
+(* COMMENTS
+Initial nodes: 13
+END *)
 
 theorem subst_lref_lt:
  \forall (v: T).(\forall (d: nat).(\forall (i: nat).((lt i d) \to (eq T 
@@ -32,6 +35,9 @@ d)).(eq_ind_r bool true (\lambda (b: bool).(eq T (match b with [true
 \Rightarrow (TLRef i) | false \Rightarrow (match (blt d i) with [true 
 \Rightarrow (TLRef (pred i)) | false \Rightarrow (lift d O v)])]) (TLRef i))) 
 (refl_equal T (TLRef i)) (blt i d) (lt_blt d i H))))).
+(* COMMENTS
+Initial nodes: 73
+END *)
 
 theorem subst_lref_eq:
  \forall (v: T).(\forall (i: nat).(eq T (subst i v (TLRef i)) (lift i O v)))
@@ -40,6 +46,9 @@ theorem subst_lref_eq:
 T (match b with [true \Rightarrow (TLRef i) | false \Rightarrow (match b with 
 [true \Rightarrow (TLRef (pred i)) | false \Rightarrow (lift i O v)])]) (lift 
 i O v))) (refl_equal T (lift i O v)) (blt i i) (le_bge i i (le_n i)))).
+(* COMMENTS
+Initial nodes: 71
+END *)
 
 theorem subst_lref_gt:
  \forall (v: T).(\forall (d: nat).(\forall (i: nat).((lt d i) \to (eq T 
@@ -53,6 +62,9 @@ i)).(eq_ind_r bool false (\lambda (b: bool).(eq T (match b with [true
 \Rightarrow (TLRef (pred i)) | false \Rightarrow (lift d O v)]) (TLRef (pred 
 i)))) (refl_equal T (TLRef (pred i))) (blt d i) (lt_blt i d H)) (blt i d) 
 (le_bge d i (lt_le_weak d i H)))))).
+(* COMMENTS
+Initial nodes: 130
+END *)
 
 theorem subst_head:
  \forall (k: K).(\forall (w: T).(\forall (u: T).(\forall (t: T).(\forall (d: 
@@ -61,4 +73,7 @@ t)))))))
 \def
  \lambda (k: K).(\lambda (w: T).(\lambda (u: T).(\lambda (t: T).(\lambda (d: 
 nat).(refl_equal T (THead k (subst d w u) (subst (s k d) w t))))))).
+(* COMMENTS
+Initial nodes: 37
+END *)