proposition: Lemma prob_le1 (p : prob R) : ((p : R) <= 1)%R.
proof: Proof. by case: p => p /= /andP []. Qed.
imports: mathcomp(all_ssreflect ssralg ssrnum) mathcomp(reals normedtype) mathcomp(mathcomp_extra boolp) mathcomp(lra ring Rstruct)