Theorems · Definition · category theory

CategoryTheory.Limits.HasReflexiveCoequalizers.recOn

{C : Type u} →
  [inst : CategoryTheory.Category.{v, u} C] →
    {motive : CategoryTheory.Limits.HasReflexiveCoequalizers C → Sort u_1} →
      (t : CategoryTheory.Limits.HasReflexiveCoequalizers C) →
        ((has_coeq :
              ∀ ⦃A B : C⦄ (f g : A ⟶ B) [CategoryTheory.IsReflexivePair f g],
                CategoryTheory.Limits.HasCoequalizer f g) →
            motive ⋯) →
          motive t

Defined in: Mathlib.CategoryTheory.Limits.Shapes.Reflexive
Cited by: 0 results in Mathlib
Foundations: Depth 22 from the axioms · uses propext
Assumes: CategoryTheory.Category

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

CategoryTheory.Categorystatement and proof · cited by 32,673
Quiver.Homstatement and proof · cited by 32,603
CategoryTheory.Limits.HasCoequalizerstatement and proof · cited by 54
CategoryTheory.IsReflexivePairstatement and proof · cited by 19
CategoryTheory.Limits.HasReflexiveCoequalizersstatement and proof · cited by 9

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.