proposition: Lemma nf_inv3 : forall a n a' n' b', nf (cons a n (cons a' n' b')) -> lt a' a.
proof: Proof. unfold nf; cbn; destruct a, a', b'; try discriminate; auto with T1; intro H; red in H; repeat rewrite andb_true_iff in H; decompose [and] H; apply (bool_decide_eq_true _); auto. 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)