proposition: Lemma leoppP (a b : T A) : a <= b <-> unbox b <= unbox a.
proof: Proof. by case a;case b=>*;rewrite !unboxK. 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