proposition: Lemma meet0x : left_zero \bot (@meet _ L).
proof: Proof. by move=> x; apply/eqP; rewrite -leEmeet. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)