proposition: Lemma join_r x y : x <= y -> x `|` y = y.
proof: Proof. exact/join_idPr. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)