Theorems · Theorem · algebraic topology
SSet.prodStdSimplex.pairingCore.mem_finset_iff
∀ {m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ}
(hd : x.dim = d) (l : Fin (d + 1)), l ∈ SSet.prodStdSimplex.pairingCore.finset x hd ↔ (x.cast hd).simplex.1 l = k.succ- Cited by
- 2 results in Mathlib
- Foundations
- Depth 68 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
- CategoryTheory.Functor.objstatement · cited by 19,642
- Finsetstatement · cited by 13,712
- Oppositestatement · cited by 8,081
- Finset.univproof · cited by 3,473
- CategoryTheory.MonoidalCategoryStruct.tensorObjstatement · cited by 3,106
- SimplexCategorystatement · cited by 2,204
- SSetstatement · cited by 1,283
- SSet.stdSimplexstatement · cited by 499
- SSet.N.toSstatement and proof · cited by 171
- Finset.filter_congrproof · cited by 167
- SSet.hornstatement and proof · cited by 162
Cited by2
Results whose statement or proof uses this declaration.
- SSet.prodStdSimplex.pairingCore.IsIndex.min_eqproof · cited by 3
- SSet.prodStdSimplex.pairingCore.simplex_fst_minproof · cited by 2