proposition: Lemma nexp_wd : forall (x y : R) n, x [=] y -> x[^]n [=] y[^]n.
proof: Proof. 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)