proposition: Lemma plus_cons_cons_rw3 : forall a n b a' n' b', lt a' a -> nf (cons a n b) -> nf (cons a' n' b') -> cons a n b + cons a' n' b'= cons a n (b + (cons a' n' b')).
proof: Proof. simpl;intros a n b a' n' b' H H0 H1. now apply compare_gt_iff in H as ->. 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)