{A} {B : A -> Type} { C : forall x, B x -> Type} {f g : forall x y, C x y} (p : f = g) (z1 : A) (z2 : B z1) : ap (fun f => f z1 z2) p = apD10 (apD10 p z1) z2. Proof. by path_induction. Defined.
Require Import Basics.Overture Basics.Equivalences Basics.PathGroupoids