proposition: Theorem compMap_wf : forall (A : Type)(B : Set){eqdb : EqDec B}(c : A -> Comp B)(ls : list A), (forall a, In a ls -> well_formed_comp (c a)) -> well_formed_comp (compMap _ c ls).
proof: Proof. induction ls; intuition; simpl in *; wftac. Qed.
imports: FCF.FCF Permutation