proposition: Lemma finite_lt : forall n p : nat, (n < p)%nat -> lt (FS n) (FS p).
proof: Proof. intros; auto with T1. 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)