proposition: Lemma well_formed_val_exists : forall (A : Set)(c : Comp A), well_formed_comp c -> exists x, In x (getSupport c).
proof: Proof. induction 1; intuition; simpl in *. econstructor; intuition. destruct IHwell_formed_comp. edestruct H1; eauto. econstructor. eapply in_getUnique. eapply in_flatten. econstructor. split. eapply in_map_iff. econstructor. split. eauto. eauto. eauto. exists (oneVector n). eapply in_getAllBvectors. econstructor. eauto. Qed.
imports: Bvector List FCF.Blist FCF.EqDec FCF.Fold FCF.EqDec