proposition: Lemma tuto_minset_eq : forall P1 P2 A, P1 =1 P2 -> minset P1 A = minset P2 A.
proof: Proof. by move=> P1 P2 A eP12; apply: eq_forallb => B; rewrite eP12. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype tuple finset)