uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/flt/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/flt/props.ma
index e6e148647d2fe2402865fc7d03f02271f581962f..57df415280d93642d7112713353370bc504c4475 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/flt/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/flt/props.ma
@@ -14,9 +14,9 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/flt/defs.ma".
+include "Basic-1/flt/defs.ma".
 
-include "LambdaDelta-1/C/props.ma".
+include "Basic-1/C/props.ma".
 
 theorem flt_thead_sx:
  \forall (k: K).(\forall (c: C).(\forall (u: T).(\forall (t: T).(flt c u c 
@@ -26,6 +26,9 @@ theorem flt_thead_sx:
 T).(le_lt_plus_plus (cweight c) (cweight c) (tweight u) (S (plus (tweight u) 
 (tweight t))) (le_n (cweight c)) (le_n_S (tweight u) (plus (tweight u) 
 (tweight t)) (le_plus_l (tweight u) (tweight t))))))).
+(* COMMENTS
+Initial nodes: 65
+END *)
 
 theorem flt_thead_dx:
  \forall (k: K).(\forall (c: C).(\forall (u: T).(\forall (t: T).(flt c t c 
@@ -35,6 +38,9 @@ theorem flt_thead_dx:
 T).(le_lt_plus_plus (cweight c) (cweight c) (tweight t) (S (plus (tweight u) 
 (tweight t))) (le_n (cweight c)) (le_n_S (tweight t) (plus (tweight u) 
 (tweight t)) (le_plus_r (tweight u) (tweight t))))))).
+(* COMMENTS
+Initial nodes: 65
+END *)
 
 theorem flt_shift:
  \forall (k: K).(\forall (c: C).(\forall (u: T).(\forall (t: T).(flt (CHead c 
@@ -49,6 +55,9 @@ c) (tweight u)) (tweight t)))) (plus (cweight c) (plus (tweight u) (tweight
 t))) (plus_assoc_l (cweight c) (tweight u) (tweight t))) (plus (cweight c) (S 
 (plus (tweight u) (tweight t)))) (plus_n_Sm (cweight c) (plus (tweight u) 
 (tweight t))))))).
+(* COMMENTS
+Initial nodes: 179
+END *)
 
 theorem flt_arith0:
  \forall (k: K).(\forall (c: C).(\forall (t: T).(\forall (i: nat).(flt c t 
@@ -56,6 +65,9 @@ theorem flt_arith0:
 \def
  \lambda (_: K).(\lambda (c: C).(\lambda (t: T).(\lambda (_: 
 nat).(lt_x_plus_x_Sy (plus (cweight c) (tweight t)) O)))).
+(* COMMENTS
+Initial nodes: 21
+END *)
 
 theorem flt_arith1:
  \forall (k1: K).(\forall (c1: C).(\forall (c2: C).(\forall (t1: T).((cle 
@@ -71,6 +83,9 @@ nat).(lt (cweight c2) n)) (le_lt_n_Sm (cweight c2) (plus (cweight c2)
 (tweight t2)) (le_plus_l (cweight c2) (tweight t2))) (plus (plus (cweight c2) 
 (tweight t2)) (S O)) (plus_sym (plus (cweight c2) (tweight t2)) (S 
 O))))))))))).
+(* COMMENTS
+Initial nodes: 151
+END *)
 
 theorem flt_arith2:
  \forall (c1: C).(\forall (c2: C).(\forall (t1: T).(\forall (i: nat).((flt c1 
@@ -83,6 +98,9 @@ c1 t1 (CHead c2 k2 t2) (TLRef j)))))))))
 (tweight t1)) (plus (cweight c2) (S O)) (plus (plus (cweight c2) (tweight 
 t2)) (S O)) H (le_plus_plus (cweight c2) (plus (cweight c2) (tweight t2)) (S 
 O) (S O) (le_plus_l (cweight c2) (tweight t2)) (le_n (S O))))))))))).
+(* COMMENTS
+Initial nodes: 115
+END *)
 
 theorem flt_trans:
  \forall (c1: C).(\forall (c2: C).(\forall (t1: T).(\forall (t2: T).((flt c1 
@@ -93,6 +111,9 @@ c1 t1 c3 t3))))))))
 (H: (lt (fweight c1 t1) (fweight c2 t2))).(\lambda (c3: C).(\lambda (t3: 
 T).(\lambda (H0: (lt (fweight c2 t2) (fweight c3 t3))).(lt_trans (fweight c1 
 t1) (fweight c2 t2) (fweight c3 t3) H H0)))))))).
+(* COMMENTS
+Initial nodes: 63
+END *)
 
 theorem flt_wf__q_ind:
  \forall (P: ((C \to (T \to Prop)))).(((\forall (n: nat).((\lambda (P0: ((C 
@@ -105,6 +126,9 @@ nat (fweight c t) n0) \to (P0 c t)))))) P n))) \to (\forall (c: C).(\forall
 (P: ((C \to (T \to Prop)))).(\lambda (H: ((\forall (n: nat).(\forall (c: 
 C).(\forall (t: T).((eq nat (fweight c t) n) \to (P c t))))))).(\lambda (c: 
 C).(\lambda (t: T).(H (fweight c t) c t (refl_equal nat (fweight c t))))))).
+(* COMMENTS
+Initial nodes: 85
+END *)
 
 theorem flt_wf_ind:
  \forall (P: ((C \to (T \to Prop)))).(((\forall (c2: C).(\forall (t2: 
@@ -124,4 +148,7 @@ nat (fweight c1 t1) m) \to (P c1 t1))))))) H0 (fweight c0 t0) H1) in (H c0 t0
 (\lambda (c1: C).(\lambda (t1: T).(\lambda (H3: (flt c1 t1 c0 t0)).(H2 
 (fweight c1 t1) H3 c1 t1 (refl_equal nat (fweight c1 t1))))))))))))))) c 
 t))))).
+(* COMMENTS
+Initial nodes: 211
+END *)