(* This file was automatically generated: do not edit *********************)
-include "LambdaDelta-1/csuba/getl.ma".
+include "Basic-1/csuba/getl.ma".
-include "LambdaDelta-1/csuba/props.ma".
+include "Basic-1/csuba/props.ma".
-include "LambdaDelta-1/arity/props.ma".
+include "Basic-1/arity/props.ma".
-include "LambdaDelta-1/csubv/getl.ma".
+include "Basic-1/csubv/getl.ma".
theorem csuba_arity:
\forall (g: G).(\forall (c1: C).(\forall (t: T).(\forall (a: A).((arity g c1
g c2 t0 a1))))).(\lambda (a2: A).(\lambda (H2: (leq g a1 a2)).(\lambda (c2:
C).(\lambda (H3: (csuba g c c2)).(arity_repl g c2 t0 a1 (H1 c2 H3) a2
H2)))))))))) c1 t a H))))).
+(* COMMENTS
+Initial nodes: 1505
+END *)
theorem csuba_arity_rev:
\forall (g: G).(\forall (c1: C).(\forall (t: T).(\forall (a: A).((arity g c1
(a2: A).(\lambda (H2: (leq g a1 a2)).(\lambda (c2: C).(\lambda (H3: (csuba g
c2 c)).(\lambda (H4: (csubv c2 c)).(arity_repl g c2 t0 a1 (H1 c2 H3 H4) a2
H2))))))))))) c1 t a H))))).
+(* COMMENTS
+Initial nodes: 3597
+END *)
theorem arity_appls_appl:
\forall (g: G).(\forall (c: C).(\forall (v: T).(\forall (a1: A).((arity g c
(AHead x a2))).(arity_appl g c t0 x H4 (THeads (Flat Appl) t1 (THead (Flat
Appl) v (THead (Bind Abst) u t))) a2 (H1 (AHead x a2) H5))))) H3)))))))
vs))))))))).
+(* COMMENTS
+Initial nodes: 687
+END *)