`{H0 : Funext} {A : pType} {P : pFam A} {k : pForall A P} (Q : forall (k' : pForall A P), (k ==* k') -> Type) (q : Q k (reflexivity k)) (k' : pForall A P) : forall (H : k ==* k'), Q k' H. Proof. equiv_intro (equiv_path_pforall k k')^-1%equiv p. induction p. exact q. Defined.
Require Import Basics Types. Require Import Homotopy.IdentitySystems. Require Import WildCat. Require Import Truncations.Core. Require Import ReflectiveSubuniverse. Require Import Extensions.