proposition: Theorem total2_paths_equiv' {A : UU} (B : A -> UU) (x y : ∑ x, B x) : x = y ≃ x ╝ y.
proof: Proof. simple refine (weqtotaltofib _ _ _ _ _). - intros z p. exists (maponpaths pr1 p). induction p. reflexivity. - apply isweqcontrcontr. + apply iscontrcoconusfromt. + exists (x ,, idpath _ ,, idpath _). intro w. induction w as [w p], w as [a b], p as [p q], x as [a' b'], (p:a' = a), (q:b' = b). reflexivity. Defined.
imports: UniMath.MoreFoundations.Notations