X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2FLAMBDA-TYPES%2FBasic-1%2Fleq%2Fprops.ma;h=b83fc503e4fe5d920693972058d1c18916d66055;hb=d3c72253769956a8af10e6ea990ed34c92999e58;hp=e1a1510be95e82d18adca1847b797821df5629cf;hpb=3531d88e2a19cba027b4b882f8dd74bf37283b9c;p=helm.git

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/leq/props.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/leq/props.ma
index e1a1510be..b83fc503e 100644
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/leq/props.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Basic-1/leq/props.ma
@@ -14,9 +14,9 @@
 
 (* This file was automatically generated: do not edit *********************)
 
-include "LambdaDelta-1/leq/fwd.ma".
+include "Basic-1/leq/fwd.ma".
 
-include "LambdaDelta-1/aplus/props.ma".
+include "Basic-1/aplus/props.ma".
 
 theorem ahead_inj_snd:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).(\forall (a3: A).(\forall 
@@ -37,6 +37,9 @@ A (\lambda (e: A).(match e in A return (\lambda (_: A).A) with [(ASort _ _)
 in (\lambda (H6: (eq A a3 x0)).(let H7 \def (eq_ind_r A x1 (\lambda (a: 
 A).(leq g a2 a)) H2 a4 H5) in (let H8 \def (eq_ind_r A x0 (\lambda (a: 
 A).(leq g a1 a)) H1 a3 H6) in H7)))) H4))))))) H0)))))))).
+(* COMMENTS
+Initial nodes: 259
+END *)
 
 theorem leq_refl:
  \forall (g: G).(\forall (a: A).(leq g a a))
@@ -46,6 +49,9 @@ theorem leq_refl:
 (aplus g (ASort n n0) O))))) (\lambda (a0: A).(\lambda (H: (leq g a0 
 a0)).(\lambda (a1: A).(\lambda (H0: (leq g a1 a1)).(leq_head g a0 a0 H a1 a1 
 H0))))) a)).
+(* COMMENTS
+Initial nodes: 87
+END *)
 
 theorem leq_eq:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((eq A a1 a2) \to (leq g a1 
@@ -53,6 +59,9 @@ a2))))
 \def
  \lambda (g: G).(\lambda (a1: A).(\lambda (a2: A).(\lambda (H: (eq A a1 
 a2)).(eq_ind A a1 (\lambda (a: A).(leq g a1 a)) (leq_refl g a1) a2 H)))).
+(* COMMENTS
+Initial nodes: 39
+END *)
 
 theorem leq_sym:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((leq g a1 a2) \to (leq g 
@@ -67,6 +76,9 @@ k))).(leq_sort g h2 h1 n2 n1 k (sym_eq A (aplus g (ASort h1 n1) k) (aplus g
 (leq g a3 a4)).(\lambda (H1: (leq g a4 a3)).(\lambda (a5: A).(\lambda (a6: 
 A).(\lambda (_: (leq g a5 a6)).(\lambda (H3: (leq g a6 a5)).(leq_head g a4 a3 
 H1 a6 a5 H3))))))))) a1 a2 H)))).
+(* COMMENTS
+Initial nodes: 173
+END *)
 
 theorem leq_trans:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((leq g a1 a2) \to (\forall 
@@ -111,6 +123,9 @@ A).(\lambda (H6: (leq g a4 x0)).(\lambda (H7: (leq g a6 x1)).(\lambda (H8:
 (AHead x0 x1) H8) in (eq_ind_r A (AHead x0 x1) (\lambda (a: A).(leq g (AHead 
 a3 a5) a)) (leq_head g a3 x0 (H1 x0 H6) a5 x1 (H3 x1 H7)) a0 H9))))))) 
 H5))))))))))))) a1 a2 H)))).
+(* COMMENTS
+Initial nodes: 869
+END *)
 
 theorem leq_ahead_false_1:
  \forall (g: G).(\forall (a1: A).(\forall (a2: A).((leq g (AHead a1 a2) a1) 
@@ -160,6 +175,9 @@ in ((let H7 \def (f_equal A A (\lambda (e: A).(match e in A return (\lambda
 (eq_ind_r A x1 (\lambda (a3: A).(leq g a2 a3)) H4 a0 H7) in (let H10 \def 
 (eq_ind_r A x0 (\lambda (a3: A).(leq g (AHead a a0) a3)) H3 a H8) in (H a0 
 H10 P))))) H6))))))) H2)))))))))) a1)).
+(* COMMENTS
+Initial nodes: 797
+END *)
 
 theorem leq_ahead_false_2:
  \forall (g: G).(\forall (a2: A).(\forall (a1: A).((leq g (AHead a1 a2) a2) 
@@ -209,4 +227,7 @@ in ((let H7 \def (f_equal A A (\lambda (e: A).(match e in A return (\lambda
 (eq_ind_r A x1 (\lambda (a3: A).(leq g (AHead a a0) a3)) H4 a0 H7) in (let 
 H10 \def (eq_ind_r A x0 (\lambda (a3: A).(leq g a1 a3)) H3 a H8) in (H0 a H9 
 P))))) H6))))))) H2)))))))))) a2)).
+(* COMMENTS
+Initial nodes: 797
+END *)