Theorems · Theorem · category theory
CategoryTheory.Functor.WellOrderInductionData.Extension.val_injective
∀ {J : Type u} [inst : LinearOrder J] [inst_1 : SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)}
{d : F.WellOrderInductionData} [inst_2 : OrderBot J] {val₀ : F.obj (Opposite.op ⊥)} {j : J}
{e e' : d.Extension val₀ j}, e.val = e'.val → e = e'- Cited by
- 0 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderSuccOrderOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites31
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Quiver.Homproof · cited by 32,603
- CategoryTheory.Functor.objstatement and proof · cited by 19,642
- CategoryTheory.Functorstatement and proof · cited by 16,252
- CategoryTheory.Functor.mapproof · cited by 8,698
- LinearOrderstatement and proof · cited by 8,572
- Oppositestatement and proof · cited by 8,081
- CategoryTheory.Functor.compproof · cited by 6,529
- Bot.botstatement and proof · cited by 4,720
- CategoryTheory.ConcreteCategory.homproof · cited by 4,022
- LE.le.transproof · cited by 3,151
- LT.lt.leproof · cited by 2,189
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.