proposition: Lemma transport_apD_transportD {A} B (f : forall x : A, B x) (C : forall x, B x -> Type) {x1 x2 : A} (p : x1 = x2) (z : C x1 (f x1)) : apD f p # transportD B C p _ z = transport (fun x => C x (f x)) p z.
proof: Proof. destruct p; reflexivity. Defined.
imports: Basics.Overture Basics.Tactics