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