proposition: Lemma path_forall_recr_beta' `{Funext} A B x0 P f g e Px : @transport (forall a : A, B a) (fun f => P f (f x0)) f g (@path_forall _ _ _ _ _ e) Px = @transport ((forall a, B a) * B x0)%type (fun x => P (fst x) (snd x)) (f, f x0) (g, g x0) (path_prod' (@path_forall _ _ _ _ _ e) (e x0)) Px.
proof: Proof. path_forall_beta_t. Defined.
imports: Basics.Overture Basics.Tactics Basics.PathGroupoids Basics.Contractible Basics.Equivalences Types.Prod Types.Forall Tactics.BinderApply