Loogle!
Result
Found 68 declarations mentioning CategoryTheory.ComposableArrows.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) : Prop - 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.ShortComplex.Exact.exact_toComposableArrows 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) : S.toComposableArrows.Exact - CategoryTheory.ShortComplex.exact_iff_exact_toComposableArrows 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) : S.Exact ↔ S.toComposableArrows.Exact - 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.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.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 - CategoryTheory.ComposableArrows.natAddLEFunctor_obj_exact 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {n k l : ℕ} (h : k + l ≤ n) {R : CategoryTheory.ComposableArrows C n} (hR : R.Exact) : ((CategoryTheory.ComposableArrows.natAddLEFunctor h).obj R).Exact - CategoryTheory.ComposableArrows.exact_of_δ₀ 📋 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)} (h : (CategoryTheory.ComposableArrows.mk₂ (S.map' 0 1 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_2 ⋯) (S.map' 1 2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4 ⋯)).Exact) (h₀ : S.δ₀.Exact) : S.Exact - CategoryTheory.ComposableArrows.exact_iff_δ₀ 📋 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)) : S.Exact ↔ (CategoryTheory.ComposableArrows.mk₂ (S.map' 0 1 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_2 ⋯) (S.map' 1 2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4 ⋯)).Exact ∧ S.δ₀.Exact - CategoryTheory.ComposableArrows.exact_of_δ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)) (h₁ : S.δlast.Exact) (h₂ : (CategoryTheory.ComposableArrows.mk₂ (S.map' n (n + 1) ⋯ ⋯) (S.map' (n + 1) (n + 2) ⋯ ⋯)).Exact) : S.Exact - CategoryTheory.ComposableArrows.exact_iff_δ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)) : S.Exact ↔ S.δlast.Exact ∧ (CategoryTheory.ComposableArrows.mk₂ (S.map' n (n + 1) ⋯ ⋯) (S.map' (n + 1) (n + 2) ⋯ ⋯)).Exact - CategoryTheory.ComposableArrows.exact₂_mk 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ComposableArrows C 2) (w : CategoryTheory.CategoryStruct.comp (S.map' 0 1 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4) (S.map' 1 2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_5) = 0) (h : { X₁ := S.obj ⟨0, ⋯⟩, X₂ := S.obj ⟨1, ⋯⟩, X₃ := S.obj ⟨2, ⋯⟩, f := S.map' 0 1 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4, g := S.map' 1 2 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_4 CategoryTheory.ComposableArrows.isComplex₂_iff._proof_5, zero := w }.Exact) : S.Exact - CategoryTheory.ComposableArrows.Exact.isIso_map' 📋 Mathlib.Algebra.Homology.ExactSequence
{C : Type u_2} [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C n} (hS : S.Exact) (k : ℕ) (hk : k + 3 ≤ n) (h₀ : S.map' k (k + 1) ⋯ ⋯ = 0) (h₁ : S.map' (k + 2) (k + 3) ⋯ hk = 0) : CategoryTheory.IsIso (S.map' (k + 1) (k + 2) ⋯ ⋯) - CategoryTheory.ShortComplex.SnakeInput.snake_lemma 📋 Mathlib.Algebra.Homology.ShortComplex.SnakeLemma
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] (S : CategoryTheory.ShortComplex.SnakeInput C) : S.composableArrows.Exact - HomologicalComplex.HomologySequence.composableArrows₃_exact 📋 Mathlib.Algebra.Homology.HomologySequence
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {c : ComplexShape ι} (K : HomologicalComplex C c) (i j : ι) (hij : c.Rel i j) [CategoryTheory.CategoryWithHomology C] : (HomologicalComplex.HomologySequence.composableArrows₃ K i j).Exact - CategoryTheory.Functor.homologySequenceComposableArrows₅_exact 📋 Mathlib.CategoryTheory.Triangulated.HomologicalFunctor
{C : Type u_1} {A : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.HasShift C ℤ] [CategoryTheory.Category.{v_3, u_3} A] (F : CategoryTheory.Functor C A) [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Preadditive C] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] [CategoryTheory.Abelian A] [F.IsHomological] [F.ShiftSequence ℤ] (T : CategoryTheory.Pretriangulated.Triangle C) (hT : T ∈ CategoryTheory.Pretriangulated.distinguishedTriangles) (n₀ n₁ : ℤ) (h : n₀ + 1 = n₁) : (F.homologySequenceComposableArrows₅ T n₀ n₁ h).Exact - CategoryTheory.Abelian.epi_of_epi_of_epi_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 3} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_13)) (h₂ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11) - CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 3} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_13)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4) - CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 4} (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (φ : R₁ ⟶ R₂) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono._proof_2)) (h₁ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono._proof_4)) (h₃ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 3 CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono._proof_6)) (h₄ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 4 CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono._proof_7)) : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono._proof_9) - CategoryTheory.Abelian.epi_of_epi_of_epi_of_mono'' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {n k : ℕ} (h : k + 3 ≤ n) {R₁ R₂ : CategoryTheory.ComposableArrows C n} (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (φ : R₁ ⟶ R₂) (k₀ k₁ k₂ k₃ : ℕ) (hk₀ : k₀ = k) (hk₁ : k₁ = k + 1) (hk₂ : k₂ = k + 2) (hk₃ : k₃ = k + 3) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ k₀ ⋯)) (h₂ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ k₂ ⋯)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ k₃ ⋯)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ k₁ ⋯) - CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {n k : ℕ} (h : k + 3 ≤ n) {R₁ R₂ : CategoryTheory.ComposableArrows C n} (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (φ : R₁ ⟶ R₂) (k₀ k₁ k₂ k₃ : ℕ) (hk₀ : k₀ = k) (hk₁ : k₁ = k + 1) (hk₂ : k₂ = k + 2) (hk₃ : k₃ = k + 3) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ k₀ ⋯)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ k₁ ⋯)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ k₃ ⋯)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ k₂ ⋯) - CategoryTheory.Abelian.isIso_of_epi_of_isIso_of_isIso_of_mono' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {n k : ℕ} (h : k + 4 ≤ n) {R₁ R₂ : CategoryTheory.ComposableArrows C n} (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (φ : R₁ ⟶ R₂) (k₀ k₁ k₂ k₃ k₄ : ℕ) (hk₀ : k₀ = k) (hk₁ : k₁ = k + 1) (hk₂ : k₂ = k + 2) (hk₃ : k₃ = k + 3) (hk₄ : k₄ = k + 4) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ k₀ ⋯)) (h₁ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ k₁ ⋯)) (h₃ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ k₃ ⋯)) (h₄ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ k₄ ⋯)) : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ k₂ ⋯) - CategoryTheory.Abelian.epi_of_epi_of_epi_of_epi 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₂ : R₂.Exact) (hR₁' : CategoryTheory.Epi (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2)) (h₁ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6) - CategoryTheory.Abelian.mono_of_mono_of_mono_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂' : CategoryTheory.Mono (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₀ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6) - CategoryTheory.Abelian.epi_of_mono_of_epi_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (hR₂' : CategoryTheory.Mono (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2) - CategoryTheory.Abelian.mono_of_epi_of_epi_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (hR₁' : CategoryTheory.Epi (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1) - CategoryTheory.Abelian.isIso_of_epi_of_isIso 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (hR₁' : CategoryTheory.Epi (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) (hR₂' : CategoryTheory.Epi (R₂.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2)) (h₁ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1) - CategoryTheory.Abelian.isIso_of_isIso_of_mono 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.Exact) (hR₁' : CategoryTheory.Mono (R₁.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (hR₂' : CategoryTheory.Mono (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₁ : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₂ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) : CategoryTheory.IsIso (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2) - CategoryTheory.Abelian.epi_of_mono_of_epi_of_mono' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.Exact) (hR₂ : R₂.map' 0 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1 = 0) (hR₂' : CategoryTheory.Mono (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2) - CategoryTheory.Abelian.mono_of_epi_of_epi_mono' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 2} (φ : R₁ ⟶ R₂) (hR₁ : R₁.map' 0 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1 = 0) (hR₁' : CategoryTheory.Epi (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1)) (hR₂ : R₂.Exact) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_epi_mono'._proof_1) - CategoryTheory.Abelian.epi_of_epi_of_epi_of_mono' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 3} (φ : R₁ ⟶ R₂) (hR₁ : (CategoryTheory.ComposableArrows.mk₂ (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4) (R₁.map' 2 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)).Exact) (hR₂ : (CategoryTheory.ComposableArrows.mk₂ (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11) (R₂.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4)).Exact) (hR₂' : R₂.map' 1 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7 = 0) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_13)) (h₂ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)) : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11) - CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono' 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.Four
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {R₁ R₂ : CategoryTheory.ComposableArrows C 3} (φ : R₁ ⟶ R₂) (hR₁ : R₁.map' 0 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4 = 0) (hR₁' : (CategoryTheory.ComposableArrows.mk₂ (R₁.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4) (R₁.map' 2 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)).Exact) (hR₂ : (CategoryTheory.ComposableArrows.mk₂ (R₂.map' 0 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_9 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11) (R₂.map' 1 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_6 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4)).Exact) (h₀ : CategoryTheory.Epi (CategoryTheory.ComposableArrows.app' φ 0 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_13)) (h₁ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 1 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_11)) (h₃ : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 3 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_7)) : CategoryTheory.Mono (CategoryTheory.ComposableArrows.app' φ 2 CategoryTheory.Abelian.mono_of_epi_of_mono_of_mono'._proof_4) - HomologicalComplex.HomologySequence.composableArrows₂_exact 📋 Mathlib.Algebra.Homology.HomologySequenceLemmas
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {c : ComplexShape ι} {S₁ : CategoryTheory.ShortComplex (HomologicalComplex C c)} (hS₁ : S₁.ShortExact) (i : ι) : (HomologicalComplex.HomologySequence.composableArrows₂ S₁ i).Exact - HomologicalComplex.HomologySequence.composableArrows₅_exact 📋 Mathlib.Algebra.Homology.HomologySequenceLemmas
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {c : ComplexShape ι} {S₁ : CategoryTheory.ShortComplex (HomologicalComplex C c)} (hS₁ : S₁.ShortExact) (i j : ι) (hij : c.Rel i j) : (HomologicalComplex.HomologySequence.composableArrows₅ hS₁ i j hij).Exact - CategoryTheory.Abelian.Ext.contravariantSequence_exact 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) (n₀ n₁ : ℕ) (h : 1 + n₀ = n₁) : (CategoryTheory.Abelian.Ext.contravariantSequence hS Y n₀ n₁ h).Exact - CategoryTheory.Abelian.Ext.covariantSequence_exact 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] (X : C) {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (n₀ n₁ : ℕ) (h : n₀ + 1 = n₁) : (CategoryTheory.Abelian.Ext.covariantSequence X hS n₀ n₁ h).Exact - CategoryTheory.ComposableArrows.Exact.opcyclesIsoCycles 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [h₁ : (hS.sc k ⋯).HasRightHomology] [h₂ : (hS.sc (k + 1) ⋯).HasLeftHomology] : (hS.sc k ⋯).opcycles ≅ (hS.sc (k + 1) ⋯).cycles - CategoryTheory.ComposableArrows.Exact.opcyclesIsoCycles_hom_fac 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [h₁ : (hS.sc k ⋯).HasRightHomology] [h₂ : (hS.sc (k + 1) ⋯).HasLeftHomology] : CategoryTheory.CategoryStruct.comp (hS.sc k ⋯).pOpcycles (CategoryTheory.CategoryStruct.comp (hS.opcyclesIsoCycles k ⋯).hom (hS.sc (k + 1) ⋯).iCycles) = S.map' (k + 1) (k + 2) ⋯ ⋯ - CategoryTheory.ComposableArrows.Exact.cokerIsoKer 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [CategoryTheory.Limits.HasCokernel (S.map' k (k + 1) ⋯ ⋯)] [CategoryTheory.Limits.HasKernel (S.map' (k + 2) (k + 3) ⋯ ⋯)] : CategoryTheory.Limits.cokernel (S.map' k (k + 1) ⋯ ⋯) ≅ CategoryTheory.Limits.kernel (S.map' (k + 2) (k + 3) ⋯ ⋯) - CategoryTheory.ComposableArrows.Exact.opcyclesIsoCycles_hom_fac_assoc 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [h₁ : (hS.sc k ⋯).HasRightHomology] [h₂ : (hS.sc (k + 1) ⋯).HasLeftHomology] {Z : C} (h : S.obj ⟨k + 1 + 1, ⋯⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp (hS.sc k ⋯).pOpcycles (CategoryTheory.CategoryStruct.comp (hS.opcyclesIsoCycles k ⋯).hom (CategoryTheory.CategoryStruct.comp (hS.sc (k + 1) ⋯).iCycles h)) = CategoryTheory.CategoryStruct.comp (S.map' (k + 1) (k + 2) ⋯ ⋯) h - CategoryTheory.ComposableArrows.Exact.cokerIsoKer_hom_fac 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [CategoryTheory.Limits.HasCokernel (S.map' k (k + 1) ⋯ ⋯)] [CategoryTheory.Limits.HasKernel (S.map' (k + 2) (k + 3) ⋯ ⋯)] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.cokernel.π (S.map' k (k + 1) ⋯ ⋯)) (CategoryTheory.CategoryStruct.comp (hS.cokerIsoKer k ⋯).hom (CategoryTheory.Limits.kernel.ι (S.map' (k + 2) (k + 3) ⋯ ⋯))) = S.map' (k + 1) (k + 2) ⋯ ⋯ - CategoryTheory.ComposableArrows.Exact.cokerIsoKer_hom_fac_assoc 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n := by lia) [CategoryTheory.Limits.HasCokernel (S.map' k (k + 1) ⋯ ⋯)] [CategoryTheory.Limits.HasKernel (S.map' (k + 2) (k + 3) ⋯ ⋯)] {Z : C} (h : S.obj ⟨k + 2, ⋯⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.cokernel.π (S.map' k (k + 1) ⋯ ⋯)) (CategoryTheory.CategoryStruct.comp (hS.cokerIsoKer k ⋯).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.kernel.ι (S.map' (k + 2) (k + 3) ⋯ ⋯)) h)) = CategoryTheory.CategoryStruct.comp (S.map' (k + 1) (k + 2) ⋯ ⋯) h - CategoryTheory.ComposableArrows.Exact.cokerIsoKer' 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : cc.pt ≅ kf.pt - CategoryTheory.ComposableArrows.Exact.cokerToKer' 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : cc.pt ⟶ kf.pt - CategoryTheory.ComposableArrows.Exact.isIso_cokerToKer' 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : CategoryTheory.IsIso (hS.cokerToKer' k hk cc kf hcc hkf) - CategoryTheory.ComposableArrows.Exact.cokerIsoKer'_hom 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : (hS.cokerIsoKer' k hk cc kf hcc hkf).hom = hS.cokerToKer' k hk cc kf hcc hkf - CategoryTheory.ComposableArrows.Exact.cokerIsoKer'_hom_inv_id 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : CategoryTheory.CategoryStruct.comp (hS.cokerToKer' k hk cc kf hcc hkf) (hS.cokerIsoKer' k hk cc kf hcc hkf).inv = CategoryTheory.CategoryStruct.id cc.pt - CategoryTheory.ComposableArrows.Exact.cokerIsoKer'_hom_inv_id_assoc 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) {Z : C} (h : cc.pt ⟶ Z) : CategoryTheory.CategoryStruct.comp (hS.cokerToKer' k hk cc kf hcc hkf) (CategoryTheory.CategoryStruct.comp (hS.cokerIsoKer' k hk cc kf hcc hkf).inv h) = h - CategoryTheory.ComposableArrows.Exact.cokerIsoKer'_inv_hom_id_assoc 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) {Z : C} (h : kf.pt ⟶ Z) : CategoryTheory.CategoryStruct.comp (hS.cokerIsoKer' k hk cc kf hcc hkf).inv (CategoryTheory.CategoryStruct.comp (hS.cokerToKer' k hk cc kf hcc hkf) h) = h - CategoryTheory.ComposableArrows.Exact.cokerIsoKer'_inv_hom_id 📋 Mathlib.Algebra.Homology.ExactSequenceFour
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {n : ℕ} {S : CategoryTheory.ComposableArrows C (n + 3)} (hS : S.Exact) (k : ℕ) (hk : k ≤ n) (cc : CategoryTheory.Limits.CokernelCofork (S.map' k (k + 1) ⋯ ⋯)) (kf : CategoryTheory.Limits.KernelFork (S.map' (k + 2) (k + 3) ⋯ ⋯)) (hcc : CategoryTheory.Limits.IsColimit cc) (hkf : CategoryTheory.Limits.IsLimit kf) : CategoryTheory.CategoryStruct.comp (hS.cokerIsoKer' k hk cc kf hcc hkf).inv (hS.cokerToKer' k hk cc kf hcc hkf) = CategoryTheory.CategoryStruct.id kf.pt - CategoryTheory.Abelian.SpectralObject.composableArrows₅_exact 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} ι] [CategoryTheory.Abelian C] (X : CategoryTheory.Abelian.SpectralObject C ι) {i j k : ι} (f : i ⟶ j) (g : j ⟶ k) (fg : i ⟶ k) (h : CategoryTheory.CategoryStruct.comp f g = fg) (n₀ n₁ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) : (X.composableArrows₅ f g fg h n₀ n₁ hn₁).Exact - CategoryTheory.Abelian.SpectralObject.exact₁' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} ι] [CategoryTheory.Abelian C] (self : CategoryTheory.Abelian.SpectralObject C ι) (n₀ n₁ : ℤ) (h : n₀ + 1 = n₁) (D : CategoryTheory.ComposableArrows ι 2) : (CategoryTheory.ComposableArrows.mk₂ ((self.δ' n₀ n₁ h).app D) ((self.H n₁).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 1 0 2 2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_10 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_4).app D))).Exact - CategoryTheory.Abelian.SpectralObject.exact₃' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} ι] [CategoryTheory.Abelian C] (self : CategoryTheory.Abelian.SpectralObject C ι) (n₀ n₁ : ℤ) (h : n₀ + 1 = n₁) (D : CategoryTheory.ComposableArrows ι 2) : (CategoryTheory.ComposableArrows.mk₂ ((self.H n₀).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 2 1 2 2 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_4 CategoryTheory.Abelian.SpectralObject._proof_4).app D)) ((self.δ' n₀ n₁ h).app D)).Exact - CategoryTheory.Abelian.SpectralObject.exact₂' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} ι] [CategoryTheory.Abelian C] (self : CategoryTheory.Abelian.SpectralObject C ι) (n : ℤ) (D : CategoryTheory.ComposableArrows ι 2) : (CategoryTheory.ComposableArrows.mk₂ ((self.H n).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 1 0 2 2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_10 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_4).app D)) ((self.H n).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 2 1 2 2 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_4 CategoryTheory.Abelian.SpectralObject._proof_4).app D))).Exact - CategoryTheory.Abelian.SpectralObject.mk 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} ι] [CategoryTheory.Abelian C] (H : ℤ → CategoryTheory.Functor (CategoryTheory.ComposableArrows ι 1) C) (δ' : (n₀ n₁ : ℤ) → n₀ + 1 = n₁ → ((CategoryTheory.ComposableArrows.functorArrows ι 1 2 2 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_4).comp (H n₀) ⟶ (CategoryTheory.ComposableArrows.functorArrows ι 0 1 2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_2).comp (H n₁))) (exact₁' : ∀ (n₀ n₁ : ℤ) (h : n₀ + 1 = n₁) (D : CategoryTheory.ComposableArrows ι 2), (CategoryTheory.ComposableArrows.mk₂ ((δ' n₀ n₁ h).app D) ((H n₁).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 1 0 2 2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_10 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_4).app D))).Exact) (exact₂' : ∀ (n : ℤ) (D : CategoryTheory.ComposableArrows ι 2), (CategoryTheory.ComposableArrows.mk₂ ((H n).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 1 0 2 2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_10 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_4).app D)) ((H n).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 2 1 2 2 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_4 CategoryTheory.Abelian.SpectralObject._proof_4).app D))).Exact) (exact₃' : ∀ (n₀ n₁ : ℤ) (h : n₀ + 1 = n₁) (D : CategoryTheory.ComposableArrows ι 2), (CategoryTheory.ComposableArrows.mk₂ ((H n₀).map ((CategoryTheory.ComposableArrows.mapFunctorArrows ι 0 2 1 2 2 CategoryTheory.Abelian.SpectralObject._proof_8 CategoryTheory.Abelian.SpectralObject._proof_2 CategoryTheory.Abelian.SpectralObject._proof_6 CategoryTheory.Abelian.SpectralObject._proof_4 CategoryTheory.Abelian.SpectralObject._proof_4).app D)) ((δ' n₀ n₁ h).app D)).Exact) : CategoryTheory.Abelian.SpectralObject C ι - CategoryTheory.Abelian.SpectralObject.sequenceΨ_exact 📋 Mathlib.Algebra.Homology.SpectralObject.Differentials
{C : Type u_1} {ι : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} ι] [CategoryTheory.Abelian C] (X : CategoryTheory.Abelian.SpectralObject C ι) {i j k l : ι} (f₁ : i ⟶ j) (f₂ : j ⟶ k) (f₃ : k ⟶ l) (f₁₂ : i ⟶ k) (h₁₂ : CategoryTheory.CategoryStruct.comp f₁ f₂ = f₁₂) (f₂₃ : j ⟶ l) (h₂₃ : CategoryTheory.CategoryStruct.comp f₂ f₃ = f₂₃) (n₀ n₁ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) : (X.sequenceΨ f₁ f₂ f₃ f₁₂ h₁₂ f₂₃ h₂₃ n₀ n₁ hn₁).Exact - CategoryTheory.kernelCokernelCompSequence_exact 📋 Mathlib.CategoryTheory.Abelian.DiagramLemmas.KernelCokernelComp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) : (CategoryTheory.kernelCokernelCompSequence f g).Exact - CategoryTheory.GrothendieckTopology.MayerVietorisSquare.sequence_exact 📋 Mathlib.CategoryTheory.Sites.SheafCohomology.MayerVietoris
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} [CategoryTheory.HasWeakSheafify J (Type v)] [CategoryTheory.HasSheafify J AddCommGrpCat] [CategoryTheory.HasExt (CategoryTheory.Sheaf J AddCommGrpCat)] (S : J.MayerVietorisSquare) (F : CategoryTheory.Sheaf J AddCommGrpCat) (n₀ n₁ : ℕ) (h : n₀ + 1 = n₁) : (S.sequence F n₀ n₁ h).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 ce5dd8c