dependences update

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

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/r/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/r/props.ma
index a768ab93cb491e79a918e47dc7c359fdb67a1b2d..0815aaf5e8f042a0c78610639874b09323c36dc9 100644 (file)
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/r/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/r/props.ma
@@ -14,9 +14,9 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/r/defs.ma".
+include "Basic-1/r/defs.ma".
 
-include "LambdaDelta-1/s/defs.ma".
+include "Basic-1/s/defs.ma".
 
 theorem r_S:
  \forall (k: K).(\forall (i: nat).(eq nat (r k (S i)) (S (r k i))))
@@ -25,6 +25,9 @@ theorem r_S:
 i)) (S (r k0 i))))) (\lambda (b: B).(\lambda (i: nat).(refl_equal nat (S (r 
 (Bind b) i))))) (\lambda (f: F).(\lambda (i: nat).(refl_equal nat (S (r (Flat 
 f) i))))) k).
+(* COMMENTS
+Initial nodes: 65
+END *)
 
 theorem r_plus:
  \forall (k: K).(\forall (i: nat).(\forall (j: nat).(eq nat (r k (plus i j)) 
@@ -35,6 +38,9 @@ nat).(eq nat (r k0 (plus i j)) (plus (r k0 i) j))))) (\lambda (b: B).(\lambda
 (i: nat).(\lambda (j: nat).(refl_equal nat (plus (r (Bind b) i) j))))) 
 (\lambda (f: F).(\lambda (i: nat).(\lambda (j: nat).(refl_equal nat (plus (r 
 (Flat f) i) j))))) k).
+(* COMMENTS
+Initial nodes: 79
+END *)
 
 theorem r_plus_sym:
  \forall (k: K).(\forall (i: nat).(\forall (j: nat).(eq nat (r k (plus i j)) 
@@ -44,6 +50,9 @@ theorem r_plus_sym:
 nat).(eq nat (r k0 (plus i j)) (plus i (r k0 j)))))) (\lambda (_: B).(\lambda 
 (i: nat).(\lambda (j: nat).(refl_equal nat (plus i j))))) (\lambda (_: 
 F).(\lambda (i: nat).(\lambda (j: nat).(plus_n_Sm i j)))) k).
+(* COMMENTS
+Initial nodes: 63
+END *)
 
 theorem r_minus:
  \forall (i: nat).(\forall (n: nat).((lt n i) \to (\forall (k: K).(eq nat 
@@ -53,6 +62,9 @@ theorem r_minus:
 K).(K_ind (\lambda (k0: K).(eq nat (minus (r k0 i) (S n)) (r k0 (minus i (S 
 n))))) (\lambda (_: B).(refl_equal nat (minus i (S n)))) (\lambda (_: 
 F).(minus_x_Sy i n H)) k)))).
+(* COMMENTS
+Initial nodes: 69
+END *)
 
 theorem r_dis:
  \forall (k: K).(\forall (P: Prop).(((((\forall (i: nat).(eq nat (r k i) i))) 
@@ -67,6 +79,9 @@ nat).(refl_equal nat i))))))) (\lambda (f: F).(\lambda (P: Prop).(\lambda (_:
 ((((\forall (i: nat).(eq nat (r (Flat f) i) i))) \to P))).(\lambda (H0: 
 ((((\forall (i: nat).(eq nat (r (Flat f) i) (S i)))) \to P))).(H0 (\lambda 
 (i: nat).(refl_equal nat (S i)))))))) k).
+(* COMMENTS
+Initial nodes: 151
+END *)
 
 theorem s_r:
  \forall (k: K).(\forall (i: nat).(eq nat (s k (r k i)) (S i)))
@@ -74,6 +89,9 @@ theorem s_r:
  \lambda (k: K).(K_ind (\lambda (k0: K).(\forall (i: nat).(eq nat (s k0 (r k0 
 i)) (S i)))) (\lambda (_: B).(\lambda (i: nat).(refl_equal nat (S i)))) 
 (\lambda (_: F).(\lambda (i: nat).(refl_equal nat (S i)))) k).
+(* COMMENTS
+Initial nodes: 51
+END *)
 
 theorem r_arith0:
  \forall (k: K).(\forall (i: nat).(eq nat (minus (r k (S i)) (S O)) (r k i)))
@@ -82,6 +100,9 @@ theorem r_arith0:
 nat).(eq nat (minus n (S O)) (r k i))) (eq_ind_r nat (r k i) (\lambda (n: 
 nat).(eq nat n (r k i))) (refl_equal nat (r k i)) (minus (S (r k i)) (S O)) 
 (minus_Sx_SO (r k i))) (r k (S i)) (r_S k i))).
+(* COMMENTS
+Initial nodes: 105
+END *)
 
 theorem r_arith1:
  \forall (k: K).(\forall (i: nat).(\forall (j: nat).(eq nat (minus (r k (S 
@@ -90,4 +111,7 @@ i)) (S j)) (minus (r k i) j))))
  \lambda (k: K).(\lambda (i: nat).(\lambda (j: nat).(eq_ind_r nat (S (r k i)) 
 (\lambda (n: nat).(eq nat (minus n (S j)) (minus (r k i) j))) (refl_equal nat 
 (minus (r k i) j)) (r k (S i)) (r_S k i)))).
+(* COMMENTS
+Initial nodes: 69
+END *)