proposition: Lemma max_nf (alpha beta : T1) : nf alpha -> nf beta -> nf (max alpha beta).
proof: Proof. case (max_dec alpha beta); intro H; rewrite H; 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)