proposition: Lemma succ_compatS : forall n:nat, succ (FS n) = FS (S n).
proof: Proof. reflexivity. 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)