proposition: Lemma real_ltP x y : x \is real -> y \is real -> ltr_xor_ge x y (min y x) (min x y) (max y x) (max x y) `|x - y| `|y - x| (y <= x) (x < y).
proof: Proof. by move=> xR yR; case: real_leP=> //; constructor. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)