proposition: Lemma succb_ref (a:t): succb a -> T1is_succ (refine a).
proof: Proof. induction a as [| a l]; cbn. - trivial. - destruct a as [n n0]; now destruct n. Qed.
imports: hydras(T1 E0 Comparable) Coq(Arith Logic.Eqdep_dec Peano_dec List Bool Recdef Lia Wellfounded.Inverse_Image Wellfounded.Inclusion RelationClasses )