fact: Definition transfinite_recursor : forall (P:T1 -> Type), (forall x:T1, nf x -> (forall y:T1, y t1< x -> P y) -> P x) -> forall a, nf a -> P a.
imports: Coq(Arith Lia Compare_dec Relations Wellfounded Wf_nat List Bool Eqdep_dec Ensembles ArithRing Logic) hydras(More_Arith Restriction DecPreOrder rpo.term rpo.rpo Epsilon0.T1)