proposition: Lemma SF_sup_subdiv (f : R -> R) (a b : R) (n : nat) : subdivision (SF_sup_r f a b n) = match (Rle_dec a b) with | left _ => unif_part a b n | right _ => unif_part b a n end.
proof: Proof. rewrite /SF_sup_r ; case: (Rle_dec a b) => Hab //. Qed.
imports: Coq(Reals Psatz ssreflect ssrbool) mathcomp(seq) Rcomplements Rbar Lub Hierarchy