(* This file was automatically generated: do not edit *********************)
-include "Basic-1/csubt/defs.ma".
+include "basic_1/csubt/defs.ma".
-theorem csubt_refl:
+include "basic_1/C/fwd.ma".
+
+lemma csubt_refl:
\forall (g: G).(\forall (c: C).(csubt g c c))
\def
\lambda (g: G).(\lambda (c: C).(C_ind (\lambda (c0: C).(csubt g c0 c0))
(\lambda (n: nat).(csubt_sort g n)) (\lambda (c0: C).(\lambda (H: (csubt g c0
c0)).(\lambda (k: K).(\lambda (t: T).(csubt_head g c0 c0 H k t))))) c)).
-(* COMMENTS
-Initial nodes: 53
-END *)