Theorems · Theorem · algebraic topology
SSet.S.eq_iff_ofSimplex_eq
∀ {X : SSet} {n m : ℕ} (x : X.obj (Opposite.op { len := n })) (y : X.obj (Opposite.op { len := m })),
x ∈ X.nonDegenerate n →
y ∈ X.nonDegenerate m →
({ dim := n, simplex := x } = { dim := m, simplex := y } ↔
SSet.Subcomplex.ofSimplex x = SSet.Subcomplex.ofSimplex y)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- CategoryTheory.Functor.objstatement and proof · cited by 19,642
- Oppositestatement · cited by 8,081
- SimplexCategorystatement · cited by 2,204
- SSetstatement and proof · cited by 1,283
- SSet.Subcomplexstatement · cited by 461
- SSet.nonDegeneratestatement and proof · cited by 106
- SSet.Subcomplex.ofSimplexstatement · cited by 73
- SSet.Sstatement · cited by 69
- SSet.N.mkproof · cited by 19
- SSet.N.ext_iffproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.RankFunction.isPushoutproof · cited by 0