Theorems · Definition · category theory

CategoryTheory.IsRegularMono.getStruct

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {X Y : C} → (f : X ⟶ Y) → [CategoryTheory.IsRegularMono f] → CategoryTheory.RegularMono f

Given IsRegularMono f, a choice of data for RegularMono f.

Defined in: Mathlib.CategoryTheory.Limits.Shapes.RegularMono
Cited by: 1 results in Mathlib
Foundations: Depth 4 from the axioms · uses Classical.choice
Assumes: CategoryTheory.Category CategoryTheory.IsRegularMono

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites6

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
Nonempty.someproof · cited by 340
CategoryTheory.IsRegularMonostatement and proof · cited by 14
CategoryTheory.RegularMonostatement · cited by 14
CategoryTheory.IsRegularMono.regularMonoproof · cited by 4

Cited by6

Results whose statement or proof uses this declaration.

CategoryTheory.IsRegularMono.leftproof · cited by 5
CategoryTheory.IsRegularMono.rightproof · cited by 5
CategoryTheory.IsRegularMono.Zproof · cited by 5
CategoryTheory.IsRegularMono.isLimitproof · cited by 2
CategoryTheory.regularMonoOfMonoproof · cited by 0
CategoryTheory.IsRegularMono.wproof · cited by 0