proposition: Lemma zleT_ee a b: intp a -> intp b -> a <=z b \/ b <=z a.
proof: Proof. move: BZor_tor => [_]; rewrite BZor_sr => h pa pb. by case: (h _ _ pa pb)=> h1; [left | right]; apply /zle_P. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)