proposition: Lemma lt_a_phi0_b_inv1 : forall a n b a', cons a n b <_phi0 a'-> lt a a'.
proof: Proof. now inversion 1. Qed.
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)