proposition: Lemma fsubT A : fsub A A = [set : A].
proof: Proof. by apply/setP => x; rewrite !inE (valP x). Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)