proposition: Lemma leopp_trans y x z : leopp x y -> leopp y z -> leopp x z.
proof: Proof. by move: x y z => [x] [y] [z] ? yz; apply: (leconv_trans yz). Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg fingroup perm matrix) mathcomp(mathcomp_extra boolp classical_sets Rstruct) mathcomp(ssrnum ereal) mathcomp(lra Rstruct reals) Reals ssrR Reals_ext Ranalysis_ext ssr_ext ssralg_ext logb realType_ext fdist