proposition: Lemma nexp_well_def : forall n, fun_wd (nexp n).
proof: Proof. intro n; induction n as [| n Hrecn]; red in |- *; intros; simpl in |- *; algebra. Qed.
imports: CoRN.tactics.CornTac CoRN.algebra.CSums CoRN.algebra.CAbMonoids Coq.Sorting.Permutation CoRN.util.SetoidPermutation Coq.Setoids.Setoid Coq.Classes.Morphisms Coq(Lia)