proposition: Lemma semChooseSizeEmptyGen : forall A `{RandomQC.ChoosableFromInterval A} (a1 a2 : A), ~ (RandomQC.leq a1 a2) -> forall size, (semProdSize (choose (a1,a2)) size <--> set0).
proof: Proof. Admitted. Lemma semSizedGen A (f : nat -> G A) : semProd (sized f) <--> \bigcup_n semGenSize (f n) n. Proof. by []. Qed.
imports: Coq(String List ZArith Lia) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool ssrnat eqtype seq) QuickChick(RandomQC RoseTrees Sets Tactics Producer)