proposition: Lemma map_map_fuse: forall A B C (f : B -> C) (g : A -> B) h e, (forall (d : A), f (g d) = h d) -> map f (map g e) = map h e.
proof: Proof. induction e; intros; try match goal with o: option _ |- _ => destruct o end; simpl; eauto with f_equal. Qed.
imports: List Dblib(DblibTactics DeBruijn)