proposition: Lemma rleT_ee a b: realp a -> realp b -> a <=r b \/ b <=r a.
proof: Proof. move: (proj2 BR_tor); rewrite (proj2 BR_osr) => tor ar br. by case: (tor _ _ ar br)=> h1; [left | right]; apply /BR_gleP. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)