{A : Type} {a0 : A} {R S : A -> Type} {r0 : R a0} {s0 : S a0} (f g : pfamMap R S r0 s0) := { p : forall a : A, pr1 f a == pr1 g a & p a0 r0 = pr2 f @ (pr2 g)^}. Global Instance reflexive_pfammap_homotopy {A : Type} {a0 : A} {R S : A -> Type} {r0 : R a0} {s0 : S a0} : Reflexive ( (r0:=r0) (s0:=s0)). Proof. intro g. snrefine (_;_). - exact (fun _ _ => idpath). - cbn; symmetry. exact (concat_pV _). Defined.
Require Import Basics. Require Import Types.Sigma Types.Equiv Types.Paths. Require Import HoTT.Tactics.