uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/llt/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/llt/props.ma
index 41a498780830e3848460efb820a90596964732b7..ef1f15a9630438400688257704963ffdf9632bf7 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/llt/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/llt/props.ma
@@ -14,9 +14,9 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/llt/defs.ma".
+include "Basic-1/llt/defs.ma".
 
-include "LambdaDelta-1/leq/defs.ma".
+include "Basic-1/leq/defs.ma".
 
 theorem lweight_repl:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((leq g a1 a2) \to (eq nat 
@@ -33,6 +33,9 @@ a3))).(\lambda (a4: A).(\lambda (a5: A).(\lambda (_: (leq g a4 a5)).(\lambda
 a0) (lweight a4)) (plus (lweight a3) (lweight a5)) (f_equal2 nat nat nat plus 
 (lweight a0) (lweight a3) (lweight a4) (lweight a5) H1 H3)))))))))) a1 a2 
 H)))).
+(* COMMENTS
+Initial nodes: 189
+END *)
 
 theorem llt_repl:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((leq g a1 a2) \to (\forall 
@@ -42,6 +45,9 @@ theorem llt_repl:
 a2)).(\lambda (a3: A).(\lambda (H0: (lt (lweight a1) (lweight a3))).(let H1 
 \def (eq_ind nat (lweight a1) (\lambda (n: nat).(lt n (lweight a3))) H0 
 (lweight a2) (lweight_repl g a1 a2 H)) in H1)))))).
+(* COMMENTS
+Initial nodes: 61
+END *)
 
 theorem llt_trans:
  \forall (a1: A).(\forall (a2: A).(\forall (a3: A).((llt a1 a2) \to ((llt a2 
@@ -50,18 +56,27 @@ a3) \to (llt a1 a3)))))
  \lambda (a1: A).(\lambda (a2: A).(\lambda (a3: A).(\lambda (H: (lt (lweight 
 a1) (lweight a2))).(\lambda (H0: (lt (lweight a2) (lweight a3))).(lt_trans 
 (lweight a1) (lweight a2) (lweight a3) H H0))))).
+(* COMMENTS
+Initial nodes: 43
+END *)
 
 theorem llt_head_sx:
  \forall (a1: A).(\forall (a2: A).(llt a1 (AHead a1 a2)))
 \def
  \lambda (a1: A).(\lambda (a2: A).(le_n_S (lweight a1) (plus (lweight a1) 
 (lweight a2)) (le_plus_l (lweight a1) (lweight a2)))).
+(* COMMENTS
+Initial nodes: 29
+END *)
 
 theorem llt_head_dx:
  \forall (a1: A).(\forall (a2: A).(llt a2 (AHead a1 a2)))
 \def
  \lambda (a1: A).(\lambda (a2: A).(le_n_S (lweight a2) (plus (lweight a1) 
 (lweight a2)) (le_plus_r (lweight a1) (lweight a2)))).
+(* COMMENTS
+Initial nodes: 29
+END *)
 
 theorem llt_wf__q_ind:
  \forall (P: ((A \to Prop))).(((\forall (n: nat).((\lambda (P0: ((A \to 
@@ -73,6 +88,9 @@ A).((eq nat (lweight a) n) \to (P a))))) in (\lambda (P: ((A \to
 Prop))).(\lambda (H: ((\forall (n: nat).(\forall (a: A).((eq nat (lweight a) 
 n) \to (P a)))))).(\lambda (a: A).(H (lweight a) a (refl_equal nat (lweight 
 a)))))).
+(* COMMENTS
+Initial nodes: 61
+END *)
 
 theorem llt_wf_ind:
  \forall (P: ((A \to Prop))).(((\forall (a2: A).(((\forall (a1: A).((llt a1 
@@ -90,4 +108,7 @@ A).(P a0))) (\lambda (n0: nat).(\lambda (H0: ((\forall (m: nat).((lt m n0)
 a1)))))) H0 (lweight a0) H1) in (H a0 (\lambda (a1: A).(\lambda (H3: (lt 
 (lweight a1) (lweight a0))).(H2 (lweight a1) H3 a1 (refl_equal nat (lweight 
 a1))))))))))))) a)))).
+(* COMMENTS
+Initial nodes: 179
+END *)