Theorems · Theorem · algebraic topology
SSet.Subcomplex.Pairing.RankFunction.isPullback
∀ {X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [inst : LinearOrder ι] (f : P.RankFunction ι)
[inst_1 : P.IsProper] [inst_2 : SuccOrder ι] [inst_3 : NoMaxOrder ι] (j : ι),
CategoryTheory.IsPullback (f.t j) (f.m j) (SSet.Subcomplex.homOfLE ⋯) (f.b j)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 109 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites59
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- CategoryTheory.Functor.objproof · cited by 19,642
- CategoryTheory.Functor.mapproof · cited by 8,698
- LinearOrderstatement and proof · cited by 8,572
- Oppositestatement and proof · cited by 8,081
- CategoryTheory.NatTrans.appproof · cited by 7,406
- Set.Elemproof · cited by 7,166
- CategoryTheory.ConcreteCategory.homproof · cited by 4,022
- Equiv.symmproof · cited by 3,681
- SimplexCategorystatement and proof · cited by 2,204
- SSetstatement and proof · cited by 1,283
- CategoryTheory.Limits.IsLimitproof · cited by 664
Cited by1
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.RankFunction.isPushoutproof · cited by 0