proposition: Lemma inversePathOverWeq' {X:Type} {x x':X} {p:x'=x} {Y : X -> Type} {y : Y x} {y' : Y x'} : PathOver (!p) y y' ≃ PathOver p y' y.
proof: Proof. exists inversePathOver'. intros s. use tpair. - exists (inversePathOver s). apply inverseInversePathOver1. - cbn. induction p. intros [t []]. induction t. reflexivity. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.PartA