fact: Definition get_decomposition : forall c:T1, lt zero c -> {a:T1 & {n:nat & {b:T1 | c = cons a n b}}}.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)