Theorems · Theorem · category theory
CategoryTheory.Codiscrete.equivFun_symm_apply_map
∀ {X : Type u} {n : ℕ} (f : Fin (n + 1) → X) {X_1 Y : Fin ((Opposite.unop (Opposite.op { len := n })).len + 1)}
(x : X_1 ⟶ Y), (CategoryTheory.Codiscrete.equivFun.symm f).map x = ({ as := f X_1 }.iso { as := f Y }).hom- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
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 · cited by 19,642
- CategoryTheory.Functor.mapstatement and proof · cited by 8,698
- Equivstatement · cited by 8,337
- Oppositestatement · cited by 8,081
- CategoryTheory.Iso.homstatement · cited by 7,684
- Equiv.symmstatement and proof · cited by 3,681
- Opposite.unopstatement and proof · cited by 2,231
- SimplexCategorystatement · cited by 2,204
- CategoryTheory.ComposableArrowsstatement · cited by 627
- SimplexCategory.lenstatement and proof · cited by 542
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.