proposition: Lemma composePathPathOverRotate {X:Type} {x' x'':X} {p:x'=x''} {Y : X -> Type} {y y': Y x'} (q : y = y') {y'' : Y x''} (r : PathOver p y' y'') (s : PathOver p y y'') : q ⟤ r = s <-> r = (!q) ⟤ s.
proof: Proof. induction q. simpl. apply isrefl_logeq. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.PartA