Theorems · Definition · category theory
CategoryTheory.MonoOver.Factors
{C : Type u₁} → [inst : CategoryTheory.Category.{v₁, u₁} C] → {X Y : C} → CategoryTheory.MonoOver Y → (X ⟶ Y) → PropWhen f : X ⟶ Y and P : MonoOver Y,
P.Factors f expresses that there exists a factorisation of f through P.
Given h : P.Factors f, you can recover the morphism as P.factorThru f h.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CategoryTheory.Category
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.CategoryStruct.compproof · cited by 17,999
- CategoryTheory.ObjectProperty.FullSubcategory.objproof · cited by 1,316
- CategoryTheory.Over.leftproof · cited by 541
- CategoryTheory.MonoOverstatement and proof · cited by 115
- CategoryTheory.MonoOver.arrowproof · cited by 41
Cited by6
Results whose statement or proof uses this declaration.
- CategoryTheory.Subobject.Factorsproof · cited by 56
- CategoryTheory.Subobject.factors_iffstatement · cited by 12
- CategoryTheory.Subobject.factors_of_leproof · cited by 5
- CategoryTheory.MonoOver.factors_congrstatement and proof · cited by 1
- CategoryTheory.Subobject.mk_factors_iffstatement · cited by 1
- CategoryTheory.MonoOver.factorThrustatement and proof · cited by 0