proposition: Lemma clamp_in01 x : 0 <= x <= 1 -> clamp x = x.
proof: Proof. by case/andP=> ge0_x le1_x; rewrite /clamp min_l ?max_l. Qed.
imports: mathcomp(all_ssreflect all_algebra) mathcomp.classical(boolp classical_sets mathcomp_extra) xfinmap ereal reals discrete topology realseq realsum