Section assoc.
Fixpoint assoc {A B : Type}(eq : A -> A -> bool)(x : A)(l : list (A * B)) : option B :=
match l with
| nil => None
| (x', y) :: l' => if eq x x' then Some y else assoc eq x l'
end.
Definition assoc_default {A B : Type}
(eqA : A -> A -> bool) (d : B) (l : list (A * B)) (x : A) : B :=
match assoc eqA x l with
| None => d
| Some b => b
end.
(* not an iff. There might be l' before l with (k, v') in it *)
End assoc.

Lemma comp_flat_map (A B C : Type) (f : A -> list B) (g : B -> list C) h l :
(forall a, In a l -> h a = flat_map g (f a)) -> flat_map h l = flat_map g (flat_map f l).