proposition: Lemma D_le: forall m n f, (n <= m)%nat -> D m f -> D n f.
proof: Proof. intro m ; induction m ; intros n f Hnm Dmf. destruct n ; [apply Dmf | elim (Nat.nle_succ_0 _ Hnm)]. destruct (eq_nat_dec n (S m)) as [Heq | Hneq]. subst ; assumption. apply IHm ; [| apply D_pred] ; intuition lia. Qed.
imports: Rbase Ranalysis Lia Lra Rfunctions Rfunction_facts Rextensionality Rinterval Ranalysis_def Ranalysis_def_simpl Ranalysis_facts Ranalysis_continuity Ranalysis_derivability Ranalysis_monotonicity Rfunction_classes_def MyR_dist Reals.Tactics