(* This file was automatically generated: do not edit *********************)
-include "LambdaDelta-1/csubv/defs.ma".
+include "Basic-1/csubv/defs.ma".
-include "LambdaDelta-1/T/props.ma".
+include "Basic-1/T/props.ma".
theorem csubv_bind_same:
\forall (c1: C).(\forall (c2: C).((csubv c1 c2) \to (\forall (b: B).(\forall
H0)) Abbr v1 v2))) (\lambda (v1: T).(\lambda (v2: T).(csubv_bind c1 c2 H Abst
(sym_not_eq B Void Abst not_void_abst) Abst v1 v2))) (\lambda (v1:
T).(\lambda (v2: T).(csubv_void c1 c2 H v1 v2))) b)))).
+(* COMMENTS
+Initial nodes: 121
+END *)
theorem csubv_refl:
\forall (c: C).(csubv c c)
(k: K).(K_ind (\lambda (k0: K).(\forall (t: T).(csubv (CHead c0 k0 t) (CHead
c0 k0 t)))) (\lambda (b: B).(\lambda (t: T).(csubv_bind_same c0 c0 H b t t)))
(\lambda (f: F).(\lambda (t: T).(csubv_flat c0 c0 H f f t t))) k)))) c).
+(* COMMENTS
+Initial nodes: 93
+END *)