proposition: Lemma zero_nexp : forall n, 0 < n -> ([0]:R) [^]n [=] [0].
proof: Proof. intros n H. induction n as [| n Hrecn]. inversion H. Step_final (([0]:R) [*][0][^]n). 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)