Theorems · Theorem · algebraic topology
SSet.Truncated.Edge.map_id
∀ {X Y : SSet.Truncated 2} (x : X.obj (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 }))
(f : X ⟶ Y),
(SSet.Truncated.Edge.id x).map f =
SSet.Truncated.Edge.id
((CategoryTheory.ConcreteCategory.hom
(f.app (Opposite.op { obj := { len := 0 }, property := SSet.Truncated.Edge._proof_1 })))
x)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Quiver.Homstatement and proof · cited by 32,603
- CategoryTheory.Functor.objstatement and proof · cited by 19,642
- CategoryTheory.Functor.mapproof · cited by 8,698
- Oppositestatement · cited by 8,081
- CategoryTheory.NatTrans.appstatement and proof · cited by 7,406
- CategoryTheory.ConcreteCategory.homstatement and proof · cited by 4,022
- SimplexCategorystatement · cited by 2,204
- Quiver.Hom.opproof · cited by 1,948
- TypeCat.Funstatement · cited by 1,307
- SimplexCategory.lenstatement · cited by 542
- SimplexCategory.Truncatedstatement · cited by 236
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Edge.map_idproof · cited by 0