Loogle!
Result
Found 741 declarations mentioning CategoryTheory.ComposableArrows. Of these, only the first 200 are shown.
- CategoryTheory.ComposableArrows 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) : Type (max v_1 u_1) - CategoryTheory.ComposableArrows.left 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) : C - CategoryTheory.ComposableArrows.right 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) : C - CategoryTheory.ComposableArrows.mk₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : C) : CategoryTheory.ComposableArrows C 0 - CategoryTheory.ComposableArrows.arrowEquiv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : CategoryTheory.ComposableArrows C 1 ≃ CategoryTheory.Arrow C - CategoryTheory.ComposableArrows.obj' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (i : ℕ) (hi : i ≤ n := by valid) : C - CategoryTheory.ComposableArrows.mk₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ : C} (f : X₀ ⟶ X₁) : CategoryTheory.ComposableArrows C 1 - CategoryTheory.ComposableArrows.arrow 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (i : ℕ) (hi : i < n := by valid) : CategoryTheory.ComposableArrows C 1 - CategoryTheory.ComposableArrows.δlast 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) : CategoryTheory.ComposableArrows C n - CategoryTheory.ComposableArrows.δ₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) : CategoryTheory.ComposableArrows C n - CategoryTheory.ComposableArrows.hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) : F.left ⟶ F.right - CategoryTheory.ComposableArrows.mk₀_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (F : CategoryTheory.ComposableArrows C 0) : ∃ X, F = CategoryTheory.ComposableArrows.mk₀ X - CategoryTheory.ComposableArrows.mk₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ X₂ : C} (f : X₀ ⟶ X₁) (g : X₁ ⟶ X₂) : CategoryTheory.ComposableArrows C 2 - CategoryTheory.ComposableArrows.Precomp.obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (X : C) : Fin (n + 1 + 1) → C - CategoryTheory.ComposableArrows.precomp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : CategoryTheory.ComposableArrows C (n + 1) - CategoryTheory.ComposableArrows.precomp_δ₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : (F.precomp f).δ₀ = F - CategoryTheory.ComposableArrows.mkOfObjOfMapSucc 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (obj : Fin (n + 1) → C) (mapSucc : (i : Fin n) → obj i.castSucc ⟶ obj i.succ) : CategoryTheory.ComposableArrows C n - CategoryTheory.ComposableArrows.mk₃ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ X₂ X₃ : C} (f : X₀ ⟶ X₁) (g : X₁ ⟶ X₂) (h : X₂ ⟶ X₃) : CategoryTheory.ComposableArrows C 3 - CategoryTheory.ComposableArrows.mk₁_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 1) : CategoryTheory.ComposableArrows.mk₁ X.hom = X - CategoryTheory.ComposableArrows.mk₁_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 1) : ∃ X₀ X₁ f, X = CategoryTheory.ComposableArrows.mk₁ f - CategoryTheory.ComposableArrows.mk₄ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ X₂ X₃ X₄ : C} (f : X₀ ⟶ X₁) (g : X₁ ⟶ X₂) (h : X₂ ⟶ X₃) (i : X₃ ⟶ X₄) : CategoryTheory.ComposableArrows C 4 - CategoryTheory.ComposableArrows.mk₁_comp_eqToHom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ X₁' : C} (f : X₀ ⟶ X₁) (h : X₁ = X₁') : CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.CategoryStruct.comp f (CategoryTheory.eqToHom h)) = CategoryTheory.ComposableArrows.mk₁ f - CategoryTheory.ComposableArrows.mk₁_eqToHom_comp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀' X₀ X₁ : C} (h : X₀' = X₀) (f : X₀ ⟶ X₁) : CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h) f) = CategoryTheory.ComposableArrows.mk₁ f - CategoryTheory.ComposableArrows.mk₅ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ X₂ X₃ X₄ X₅ : C} (f : X₀ ⟶ X₁) (g : X₁ ⟶ X₂) (h : X₂ ⟶ X₃) (i : X₃ ⟶ X₄) (j : X₄ ⟶ X₅) : CategoryTheory.ComposableArrows C 5 - CategoryTheory.ComposableArrows.mk₂_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 2) : ∃ X₀ X₁ X₂ f₀ f₁, X = CategoryTheory.ComposableArrows.mk₂ f₀ f₁ - CategoryTheory.ComposableArrows.precomp_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) : ∃ F₀ X₀ f₀, F = F₀.precomp f₀ - CategoryTheory.ComposableArrows.mkOfObjOfMapSucc_arrow 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (obj : Fin (n + 1) → C) (mapSucc : (i : Fin n) → obj i.castSucc ⟶ obj i.succ) (i : ℕ) (hi : i < n := by valid) : (CategoryTheory.ComposableArrows.mkOfObjOfMapSucc obj mapSucc).arrow i hi = CategoryTheory.ComposableArrows.mk₁ (mapSucc ⟨i, hi⟩) - CategoryTheory.ComposableArrows.Precomp.map_id 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (i : Fin (n + 1 + 1)) : CategoryTheory.ComposableArrows.Precomp.map F f i i ⋯ = CategoryTheory.CategoryStruct.id (CategoryTheory.ComposableArrows.Precomp.obj F X i) - CategoryTheory.ComposableArrows.Precomp.obj_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (X : C) : CategoryTheory.ComposableArrows.Precomp.obj F X 0 = X - CategoryTheory.ComposableArrows.mk₃_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 3) : ∃ X₀ X₁ X₂ X₃ f₀ f₁ f₂, X = CategoryTheory.ComposableArrows.mk₃ f₀ f₁ f₂ - CategoryTheory.ComposableArrows.arrowEquiv_symm_apply 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (f : CategoryTheory.Arrow C) : CategoryTheory.ComposableArrows.arrowEquiv.symm f = CategoryTheory.ComposableArrows.mk₁ f.hom - CategoryTheory.ComposableArrows.Precomp.obj_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (X : C) : CategoryTheory.ComposableArrows.Precomp.obj F X 1 = F.obj' 0 ⋯ - CategoryTheory.ComposableArrows.Precomp.obj_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (X : C) (i : ℕ) (hi : i + 1 < n + 1 + 1) : CategoryTheory.ComposableArrows.Precomp.obj F X ⟨i + 1, hi⟩ = F.obj' i ⋯ - CategoryTheory.ComposableArrows.arrowEquiv_apply 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (F : CategoryTheory.ComposableArrows C 1) : CategoryTheory.ComposableArrows.arrowEquiv F = CategoryTheory.Arrow.mk F.hom - CategoryTheory.ComposableArrows.app' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (φ : F ⟶ G) (i : ℕ) (hi : i ≤ n := by valid) : F.obj' i hi ⟶ G.obj' i hi - CategoryTheory.ComposableArrows.mk₄_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 4) : ∃ X₀ X₁ X₂ X₃ X₄ f₀ f₁ f₂ f₃, X = CategoryTheory.ComposableArrows.mk₄ f₀ f₁ f₂ f₃ - CategoryTheory.ComposableArrows.whiskerLeft 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (F : CategoryTheory.ComposableArrows C m) (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) : CategoryTheory.ComposableArrows C n - CategoryTheory.ComposableArrows.isoMk₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (e : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) : F ≅ G - CategoryTheory.Functor.mapComposableArrows 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (n : ℕ) : CategoryTheory.Functor (CategoryTheory.ComposableArrows C n) (CategoryTheory.ComposableArrows D n) - CategoryTheory.ComposableArrows.opEquivalence 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) : (CategoryTheory.ComposableArrows C n)ᵒᵖ ≌ CategoryTheory.ComposableArrows Cᵒᵖ n - CategoryTheory.ComposableArrows.mk₅_surjective 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (X : CategoryTheory.ComposableArrows C 5) : ∃ X₀ X₁ X₂ X₃ X₄ X₅ f₀ f₁ f₂ f₃ f₄, X = CategoryTheory.ComposableArrows.mk₅ f₀ f₁ f₂ f₃ f₄ - CategoryTheory.ComposableArrows.natAddLEFunctor 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l : ℕ} (h : k + l ≤ n) : CategoryTheory.Functor (CategoryTheory.ComposableArrows C n) (CategoryTheory.ComposableArrows C l) - CategoryTheory.ComposableArrows.Precomp.map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (i j : Fin (n + 1 + 1)) : i ≤ j → (CategoryTheory.ComposableArrows.Precomp.obj F X i ⟶ CategoryTheory.ComposableArrows.Precomp.obj F X j) - CategoryTheory.ComposableArrows.homMk₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (f : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 ⟶ G.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) : F ⟶ G - CategoryTheory.ComposableArrows.precomp_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (a✝ : Fin (n + 1 + 1)) : (F.precomp f).obj a✝ = CategoryTheory.ComposableArrows.Precomp.obj F X a✝ - CategoryTheory.ComposableArrows.ext₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (h : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 = G.obj 0) : F = G - CategoryTheory.ComposableArrows.map' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (i j : ℕ) (hij : i ≤ j := by valid) (hjn : j ≤ n := by valid) : F.obj ⟨i, ⋯⟩ ⟶ F.obj ⟨j, ⋯⟩ - CategoryTheory.ComposableArrows.δlastFunctor 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} : CategoryTheory.Functor (CategoryTheory.ComposableArrows C (n + 1)) (CategoryTheory.ComposableArrows C n) - CategoryTheory.ComposableArrows.δ₀Functor 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} : CategoryTheory.Functor (CategoryTheory.ComposableArrows C (n + 1)) (CategoryTheory.ComposableArrows C n) - CategoryTheory.ComposableArrows.natAddLEFunctor_obj' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l i : ℕ} (h : k + l ≤ n) (R : CategoryTheory.ComposableArrows C n) (x✝ : i ≤ l := by lia) : ((CategoryTheory.ComposableArrows.natAddLEFunctor h).obj R).obj' i x✝ = R.obj' (k + i) ⋯ - CategoryTheory.ComposableArrows.ext₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.left = G.left) (right : F.right = G.right) (w : F.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom left) (CategoryTheory.CategoryStruct.comp G.hom (CategoryTheory.eqToHom ⋯))) : F = G - CategoryTheory.ComposableArrows.whiskerLeftFunctor 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) : CategoryTheory.Functor (CategoryTheory.ComposableArrows C m) (CategoryTheory.ComposableArrows C n) - CategoryTheory.ComposableArrows.map'_eq_hom₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (F : CategoryTheory.ComposableArrows C 1) : F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5 = F.hom - CategoryTheory.ComposableArrows.map'_self 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (i : ℕ) (hi : i ≤ n := by valid) : F.map' i i ⋯ hi = CategoryTheory.CategoryStruct.id (F.obj ⟨i, ⋯⟩) - CategoryTheory.ComposableArrows.Precomp.map_zero_one' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : CategoryTheory.ComposableArrows.Precomp.map F f 0 ⟨0 + 1, ⋯⟩ ⋯ = f - CategoryTheory.Functor.mapComposableArrowsObjMk₁Iso 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y : C} (f : X ⟶ Y) : (G.mapComposableArrows 1).obj (CategoryTheory.ComposableArrows.mk₁ f) ≅ CategoryTheory.ComposableArrows.mk₁ (G.map f) - CategoryTheory.ComposableArrows.Precomp.map_succ_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (i j : ℕ) (hi : i + 1 < n + 1 + 1) (hj : j + 1 < n + 1 + 1) (hij : i + 1 ≤ j + 1) : CategoryTheory.ComposableArrows.Precomp.map F f ⟨i + 1, hi⟩ ⟨j + 1, hj⟩ hij = F.map' i j ⋯ ⋯ - CategoryTheory.Functor.mapComposableArrowsObjMk₂Iso 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) : (G.mapComposableArrows 2).obj (CategoryTheory.ComposableArrows.mk₂ f g) ≅ CategoryTheory.ComposableArrows.mk₂ (G.map f) (G.map g) - CategoryTheory.ComposableArrows.Precomp.map_one_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (j : ℕ) (hj : j + 1 < n + 1 + 1) : CategoryTheory.ComposableArrows.Precomp.map F f 1 ⟨j + 1, hj⟩ ⋯ = F.map' 0 j ⋯ ⋯ - CategoryTheory.Functor.mapComposableArrows_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (n : ℕ) (F : CategoryTheory.Functor (Fin (n + 1)) C) (X : Fin (n + 1)) : ((G.mapComposableArrows n).obj F).obj X = G.obj (F.obj X) - CategoryTheory.ComposableArrows.Precomp.map_comp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) {i j k : Fin (n + 1 + 1)} (hij : i ≤ j) (hjk : j ≤ k) : CategoryTheory.ComposableArrows.Precomp.map F f i k ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.Precomp.map F f i j hij) (CategoryTheory.ComposableArrows.Precomp.map F f j k hjk) - CategoryTheory.ComposableArrows.Precomp.map_zero_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : CategoryTheory.ComposableArrows.Precomp.map F f 0 1 ⋯ = f - CategoryTheory.ComposableArrows.Precomp.map_zero_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : CategoryTheory.ComposableArrows.Precomp.map F f 0 0 ⋯ = CategoryTheory.CategoryStruct.id X - CategoryTheory.ComposableArrows.precomp_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) {X✝ Y✝ : Fin (n + 1 + 1)} (g : X✝ ⟶ Y✝) : (F.precomp f).map g = CategoryTheory.ComposableArrows.Precomp.map F f X✝ Y✝ ⋯ - CategoryTheory.ComposableArrows.whiskerLeft_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (F : CategoryTheory.ComposableArrows C m) (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) (X : Fin (n + 1)) : (F.whiskerLeft Φ).obj X = F.obj (Φ.obj X) - CategoryTheory.ComposableArrows.hom_ext₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} {φ φ' : F ⟶ G} (h : CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 = CategoryTheory.ComposableArrows.app' φ' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) : φ = φ' - CategoryTheory.ComposableArrows.hom_ext₀_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} {φ φ' : F ⟶ G} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 = CategoryTheory.ComposableArrows.app' φ' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 - CategoryTheory.ComposableArrows.δlastFunctor_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) (X : Fin (n + 1)) : (CategoryTheory.ComposableArrows.δlastFunctor.obj F).obj X = F.obj X.castSucc - CategoryTheory.ComposableArrows.δ₀Functor_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) (X : Fin (n + 1)) : (CategoryTheory.ComposableArrows.δ₀Functor.obj F).obj X = F.obj X.succ - CategoryTheory.ComposableArrows.natAddLEFunctor_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l : ℕ} (h : k + l ≤ n) (F : CategoryTheory.ComposableArrows C n) (X : Fin (l + 1)) : ((CategoryTheory.ComposableArrows.natAddLEFunctor h).obj F).obj X = F.obj ((Fin.natAddLEFunctor h).obj X) - CategoryTheory.ComposableArrows.hom_ext₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} {φ φ' : F ⟶ G} (h₀ : CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 = CategoryTheory.ComposableArrows.app' φ' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (h₁ : CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 = CategoryTheory.ComposableArrows.app' φ' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) : φ = φ' - CategoryTheory.ComposableArrows.Precomp.map_zero_succ_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) (j : ℕ) (hj : j + 2 < n + 1 + 1) : CategoryTheory.ComposableArrows.Precomp.map F f 0 ⟨j + 2, hj⟩ ⋯ = CategoryTheory.CategoryStruct.comp f (F.map' 0 (j + 1) ⋯ ⋯) - CategoryTheory.ComposableArrows.hom_ext₁_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} {φ φ' : F ⟶ G} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 = CategoryTheory.ComposableArrows.app' φ' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ∧ CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 = CategoryTheory.ComposableArrows.app' φ' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 - CategoryTheory.ComposableArrows.map'_comp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) (i j k : ℕ) (hij : i ≤ j := by valid) (hjk : j ≤ k := by valid) (hk : k ≤ n := by valid) : F.map' i k ⋯ hk = CategoryTheory.CategoryStruct.comp (F.map' i j hij ⋯) (F.map' j k hjk hk) - CategoryTheory.ComposableArrows.whiskerLeftFunctor_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) (F : CategoryTheory.ComposableArrows C m) (X : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.whiskerLeftFunctor Φ).obj F).obj X = F.obj (Φ.obj X) - CategoryTheory.ComposableArrows.naturality' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (φ : F ⟶ G) (i j : ℕ) (hij : i ≤ j := by valid) (hj : j ≤ n := by valid) : CategoryTheory.CategoryStruct.comp (F.map' i j hij hj) (CategoryTheory.ComposableArrows.app' φ j hj) = CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.app' φ i ⋯) (G.map' i j hij hj) - CategoryTheory.ComposableArrows.homMk₀_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (f : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 ⟶ G.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) (i : Fin (0 + 1)) : (CategoryTheory.ComposableArrows.homMk₀ f).app i = match i with | ⟨0, isLt⟩ => f - CategoryTheory.ComposableArrows.hom_ext₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} {φ φ' : f ⟶ g} (h₀ : CategoryTheory.ComposableArrows.app' φ 0 _proof_244✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_244✝) (h₁ : CategoryTheory.ComposableArrows.app' φ 1 _proof_245✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_245✝) (h₂ : CategoryTheory.ComposableArrows.app' φ 2 _proof_246✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_246✝) : φ = φ' - CategoryTheory.ComposableArrows.hom_ext₂_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} {φ φ' : f ⟶ g} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 _proof_244✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_244✝ ∧ CategoryTheory.ComposableArrows.app' φ 1 _proof_245✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_245✝ ∧ CategoryTheory.ComposableArrows.app' φ 2 _proof_246✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_246✝ - CategoryTheory.ComposableArrows.isIso_iff₀ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (f : F ⟶ G) : CategoryTheory.IsIso f ↔ CategoryTheory.IsIso (f.app 0) - CategoryTheory.ComposableArrows.hom_ext₃ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} {φ φ' : f ⟶ g} (h₀ : CategoryTheory.ComposableArrows.app' φ 0 _proof_296✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_296✝) (h₁ : CategoryTheory.ComposableArrows.app' φ 1 _proof_297✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_297✝) (h₂ : CategoryTheory.ComposableArrows.app' φ 2 _proof_298✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_298✝) (h₃ : CategoryTheory.ComposableArrows.app' φ 3 _proof_299✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_299✝) : φ = φ' - CategoryTheory.ComposableArrows.hom_ext₃_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} {φ φ' : f ⟶ g} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 _proof_296✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_296✝ ∧ CategoryTheory.ComposableArrows.app' φ 1 _proof_297✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_297✝ ∧ CategoryTheory.ComposableArrows.app' φ 2 _proof_298✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_298✝ ∧ CategoryTheory.ComposableArrows.app' φ 3 _proof_299✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_299✝ - CategoryTheory.ComposableArrows.naturality'_assoc 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (φ : F ⟶ G) (i j : ℕ) (hij : i ≤ j := by valid) (hj : j ≤ n := by valid) {Z : C} (h : G.obj' j hj ⟶ Z) : CategoryTheory.CategoryStruct.comp (F.map' i j hij hj) (CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.app' φ j hj) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.app' φ i ⋯) (CategoryTheory.CategoryStruct.comp (G.map' i j hij hj) h) - CategoryTheory.ComposableArrows.opEquivalence_functor_obj_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : (CategoryTheory.Functor (Fin (n + 1)) C)ᵒᵖ) (X✝ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).functor.obj X).obj X✝ = Opposite.op ((Opposite.unop X).obj X✝.rev) - CategoryTheory.ComposableArrows.hom_ext₄ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} {φ φ' : f ⟶ g} (h₀ : CategoryTheory.ComposableArrows.app' φ 0 _proof_360✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_360✝) (h₁ : CategoryTheory.ComposableArrows.app' φ 1 _proof_361✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_361✝) (h₂ : CategoryTheory.ComposableArrows.app' φ 2 _proof_362✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_362✝) (h₃ : CategoryTheory.ComposableArrows.app' φ 3 _proof_363✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_363✝) (h₄ : CategoryTheory.ComposableArrows.app' φ 4 _proof_364✝ = CategoryTheory.ComposableArrows.app' φ' 4 _proof_364✝) : φ = φ' - CategoryTheory.ComposableArrows.hom_ext₄_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} {φ φ' : f ⟶ g} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 _proof_360✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_360✝ ∧ CategoryTheory.ComposableArrows.app' φ 1 _proof_361✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_361✝ ∧ CategoryTheory.ComposableArrows.app' φ 2 _proof_362✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_362✝ ∧ CategoryTheory.ComposableArrows.app' φ 3 _proof_363✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_363✝ ∧ CategoryTheory.ComposableArrows.app' φ 4 _proof_364✝ = CategoryTheory.ComposableArrows.app' φ' 4 _proof_364✝ - CategoryTheory.ComposableArrows.Precomp.map_one_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) : CategoryTheory.ComposableArrows.Precomp.map F f 1 1 ⋯ = F.map (CategoryTheory.CategoryStruct.id ⟨0, ⋯⟩) - CategoryTheory.Functor.mapComposableArrows_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (n : ℕ) (F : CategoryTheory.Functor (Fin (n + 1)) C) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : ((G.mapComposableArrows n).obj F).map f = G.map (F.map f) - CategoryTheory.ComposableArrows.hom_ext₅ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} {φ φ' : f ⟶ g} (h₀ : CategoryTheory.ComposableArrows.app' φ 0 _proof_448✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_448✝) (h₁ : CategoryTheory.ComposableArrows.app' φ 1 _proof_449✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_449✝) (h₂ : CategoryTheory.ComposableArrows.app' φ 2 _proof_450✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_450✝) (h₃ : CategoryTheory.ComposableArrows.app' φ 3 _proof_451✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_451✝) (h₄ : CategoryTheory.ComposableArrows.app' φ 4 _proof_452✝ = CategoryTheory.ComposableArrows.app' φ' 4 _proof_452✝) (h₅ : CategoryTheory.ComposableArrows.app' φ 5 _proof_453✝ = CategoryTheory.ComposableArrows.app' φ' 5 _proof_453✝) : φ = φ' - CategoryTheory.ComposableArrows.hom_ext₅_iff 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} {φ φ' : f ⟶ g} : φ = φ' ↔ CategoryTheory.ComposableArrows.app' φ 0 _proof_448✝ = CategoryTheory.ComposableArrows.app' φ' 0 _proof_448✝ ∧ CategoryTheory.ComposableArrows.app' φ 1 _proof_449✝ = CategoryTheory.ComposableArrows.app' φ' 1 _proof_449✝ ∧ CategoryTheory.ComposableArrows.app' φ 2 _proof_450✝ = CategoryTheory.ComposableArrows.app' φ' 2 _proof_450✝ ∧ CategoryTheory.ComposableArrows.app' φ 3 _proof_451✝ = CategoryTheory.ComposableArrows.app' φ' 3 _proof_451✝ ∧ CategoryTheory.ComposableArrows.app' φ 4 _proof_452✝ = CategoryTheory.ComposableArrows.app' φ' 4 _proof_452✝ ∧ CategoryTheory.ComposableArrows.app' φ 5 _proof_453✝ = CategoryTheory.ComposableArrows.app' φ' 5 _proof_453✝ - CategoryTheory.ComposableArrows.homMk₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⟶ G.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (right : F.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 ⟶ G.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) right = CategoryTheory.CategoryStruct.comp left (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) := by cat_disch) : F ⟶ G - CategoryTheory.ComposableArrows.isoMk₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (right : F.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 ≅ G.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) right.hom = CategoryTheory.CategoryStruct.comp left.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) := by cat_disch) : F ≅ G - CategoryTheory.ComposableArrows.natAddLEFunctor_app' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l i : ℕ} (h : k + l ≤ n) {R₁ R₂ : CategoryTheory.ComposableArrows C n} (φ : R₁ ⟶ R₂) (x✝ : i ≤ l := by lia) : CategoryTheory.ComposableArrows.app' ((CategoryTheory.ComposableArrows.natAddLEFunctor h).map φ) i x✝ = CategoryTheory.ComposableArrows.app' φ (k + i) ⋯ - CategoryTheory.ComposableArrows.isoMk₀_hom_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (e : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) (i : Fin (0 + 1)) : (CategoryTheory.ComposableArrows.isoMk₀ e).hom.app i = match i with | ⟨0, isLt⟩ => e.hom - CategoryTheory.ComposableArrows.isoMk₀_inv_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 0} (e : F.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₀._proof_1) (i : Fin (0 + 1)) : (CategoryTheory.ComposableArrows.isoMk₀ e).inv.app i = match i with | ⟨0, isLt⟩ => e.inv - CategoryTheory.ComposableArrows.isIso_iff₁ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (f : F ⟶ G) : CategoryTheory.IsIso f ↔ CategoryTheory.IsIso (f.app 0) ∧ CategoryTheory.IsIso (f.app 1) - CategoryTheory.ComposableArrows.ext₂_of_arrow 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (h₀₁ : CategoryTheory.Arrow.mk (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) = CategoryTheory.Arrow.mk (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝)) (h₁₂ : CategoryTheory.Arrow.mk (f.map' 1 2 _proof_245✝ _proof_246✝) = CategoryTheory.Arrow.mk (g.map' 1 2 _proof_245✝ _proof_246✝)) : f = g - CategoryTheory.ComposableArrows.mkOfObjOfMapSucc_exists 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (obj : Fin (n + 1) → C) (mapSucc : (i : Fin n) → obj i.castSucc ⟶ obj i.succ) : ∃ F e, ∀ (i : ℕ) (hi : i < n), mapSucc ⟨i, hi⟩ = CategoryTheory.CategoryStruct.comp (e ⟨i, ⋯⟩).inv (CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (e ⟨i + 1, ⋯⟩).hom) - CategoryTheory.Functor.mapComposableArrows_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (n : ℕ) {X✝ Y✝ : CategoryTheory.Functor (Fin (n + 1)) C} (α : X✝ ⟶ Y✝) (X : Fin (n + 1)) : ((G.mapComposableArrows n).map α).app X = G.map (α.app X) - CategoryTheory.ComposableArrows.whiskerLeft_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (F : CategoryTheory.ComposableArrows C m) (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : (F.whiskerLeft Φ).map f = F.map (Φ.map f) - CategoryTheory.ComposableArrows.δlastFunctor_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : (CategoryTheory.ComposableArrows.δlastFunctor.obj F).map f = F.map f - CategoryTheory.ComposableArrows.natAddLEFunctor_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l : ℕ} (h : k + l ≤ n) {X✝ Y✝ : CategoryTheory.ComposableArrows C n} (f : X✝ ⟶ Y✝) (X : Fin (l + 1)) : ((CategoryTheory.ComposableArrows.natAddLEFunctor h).map f).app X = f.app ((Fin.natAddLEFunctor h).obj X) - CategoryTheory.ComposableArrows.natAddLEFunctor_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n k l : ℕ} (h : k + l ≤ n) (F : CategoryTheory.ComposableArrows C n) {X✝ Y✝ : Fin (l + 1)} (f : X✝ ⟶ Y✝) : ((CategoryTheory.ComposableArrows.natAddLEFunctor h).obj F).map f = F.map ((Fin.natAddLEFunctor h).map f) - CategoryTheory.ComposableArrows.homMkSucc 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ⟶ G.obj' 0 ⋯) (β : F.δ₀ ⟶ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β 0 ⋯) = CategoryTheory.CategoryStruct.comp α (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯)) : F ⟶ G - CategoryTheory.ComposableArrows.homMk₁_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⟶ G.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (right : F.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 ⟶ G.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) right = CategoryTheory.CategoryStruct.comp left (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) := by cat_disch) (i : Fin (1 + 1)) : (CategoryTheory.ComposableArrows.homMk₁ left right w).app i = match i with | ⟨0, isLt⟩ => left | ⟨1, isLt⟩ => right - CategoryTheory.ComposableArrows.homMk 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (app : (i : Fin (n + 1)) → F.obj i ⟶ G.obj i) (w : ∀ (i : ℕ) (hi : i < n), CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (app ⟨i + 1, ⋯⟩) = CategoryTheory.CategoryStruct.comp (app ⟨i, ⋯⟩) (G.map' i (i + 1) ⋯ hi)) : F ⟶ G - CategoryTheory.Functor.mapComposableArrowsObjMk₁Iso_hom_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y : C} (f : X ⟶ Y) (i : Fin (1 + 1)) : (G.mapComposableArrowsObjMk₁Iso f).hom.app i = match i with | ⟨0, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj X) | ⟨1, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj Y) - CategoryTheory.Functor.mapComposableArrowsObjMk₁Iso_inv_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y : C} (f : X ⟶ Y) (i : Fin (1 + 1)) : (G.mapComposableArrowsObjMk₁Iso f).inv.app i = match i with | ⟨0, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj X) | ⟨1, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj Y) - CategoryTheory.ComposableArrows.whiskerLeftFunctor_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) {X✝ Y✝ : CategoryTheory.ComposableArrows C m} (f : X✝ ⟶ Y✝) (X : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.whiskerLeftFunctor Φ).map f).app X = f.app (Φ.obj X) - CategoryTheory.ComposableArrows.whiskerLeftFunctor_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (Φ : CategoryTheory.Functor (Fin (n + 1)) (Fin (m + 1))) (F : CategoryTheory.ComposableArrows C m) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : ((CategoryTheory.ComposableArrows.whiskerLeftFunctor Φ).obj F).map f = F.map (Φ.map f) - CategoryTheory.ComposableArrows.δ₀Functor_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C (n + 1)) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : (CategoryTheory.ComposableArrows.δ₀Functor.obj F).map f = F.map (CategoryTheory.homOfLE ⋯) - CategoryTheory.ComposableArrows.isoMkSucc 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ≅ G.obj' 0 ⋯) (β : F.δ₀ ≅ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β.hom 0 ⋯) = CategoryTheory.CategoryStruct.comp α.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯)) : F ≅ G - CategoryTheory.ComposableArrows.map'_inv_eq_inv_map' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n m : ℕ} (h : n + 1 ≤ m) {f g : CategoryTheory.ComposableArrows C m} (app : f.obj' n ⋯ ≅ g.obj' n ⋯) (app' : f.obj' (n + 1) h ≅ g.obj' (n + 1) h) (w : CategoryTheory.CategoryStruct.comp (f.map' n (n + 1) ⋯ h) app'.hom = CategoryTheory.CategoryStruct.comp app.hom (g.map' n (n + 1) ⋯ h)) : CategoryTheory.CategoryStruct.comp (g.map' n (n + 1) ⋯ h) app'.inv = CategoryTheory.CategoryStruct.comp app.inv (f.map' n (n + 1) ⋯ h) - CategoryTheory.ComposableArrows.homMk_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (app : (i : Fin (n + 1)) → F.obj i ⟶ G.obj i) (w : ∀ (i : ℕ) (hi : i < n), CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (app ⟨i + 1, ⋯⟩) = CategoryTheory.CategoryStruct.comp (app ⟨i, ⋯⟩) (G.map' i (i + 1) ⋯ hi)) (i : Fin (n + 1)) : (CategoryTheory.ComposableArrows.homMk app w).app i = app i - CategoryTheory.ComposableArrows.homMk₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ⟶ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ⟶ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ⟶ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : f ⟶ g - CategoryTheory.ComposableArrows.isIso_iff₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 2} (f : F ⟶ G) : CategoryTheory.IsIso f ↔ CategoryTheory.IsIso (f.app 0) ∧ CategoryTheory.IsIso (f.app 1) ∧ CategoryTheory.IsIso (f.app 2) - CategoryTheory.ComposableArrows.ext_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (h₀ : F.obj' 0 ⋯ = G.obj' 0 ⋯) (h : F.δ₀ = G.δ₀) (w : F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₀) (CategoryTheory.CategoryStruct.comp (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.eqToHom ⋯))) : F = G - CategoryTheory.Functor.mapComposableArrowsOpIso 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) (n : ℕ) : (G.mapComposableArrows n).comp (CategoryTheory.ComposableArrows.opEquivalence D n).functor.rightOp ≅ (CategoryTheory.ComposableArrows.opEquivalence C n).functor.rightOp.comp (G.op.mapComposableArrows n).op - CategoryTheory.ComposableArrows.ext₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (h₀ : f.obj' 0 _proof_244✝ = g.obj' 0 _proof_244✝) (h₁ : f.obj' 1 _proof_245✝ = g.obj' 1 _proof_245✝) (h₂ : f.obj' 2 _proof_246✝ = g.obj' 2 _proof_246✝) (w₀ : f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₀) (CategoryTheory.CategoryStruct.comp (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) (CategoryTheory.eqToHom ⋯))) (w₁ : f.map' 1 2 _proof_245✝ _proof_246✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₁) (CategoryTheory.CategoryStruct.comp (g.map' 1 2 _proof_245✝ _proof_246✝) (CategoryTheory.eqToHom ⋯))) : f = g - CategoryTheory.ComposableArrows.hom_ext_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} {f g : F ⟶ G} (h₀ : CategoryTheory.ComposableArrows.app' f 0 ⋯ = CategoryTheory.ComposableArrows.app' g 0 ⋯) (h₁ : CategoryTheory.ComposableArrows.δ₀Functor.map f = CategoryTheory.ComposableArrows.δ₀Functor.map g) : f = g - CategoryTheory.ComposableArrows.isoMk₂ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ≅ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ≅ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ≅ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : f ≅ g - CategoryTheory.ComposableArrows.homMkSucc_app_succ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ⟶ G.obj' 0 ⋯) (β : F.δ₀ ⟶ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β 0 ⋯) = CategoryTheory.CategoryStruct.comp α (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) := by cat_disch) (i : ℕ) (hi : i + 1 < n + 1 + 1) : (CategoryTheory.ComposableArrows.homMkSucc α β w).app ⟨i + 1, hi⟩ = CategoryTheory.ComposableArrows.app' β i ⋯ - CategoryTheory.ComposableArrows.δlastFunctor_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {X✝ Y✝ : CategoryTheory.ComposableArrows C (n + 1)} (f : X✝ ⟶ Y✝) (X : Fin (n + 1)) : (CategoryTheory.ComposableArrows.δlastFunctor.map f).app X = f.app X.castSucc - CategoryTheory.ComposableArrows.δ₀Functor_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {X✝ Y✝ : CategoryTheory.ComposableArrows C (n + 1)} (f : X✝ ⟶ Y✝) (X : Fin (n + 1)) : (CategoryTheory.ComposableArrows.δ₀Functor.map f).app X = f.app X.succ - CategoryTheory.ComposableArrows.isoMkSucc_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ≅ G.obj' 0 ⋯) (β : F.δ₀ ≅ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β.hom 0 ⋯) = CategoryTheory.CategoryStruct.comp α.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯)) : (CategoryTheory.ComposableArrows.isoMkSucc α β w).hom = CategoryTheory.ComposableArrows.homMkSucc α.hom β.hom w - CategoryTheory.ComposableArrows.isoMkSucc_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ≅ G.obj' 0 ⋯) (β : F.δ₀ ≅ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β.hom 0 ⋯) = CategoryTheory.CategoryStruct.comp α.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯)) : (CategoryTheory.ComposableArrows.isoMkSucc α β w).inv = CategoryTheory.ComposableArrows.homMkSucc α.inv β.inv ⋯ - CategoryTheory.ComposableArrows.isoMk 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (app : (i : Fin (n + 1)) → F.obj i ≅ G.obj i) (w : ∀ (i : ℕ) (hi : i < n), CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (app ⟨i + 1, ⋯⟩).hom = CategoryTheory.CategoryStruct.comp (app ⟨i, ⋯⟩).hom (G.map' i (i + 1) ⋯ hi)) : F ≅ G - CategoryTheory.ComposableArrows.homMkSucc_app_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C (n + 1)} (α : F.obj' 0 ⋯ ⟶ G.obj' 0 ⋯) (β : F.δ₀ ⟶ G.δ₀) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) (CategoryTheory.ComposableArrows.app' β 0 ⋯) = CategoryTheory.CategoryStruct.comp α (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 ⋯) := by cat_disch) : (CategoryTheory.ComposableArrows.homMkSucc α β w).app 0 = α - CategoryTheory.ComposableArrows.homMk₂_app_two' 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ⟶ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ⟶ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ⟶ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₂ app₀ app₁ app₂ w₀ w₁).app ⟨2, CategoryTheory.ComposableArrows.homMk₂._proof_3⟩ = app₂ - CategoryTheory.ComposableArrows.homMk₂_app_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ⟶ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ⟶ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ⟶ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₂ app₀ app₁ app₂ w₀ w₁).app 1 = app₁ - CategoryTheory.ComposableArrows.homMk₂_app_two 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ⟶ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ⟶ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ⟶ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₂ app₀ app₁ app₂ w₀ w₁).app 2 = app₂ - CategoryTheory.ComposableArrows.homMk₂_app_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ⟶ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ⟶ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ⟶ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₂ app₀ app₁ app₂ w₀ w₁).app 0 = app₀ - CategoryTheory.ComposableArrows.isoMk₂_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ≅ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ≅ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ≅ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.isoMk₂ app₀ app₁ app₂ w₀ w₁).hom = CategoryTheory.ComposableArrows.homMk₂ app₀.hom app₁.hom app₂.hom w₀ w₁ - CategoryTheory.ComposableArrows.ext 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (h : ∀ (i : Fin (n + 1)), F.obj i = G.obj i) (w : ∀ (i : ℕ) (hi : i < n), F.map' i (i + 1) ⋯ hi = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (CategoryTheory.CategoryStruct.comp (G.map' i (i + 1) ⋯ hi) (CategoryTheory.eqToHom ⋯))) : F = G - CategoryTheory.ComposableArrows.isoMk₂_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 2} (app₀ : f.obj' 0 _proof_244✝ ≅ g.obj' 0 _proof_244✝) (app₁ : f.obj' 1 _proof_245✝ ≅ g.obj' 1 _proof_245✝) (app₂ : f.obj' 2 _proof_246✝ ≅ g.obj' 2 _proof_246✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_245✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_246✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_246✝) := by cat_disch) : (CategoryTheory.ComposableArrows.isoMk₂ app₀ app₁ app₂ w₀ w₁).inv = CategoryTheory.ComposableArrows.homMk₂ app₀.inv app₁.inv app₂.inv ⋯ ⋯ - CategoryTheory.ComposableArrows.opEquivalence_inverse_obj 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : CategoryTheory.ComposableArrows Cᵒᵖ n) : (CategoryTheory.ComposableArrows.opEquivalence C n).inverse.obj X = Opposite.op ((⋯.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).comp (CategoryTheory.Functor.leftOp X)) - CategoryTheory.ComposableArrows.isoMk_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (app : (i : Fin (n + 1)) → F.obj i ≅ G.obj i) (w : ∀ (i : ℕ) (hi : i < n), CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (app ⟨i + 1, ⋯⟩).hom = CategoryTheory.CategoryStruct.comp (app ⟨i, ⋯⟩).hom (G.map' i (i + 1) ⋯ hi)) : (CategoryTheory.ComposableArrows.isoMk app w).hom = CategoryTheory.ComposableArrows.homMk (fun i => (app i).hom) w - CategoryTheory.ComposableArrows.isoMk_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} {F G : CategoryTheory.ComposableArrows C n} (app : (i : Fin (n + 1)) → F.obj i ≅ G.obj i) (w : ∀ (i : ℕ) (hi : i < n), CategoryTheory.CategoryStruct.comp (F.map' i (i + 1) ⋯ hi) (app ⟨i + 1, ⋯⟩).hom = CategoryTheory.CategoryStruct.comp (app ⟨i, ⋯⟩).hom (G.map' i (i + 1) ⋯ hi)) : (CategoryTheory.ComposableArrows.isoMk app w).inv = CategoryTheory.ComposableArrows.homMk (fun i => (app i).inv) ⋯ - CategoryTheory.ComposableArrows.isoMk₁_hom_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (right : F.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 ≅ G.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) right.hom = CategoryTheory.CategoryStruct.comp left.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) := by cat_disch) (i : Fin (1 + 1)) : (CategoryTheory.ComposableArrows.isoMk₁ left right w).hom.app i = match i with | ⟨0, isLt⟩ => left.hom | ⟨1, isLt⟩ => right.hom - CategoryTheory.ComposableArrows.isoMk₁_inv_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {F G : CategoryTheory.ComposableArrows C 1} (left : F.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4 ≅ G.obj' 0 CategoryTheory.ComposableArrows.homMk₁._proof_4) (right : F.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5 ≅ G.obj' 1 CategoryTheory.ComposableArrows.homMk₁._proof_5) (w : CategoryTheory.CategoryStruct.comp (F.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) right.hom = CategoryTheory.CategoryStruct.comp left.hom (G.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 CategoryTheory.ComposableArrows.homMk₁._proof_5) := by cat_disch) (i : Fin (1 + 1)) : (CategoryTheory.ComposableArrows.isoMk₁ left right w).inv.app i = match i with | ⟨0, isLt⟩ => left.inv | ⟨1, isLt⟩ => right.inv - CategoryTheory.Functor.mapComposableArrowsObjMk₂Iso_hom_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) (i : Fin (1 + 1 + 1)) : (G.mapComposableArrowsObjMk₂Iso f g).hom.app i = match i with | ⟨0, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj X) | ⟨i.succ, hi⟩ => (CategoryTheory.ComposableArrows.homMk₁ (CategoryTheory.CategoryStruct.id (G.obj Y)) (CategoryTheory.CategoryStruct.id (G.obj Z)) ⋯).app ⟨i, ⋯⟩ - CategoryTheory.ComposableArrows.homMk₃ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ⟶ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ⟶ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ⟶ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ⟶ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_298✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_299✝) := by cat_disch) : f ⟶ g - CategoryTheory.ComposableArrows.isoMk₃ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ≅ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ≅ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ≅ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ≅ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_298✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_299✝)) : f ≅ g - CategoryTheory.ComposableArrows.ext₃ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (h₀ : f.obj' 0 _proof_296✝ = g.obj' 0 _proof_296✝) (h₁ : f.obj' 1 _proof_297✝ = g.obj' 1 _proof_297✝) (h₂ : f.obj' 2 _proof_298✝ = g.obj' 2 _proof_298✝) (h₃ : f.obj' 3 _proof_299✝ = g.obj' 3 _proof_299✝) (w₀ : f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₀) (CategoryTheory.CategoryStruct.comp (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) (CategoryTheory.eqToHom ⋯))) (w₁ : f.map' 1 2 _proof_245✝ _proof_298✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₁) (CategoryTheory.CategoryStruct.comp (g.map' 1 2 _proof_245✝ _proof_298✝) (CategoryTheory.eqToHom ⋯))) (w₂ : f.map' 2 3 _proof_298✝ _proof_299✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₂) (CategoryTheory.CategoryStruct.comp (g.map' 2 3 _proof_298✝ _proof_299✝) (CategoryTheory.eqToHom ⋯))) : f = g - CategoryTheory.ComposableArrows.homMk₃_app_three 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ⟶ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ⟶ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ⟶ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ⟶ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_298✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_299✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).app ⟨3, CategoryTheory.ComposableArrows.homMk₃._proof_4⟩ = app₃ - CategoryTheory.ComposableArrows.homMk₃_app_two 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ⟶ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ⟶ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ⟶ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ⟶ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_298✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_299✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).app ⟨2, CategoryTheory.ComposableArrows.homMk₃._proof_3⟩ = app₂ - CategoryTheory.ComposableArrows.homMk₃_app_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ⟶ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ⟶ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ⟶ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ⟶ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_298✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_299✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).app 1 = app₁ - CategoryTheory.ComposableArrows.homMk₃_app_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ⟶ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ⟶ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ⟶ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ⟶ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_298✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_299✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).app 0 = app₀ - CategoryTheory.ComposableArrows.isoMk₃_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ≅ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ≅ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ≅ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ≅ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_298✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_299✝)) : (CategoryTheory.ComposableArrows.isoMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).hom = CategoryTheory.ComposableArrows.homMk₃ app₀.hom app₁.hom app₂.hom app₃.hom w₀ w₁ w₂ - CategoryTheory.ComposableArrows.isoMk₃_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 3} (app₀ : f.obj' 0 _proof_296✝ ≅ g.obj' 0 _proof_296✝) (app₁ : f.obj' 1 _proof_297✝ ≅ g.obj' 1 _proof_297✝) (app₂ : f.obj' 2 _proof_298✝ ≅ g.obj' 2 _proof_298✝) (app₃ : f.obj' 3 _proof_299✝ ≅ g.obj' 3 _proof_299✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_297✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_298✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_298✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_299✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_299✝)) : (CategoryTheory.ComposableArrows.isoMk₃ app₀ app₁ app₂ app₃ w₀ w₁ w₂).inv = CategoryTheory.ComposableArrows.homMk₃ app₀.inv app₁.inv app₂.inv app₃.inv ⋯ ⋯ ⋯ - CategoryTheory.Functor.mapComposableArrowsObjMk₂Iso_inv_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (G : CategoryTheory.Functor C D) {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) (i : Fin (1 + 1 + 1)) : (G.mapComposableArrowsObjMk₂Iso f g).inv.app i = match i with | ⟨0, isLt⟩ => CategoryTheory.CategoryStruct.id (G.obj X) | ⟨i.succ, hi⟩ => (CategoryTheory.ComposableArrows.homMk₁ (CategoryTheory.CategoryStruct.id (G.obj Y)) (CategoryTheory.CategoryStruct.id (G.obj Z)) ⋯).app ⟨i, ⋯⟩ - CategoryTheory.ComposableArrows.homMk₄ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : f ⟶ g - CategoryTheory.ComposableArrows.isoMk₄ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ≅ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ≅ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ≅ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ≅ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ≅ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_362✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_363✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_364✝)) : f ≅ g - CategoryTheory.ComposableArrows.homMk₄_app_four 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).app ⟨4, CategoryTheory.ComposableArrows.homMk₄._proof_5⟩ = app₄ - CategoryTheory.ComposableArrows.homMk₄_app_three 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).app ⟨3, CategoryTheory.ComposableArrows.homMk₄._proof_4⟩ = app₃ - CategoryTheory.ComposableArrows.homMk₄_app_two 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).app ⟨2, CategoryTheory.ComposableArrows.homMk₄._proof_3⟩ = app₂ - CategoryTheory.ComposableArrows.ext₄ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (h₀ : f.obj' 0 _proof_360✝ = g.obj' 0 _proof_360✝) (h₁ : f.obj' 1 _proof_361✝ = g.obj' 1 _proof_361✝) (h₂ : f.obj' 2 _proof_362✝ = g.obj' 2 _proof_362✝) (h₃ : f.obj' 3 _proof_363✝ = g.obj' 3 _proof_363✝) (h₄ : f.obj' 4 _proof_364✝ = g.obj' 4 _proof_364✝) (w₀ : f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₀) (CategoryTheory.CategoryStruct.comp (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) (CategoryTheory.eqToHom ⋯))) (w₁ : f.map' 1 2 _proof_245✝ _proof_362✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₁) (CategoryTheory.CategoryStruct.comp (g.map' 1 2 _proof_245✝ _proof_362✝) (CategoryTheory.eqToHom ⋯))) (w₂ : f.map' 2 3 _proof_298✝ _proof_363✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₂) (CategoryTheory.CategoryStruct.comp (g.map' 2 3 _proof_298✝ _proof_363✝) (CategoryTheory.eqToHom ⋯))) (w₃ : f.map' 3 4 _proof_363✝ _proof_364✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₃) (CategoryTheory.CategoryStruct.comp (g.map' 3 4 _proof_363✝ _proof_364✝) (CategoryTheory.eqToHom ⋯))) : f = g - CategoryTheory.ComposableArrows.homMk₄_app_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).app 1 = app₁ - CategoryTheory.ComposableArrows.homMk₄_app_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ⟶ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ⟶ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ⟶ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ⟶ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ⟶ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_362✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_363✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_364✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).app 0 = app₀ - CategoryTheory.ComposableArrows.isoMk₄_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ≅ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ≅ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ≅ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ≅ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ≅ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_362✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_363✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_364✝)) : (CategoryTheory.ComposableArrows.isoMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).hom = CategoryTheory.ComposableArrows.homMk₄ app₀.hom app₁.hom app₂.hom app₃.hom app₄.hom w₀ w₁ w₂ w₃ - CategoryTheory.ComposableArrows.isoMk₄_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 4} (app₀ : f.obj' 0 _proof_360✝ ≅ g.obj' 0 _proof_360✝) (app₁ : f.obj' 1 _proof_361✝ ≅ g.obj' 1 _proof_361✝) (app₂ : f.obj' 2 _proof_362✝ ≅ g.obj' 2 _proof_362✝) (app₃ : f.obj' 3 _proof_363✝ ≅ g.obj' 3 _proof_363✝) (app₄ : f.obj' 4 _proof_364✝ ≅ g.obj' 4 _proof_364✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_361✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_362✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_362✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_363✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_363✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_364✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_364✝)) : (CategoryTheory.ComposableArrows.isoMk₄ app₀ app₁ app₂ app₃ app₄ w₀ w₁ w₂ w₃).inv = CategoryTheory.ComposableArrows.homMk₄ app₀.inv app₁.inv app₂.inv app₃.inv app₄.inv ⋯ ⋯ ⋯ ⋯ - CategoryTheory.ComposableArrows.homMk₅ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : f ⟶ g - CategoryTheory.ComposableArrows.homMk₅_app_five 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app ⟨5, CategoryTheory.ComposableArrows.homMk₅._proof_6⟩ = app₅ - CategoryTheory.ComposableArrows.homMk₅_app_four 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app ⟨4, CategoryTheory.ComposableArrows.homMk₅._proof_5⟩ = app₄ - CategoryTheory.ComposableArrows.homMk₅_app_three 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app ⟨3, CategoryTheory.ComposableArrows.homMk₅._proof_4⟩ = app₃ - CategoryTheory.ComposableArrows.homMk₅_app_two 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app ⟨2, CategoryTheory.ComposableArrows.homMk₅._proof_3⟩ = app₂ - CategoryTheory.ComposableArrows.isoMk₅ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ≅ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ≅ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ≅ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ≅ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ≅ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ≅ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_450✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_451✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_452✝)) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅.hom = CategoryTheory.CategoryStruct.comp app₄.hom (g.map' 4 5 _proof_452✝ _proof_453✝)) : f ≅ g - CategoryTheory.ComposableArrows.homMk₅_app_one 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app 1 = app₁ - CategoryTheory.ComposableArrows.homMk₅_app_zero 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ⟶ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ⟶ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ⟶ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ⟶ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ⟶ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ⟶ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁ = CategoryTheory.CategoryStruct.comp app₀ (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) := by cat_disch) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂ = CategoryTheory.CategoryStruct.comp app₁ (g.map' 1 2 _proof_245✝ _proof_450✝) := by cat_disch) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃ = CategoryTheory.CategoryStruct.comp app₂ (g.map' 2 3 _proof_298✝ _proof_451✝) := by cat_disch) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄ = CategoryTheory.CategoryStruct.comp app₃ (g.map' 3 4 _proof_363✝ _proof_452✝) := by cat_disch) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅ = CategoryTheory.CategoryStruct.comp app₄ (g.map' 4 5 _proof_452✝ _proof_453✝) := by cat_disch) : (CategoryTheory.ComposableArrows.homMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).app 0 = app₀ - CategoryTheory.ComposableArrows.ext₅ 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (h₀ : f.obj' 0 _proof_448✝ = g.obj' 0 _proof_448✝) (h₁ : f.obj' 1 _proof_449✝ = g.obj' 1 _proof_449✝) (h₂ : f.obj' 2 _proof_450✝ = g.obj' 2 _proof_450✝) (h₃ : f.obj' 3 _proof_451✝ = g.obj' 3 _proof_451✝) (h₄ : f.obj' 4 _proof_452✝ = g.obj' 4 _proof_452✝) (h₅ : f.obj' 5 _proof_453✝ = g.obj' 5 _proof_453✝) (w₀ : f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₀) (CategoryTheory.CategoryStruct.comp (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) (CategoryTheory.eqToHom ⋯))) (w₁ : f.map' 1 2 _proof_245✝ _proof_450✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₁) (CategoryTheory.CategoryStruct.comp (g.map' 1 2 _proof_245✝ _proof_450✝) (CategoryTheory.eqToHom ⋯))) (w₂ : f.map' 2 3 _proof_298✝ _proof_451✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₂) (CategoryTheory.CategoryStruct.comp (g.map' 2 3 _proof_298✝ _proof_451✝) (CategoryTheory.eqToHom ⋯))) (w₃ : f.map' 3 4 _proof_363✝ _proof_452✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₃) (CategoryTheory.CategoryStruct.comp (g.map' 3 4 _proof_363✝ _proof_452✝) (CategoryTheory.eqToHom ⋯))) (w₄ : f.map' 4 5 _proof_452✝ _proof_453✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h₄) (CategoryTheory.CategoryStruct.comp (g.map' 4 5 _proof_452✝ _proof_453✝) (CategoryTheory.eqToHom ⋯))) : f = g - CategoryTheory.ComposableArrows.isoMk₅_hom 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ≅ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ≅ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ≅ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ≅ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ≅ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ≅ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_450✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_451✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_452✝)) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅.hom = CategoryTheory.CategoryStruct.comp app₄.hom (g.map' 4 5 _proof_452✝ _proof_453✝)) : (CategoryTheory.ComposableArrows.isoMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).hom = CategoryTheory.ComposableArrows.homMk₅ app₀.hom app₁.hom app₂.hom app₃.hom app₄.hom app₅.hom w₀ w₁ w₂ w₃ w₄ - CategoryTheory.ComposableArrows.isoMk₅_inv 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {f g : CategoryTheory.ComposableArrows C 5} (app₀ : f.obj' 0 _proof_448✝ ≅ g.obj' 0 _proof_448✝) (app₁ : f.obj' 1 _proof_449✝ ≅ g.obj' 1 _proof_449✝) (app₂ : f.obj' 2 _proof_450✝ ≅ g.obj' 2 _proof_450✝) (app₃ : f.obj' 3 _proof_451✝ ≅ g.obj' 3 _proof_451✝) (app₄ : f.obj' 4 _proof_452✝ ≅ g.obj' 4 _proof_452✝) (app₅ : f.obj' 5 _proof_453✝ ≅ g.obj' 5 _proof_453✝) (w₀ : CategoryTheory.CategoryStruct.comp (f.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝) app₁.hom = CategoryTheory.CategoryStruct.comp app₀.hom (g.map' 0 1 CategoryTheory.ComposableArrows.homMk₁._proof_4 _proof_449✝)) (w₁ : CategoryTheory.CategoryStruct.comp (f.map' 1 2 _proof_245✝ _proof_450✝) app₂.hom = CategoryTheory.CategoryStruct.comp app₁.hom (g.map' 1 2 _proof_245✝ _proof_450✝)) (w₂ : CategoryTheory.CategoryStruct.comp (f.map' 2 3 _proof_298✝ _proof_451✝) app₃.hom = CategoryTheory.CategoryStruct.comp app₂.hom (g.map' 2 3 _proof_298✝ _proof_451✝)) (w₃ : CategoryTheory.CategoryStruct.comp (f.map' 3 4 _proof_363✝ _proof_452✝) app₄.hom = CategoryTheory.CategoryStruct.comp app₃.hom (g.map' 3 4 _proof_363✝ _proof_452✝)) (w₄ : CategoryTheory.CategoryStruct.comp (f.map' 4 5 _proof_452✝ _proof_453✝) app₅.hom = CategoryTheory.CategoryStruct.comp app₄.hom (g.map' 4 5 _proof_452✝ _proof_453✝)) : (CategoryTheory.ComposableArrows.isoMk₅ app₀ app₁ app₂ app₃ app₄ app₅ w₀ w₁ w₂ w₃ w₄).inv = CategoryTheory.ComposableArrows.homMk₅ app₀.inv app₁.inv app₂.inv app₃.inv app₄.inv app₅.inv ⋯ ⋯ ⋯ ⋯ ⋯ - CategoryTheory.ComposableArrows.opEquivalence_functor_obj_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : (CategoryTheory.Functor (Fin (n + 1)) C)ᵒᵖ) {X✝ Y✝ : Fin (n + 1)} (f : X✝ ⟶ Y✝) : ((CategoryTheory.ComposableArrows.opEquivalence C n).functor.obj X).map f = ((Opposite.unop X).map (⋯.functor.map (CategoryTheory.homOfLE ⋯))).op - CategoryTheory.ComposableArrows.opEquivalence_inverse_map 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) {X✝ Y✝ : CategoryTheory.ComposableArrows Cᵒᵖ n} (f : X✝ ⟶ Y✝) : (CategoryTheory.ComposableArrows.opEquivalence C n).inverse.map f = ((⋯.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (CategoryTheory.NatTrans.leftOp f)).op - CategoryTheory.ComposableArrows.opEquivalence_functor_map_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) {X✝ Y✝ : (CategoryTheory.Functor (Fin (n + 1)) C)ᵒᵖ} (f : X✝ ⟶ Y✝) (x✝ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).functor.map f).app x✝ = (f.unop.app x✝.rev).op - CategoryTheory.ComposableArrows.opEquivalence_counitIso_inv_app_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : CategoryTheory.ComposableArrows Cᵒᵖ n) (X✝ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).counitIso.inv.app X).app X✝ = X.map (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).unitInv.app (Opposite.op X✝)).unop - CategoryTheory.ComposableArrows.opEquivalence_counitIso_hom_app_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : CategoryTheory.ComposableArrows Cᵒᵖ n) (X✝ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).counitIso.hom.app X).app X✝ = X.map (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.counitInv.app (Opposite.op X✝)).unop - CategoryTheory.ComposableArrows.opEquivalence_unitIso_hom_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : (CategoryTheory.Functor (Fin (n + 1)) C)ᵒᵖ) : (CategoryTheory.ComposableArrows.opEquivalence C n).unitIso.hom.app X = CategoryTheory.CategoryStruct.comp (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.funInvIdAssoc (Opposite.unop X)).hom.op ((⋯.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).inverse.comp ⋯.functor).comp (Opposite.unop X)).rightOpLeftOpIso.hom.op.unop).op - CategoryTheory.ComposableArrows.opEquivalence_unitIso_inv_app 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : ℕ) (X : (CategoryTheory.Functor (Fin (n + 1)) C)ᵒᵖ) : (CategoryTheory.ComposableArrows.opEquivalence C n).unitIso.inv.app X = CategoryTheory.CategoryStruct.comp ((⋯.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).inverse.comp ⋯.functor).comp (Opposite.unop X)).rightOpLeftOpIso.inv.op.unop).op (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.funInvIdAssoc (Opposite.unop X)).inv.op - CategoryTheory.ComposableArrows.Exact 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} (S : CategoryTheory.ComposableArrows C n) : Prop - CategoryTheory.ComposableArrows.IsComplex 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} (S : CategoryTheory.ComposableArrows C n) : Prop - CategoryTheory.ShortComplex.toComposableArrows 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) : CategoryTheory.ComposableArrows C 2 - CategoryTheory.ComposableArrows.Exact.toIsComplex 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (self : S.Exact) : S.IsComplex - CategoryTheory.ComposableArrows.exact₀ 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 0) : S.Exact - CategoryTheory.ComposableArrows.exact₁ 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 1) : S.Exact - CategoryTheory.ComposableArrows.isComplex₀ 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 0) : S.IsComplex - CategoryTheory.ComposableArrows.isComplex₁ 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 1) : S.IsComplex - CategoryTheory.ComposableArrows.sc 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} (S : CategoryTheory.ComposableArrows C n) (hS : S.IsComplex) (i : ℕ) (hi : i + 2 ≤ n := by omega) : CategoryTheory.ShortComplex C - CategoryTheory.ComposableArrows.Exact.sc 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (hS : S.Exact) (i : ℕ) (hi : i + 2 ≤ n := by lia) : CategoryTheory.ShortComplex C - CategoryTheory.ComposableArrows.Exact.exact 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (self : S.Exact) (i : ℕ) (hi : i + 2 ≤ n := by omega) : (S.sc ⋯ i hi).Exact - CategoryTheory.ComposableArrows.Exact.mk 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (toIsComplex : S.IsComplex) (exact : ∀ (i : ℕ) (hi : autoParam (i + 2 ≤ n) CategoryTheory.ComposableArrows.Exact._auto_1), (S.sc toIsComplex i hi).Exact) : S.Exact - CategoryTheory.ComposableArrows.sc' 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} (S : CategoryTheory.ComposableArrows C n) (hS : S.IsComplex) (i j k : ℕ) (hij : i + 1 = j := by omega) (hjk : j + 1 = k := by omega) (hk : k ≤ n := by omega) : CategoryTheory.ShortComplex C - CategoryTheory.ComposableArrows.Exact.sc' 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (hS : S.Exact) (i j k : ℕ) (hij : i + 1 = j := by lia) (hjk : j + 1 = k := by lia) (hk : k ≤ n := by lia) : CategoryTheory.ShortComplex C - CategoryTheory.ComposableArrows.exact₂_iff 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 2) (hS : S.IsComplex) : S.Exact ↔ (S.sc' hS 0 1 2 CategoryTheory.ComposableArrows.exact₂_iff._proof_2 CategoryTheory.ComposableArrows.exact₂_iff._proof_4 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_5).Exact - CategoryTheory.ComposableArrows.Exact.δlast 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 2)} (hS : S.Exact) : S.δlast.Exact - CategoryTheory.ComposableArrows.Exact.δ₀ 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 2)} (hS : S.Exact) : S.δ₀.Exact - CategoryTheory.ComposableArrows.Exact.exact' 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (hS : S.Exact) (i j k : ℕ) (hij : i + 1 = j := by omega) (hjk : j + 1 = k := by omega) (hk : k ≤ n := by omega) : (S.sc' ⋯ i j k hij hjk hk).Exact - CategoryTheory.ComposableArrows.exact_of_iso 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S₁ S₂ : CategoryTheory.ComposableArrows C n} (e : S₁ ≅ S₂) (h₁ : S₁.Exact) : S₂.Exact - CategoryTheory.ComposableArrows.isComplex_of_iso 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S₁ S₂ : CategoryTheory.ComposableArrows C n} (e : S₁ ≅ S₂) (h₁ : S₁.IsComplex) : S₂.IsComplex - CategoryTheory.ComposableArrows.exact_iff_of_iso 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n : ℕ} {S₁ S₂ : CategoryTheory.ComposableArrows C n} (e : S₁ ≅ S₂) : S₁.Exact ↔ S₂.Exact
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59