fact: Definition transport_sigma {A : Type} {B : A -> Type} {C : forall a:A, B a -> Type} {x1 x2 : A} (p : x1 = x2) (yz : { y : B x1 & C x1 y }) : transport (fun x => { y : B x & C x y }) p yz = (p # yz.1 ; transportD _ _ p yz.1 yz.2).
imports: HoTT.Basics Types.Arrow Types.Paths