graph_succ_not_top_unique@{} {A : Graph} (x : vert (graph_succ A)) (xt : ~(edge (graph_succ A) (inr tt) x)) : is_inl x. Proof. destruct x as [x|x]. - exact tt. - destruct (xt tt). Qed.
Require Import Basics. Require Import Types. Require Import HProp. Require Import Universes.Smallness.