proposition: Lemma meetA : associative meet.
proof: Proof. by move=> y x z; rewrite /meet !f'_can meetA. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)