proposition: Lemma inverse_cp_p_compare (A:Type) (B:A->Type) (a1 a2:A) (b1:B a1) (b2:B a2) (p q:a1=a2) (α : p=q) (t : PathOver p b1 b2) (u : PathOver q b1 b2) (k : PathOver α t u) : inverse_cp_p' k = inverse_cp_p'' k.
proof: Proof. induction α,p. reflexivity. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.PartA