uri renaming and new nodes count

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/aplus/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/aplus/props.ma
index c7cd372aeea4d89adc6cdfc048f3158904705979..94bb9a069a40f695aa638ce0643baaf992a94e02 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/aplus/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/aplus/props.ma
@@ -14,9 +14,9 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/aplus/defs.ma".
+include "Basic-1/aplus/defs.ma".
 
-include "LambdaDelta-1/next_plus/props.ma".
+include "Basic-1/next_plus/props.ma".
 
 theorem aplus_reg_r:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).(\forall (h1: nat).(\forall 
@@ -29,6 +29,9 @@ nat).(nat_ind (\lambda (n: nat).(eq A (aplus g a1 (plus n h1)) (aplus g a2
 (plus n h2)))) H (\lambda (n: nat).(\lambda (H0: (eq A (aplus g a1 (plus n 
 h1)) (aplus g a2 (plus n h2)))).(f_equal2 G A A asucc g g (aplus g a1 (plus n 
 h1)) (aplus g a2 (plus n h2)) (refl_equal G g) H0))) h))))))).
+(* COMMENTS
+Initial nodes: 143
+END *)
 
 theorem aplus_assoc:
  \forall (g: G).(\forall (a: A).(\forall (h1: nat).(\forall (h2: nat).(eq A 
@@ -48,6 +51,9 @@ n0) (asucc g (aplus g a (plus n n0))))).(eq_ind nat (S (plus n n0)) (\lambda
 (aplus g a n1)))) (f_equal2 G A A asucc g g (aplus g (asucc g (aplus g a n)) 
 n0) (asucc g (aplus g a (plus n n0))) (refl_equal G g) H0) (plus n (S n0)) 
 (plus_n_Sm n n0)))) h2)))) h1))).
+(* COMMENTS
+Initial nodes: 361
+END *)
 
 theorem aplus_asucc:
  \forall (g: G).(\forall (h: nat).(\forall (a: A).(eq A (aplus g (asucc g a) 
@@ -57,6 +63,9 @@ h) (asucc g (aplus g a h)))))
 (plus (S O) h)) (\lambda (a0: A).(eq A a0 (asucc g (aplus g a h)))) 
 (refl_equal A (asucc g (aplus g a h))) (aplus g (aplus g a (S O)) h) 
 (aplus_assoc g a (S O) h)))).
+(* COMMENTS
+Initial nodes: 87
+END *)
 
 theorem aplus_sort_O_S_simpl:
  \forall (g: G).(\forall (n: nat).(\forall (k: nat).(eq A (aplus g (ASort O 
@@ -66,6 +75,9 @@ n) (S k)) (aplus g (ASort O (next g n)) k))))
 g (ASort O n)) k) (\lambda (a: A).(eq A a (aplus g (ASort O (next g n)) k))) 
 (refl_equal A (aplus g (ASort O (next g n)) k)) (asucc g (aplus g (ASort O n) 
 k)) (aplus_asucc g k (ASort O n))))).
+(* COMMENTS
+Initial nodes: 97
+END *)
 
 theorem aplus_sort_S_S_simpl:
  \forall (g: G).(\forall (n: nat).(\forall (h: nat).(\forall (k: nat).(eq A 
@@ -75,6 +87,9 @@ theorem aplus_sort_S_S_simpl:
 A (aplus g (asucc g (ASort (S h) n)) k) (\lambda (a: A).(eq A a (aplus g 
 (ASort h n) k))) (refl_equal A (aplus g (ASort h n) k)) (asucc g (aplus g 
 (ASort (S h) n) k)) (aplus_asucc g k (ASort (S h) n)))))).
+(* COMMENTS
+Initial nodes: 97
+END *)
 
 theorem aplus_asort_O_simpl:
  \forall (g: G).(\forall (h: nat).(\forall (n: nat).(eq A (aplus g (ASort O 
@@ -90,6 +105,9 @@ n)))))).(\lambda (n0: nat).(eq_ind A (aplus g (asucc g (ASort O n0)) n)
 g n0)) n) (ASort O n1))) (H (next g n0)) (next g (next_plus g n0 n)) 
 (next_plus_next g n0 n)) (asucc g (aplus g (ASort O n0) n)) (aplus_asucc g n 
 (ASort O n0)))))) h)).
+(* COMMENTS
+Initial nodes: 229
+END *)
 
 theorem aplus_asort_le_simpl:
  \forall (g: G).(\forall (h: nat).(\forall (k: nat).(\forall (n: nat).((le h 
@@ -117,6 +135,9 @@ g (ASort O n) h0)) (ASort (minus O (S h0)) n)) H3))))) (le_gen_S h0 O H0))))
 (S n) n0)) h0) (\lambda (a: A).(eq A a (ASort (minus (S n) (S h0)) n0))) (H n 
 n0 (le_S_n h0 n H1)) (asucc g (aplus g (ASort (S n) n0) h0)) (aplus_asucc g 
 h0 (ASort (S n) n0))))))) k)))) h)).
+(* COMMENTS
+Initial nodes: 484
+END *)
 
 theorem aplus_asort_simpl:
  \forall (g: G).(\forall (h: nat).(\forall (k: nat).(\forall (n: nat).(eq A 
@@ -143,6 +164,9 @@ h k))) (aplus_assoc g (ASort k n) k (minus h k))) h (le_plus_minus k h
 n) (ASort (minus k h) (next_plus g n n0)))) (refl_equal A (ASort (minus k h) 
 (next_plus g n O))) (minus h k) (O_minus h k H)) (aplus g (ASort k n) h) 
 (aplus_asort_le_simpl g h k n H))))))).
+(* COMMENTS
+Initial nodes: 587
+END *)
 
 theorem aplus_ahead_simpl:
  \forall (g: G).(\forall (h: nat).(\forall (a1: A).(\forall (a2: A).(eq A 
@@ -159,6 +183,9 @@ A).(\lambda (a2: A).(eq_ind A (aplus g (asucc g (AHead a1 a2)) n) (\lambda
 (AHead a1 a))) (H a1 (asucc g a2)) (asucc g (aplus g a2 n)) (aplus_asucc g n 
 a2)) (asucc g (aplus g (AHead a1 a2) n)) (aplus_asucc g n (AHead a1 a2))))))) 
 h)).
+(* COMMENTS
+Initial nodes: 239
+END *)
 
 theorem aplus_asucc_false:
  \forall (g: G).(\forall (a: A).(\forall (h: nat).((eq A (aplus g (asucc g a) 
@@ -217,6 +244,9 @@ nat) on n: A \def (match n with [O \Rightarrow a2 | (S n0) \Rightarrow (asucc
 g0 (aplus g0 a2 n0))]) in aplus) g (asucc g a1) h) | (AHead _ a2) \Rightarrow 
 a2])) (AHead a0 (aplus g (asucc g a1) h)) (AHead a0 a1) H2) in (H0 h H3 
 P)))))))))) a)).
+(* COMMENTS
+Initial nodes: 977
+END *)
 
 theorem aplus_inj:
  \forall (g: G).(\forall (h1: nat).(\forall (h2: nat).(\forall (a: A).((eq A 
@@ -246,4 +276,7 @@ g a n0)))) H1 (aplus g (asucc g a) n) (aplus_asucc g n a)) in (let H3 \def
 (eq_ind_r A (asucc g (aplus g a n0)) (\lambda (a0: A).(eq A (aplus g (asucc g 
 a) n) a0)) H2 (aplus g (asucc g a) n0) (aplus_asucc g n0 a)) in (f_equal nat 
 nat S n n0 (H n0 (asucc g a) H3)))))))) h2)))) h1)).
+(* COMMENTS
+Initial nodes: 599
+END *)