proposition: Lemma nf_exp_F alpha n : nf alpha -> nf (exp_F alpha n).
proof: Proof. induction n; cbn. - eauto with T1. - intro; apply mult_nf; 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)