proposition: Lemma joingA : associative joingT.
proof: Proof. by move=> A B C; rewrite joing_idl joing_idr /joing setUA. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)