fact: Fixpoint tlist'_quiver_equiv (k i j : G) (f : @tlist' _ edges k i) (g : @tlist' _ edges k j) ( p : i = j ) : Type := match f in (tlist' _ i_t) return (tlist' _ j) -> i_t = j -> Type with | tnil => fun g' q => tnil = Logic.transport_r (fun z => @tlist' _ edges k z) q g' | @tcons _ _ _ i0 i1 fhead ftail => fun g' : tlist' _ j => match g' in tlist' _ j return @tlist' _ edges k i1 -> i0 = j -> Type with | tnil => fun _ _ => False | @tcons _ _ _ j0 j1 ghead gtail => fun ftail' p' => { q : i1 = j1 & (Logic.transport (fun t => edges i0 t) q fhead ≈ Logic.transport_r (fun t => edges t j1) p' ghead) & tlist'_quiver_equiv k i1 j1 ftail' gtail q } end ftail end g p.
imports: Category.Lib Category.Lib.TList Category.Theory.Category Category.Theory.Isomorphism Category.Theory.Functor Category.Theory.Adjunction Category.Theory.Universal.Arrow Category.Instance.StrictCat Category.Construction.Groupoid Category.Construction.Opposite Category.Construction.Product Category.Instance.Sets