proposition: Lemma is_connected_pointed (g : graph) (v0 : vertex g) : (∏ (v : vertex g), graph_zig_zag v0 v) -> is_connected g.
proof: Proof. intro H. intros v1 v2. use (append_graph_zig_zag (y := v0)). - exact (reverse_graph_zig_zag (H v1)). - exact (H v2). Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Propositions UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Adjunctions.Core