Theorems · Theorem · algebraic topology

SSet.Subcomplex.Pairing.RankFunction.Cell.mapToSucc.congr_simp

∀ {X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [inst : LinearOrder ι] {f : P.RankFunction ι}
  [inst_1 : P.IsProper] {j : ι} [inst_2 : SuccOrder ι] [inst_3 : NoMaxOrder ι] (c : f.Cell j), c.mapToSucc = c.mapToSucc

Defined in

Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex

Cited by

0 results in Mathlib

Foundations

Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderSSet.Subcomplex.Pairing.IsProperSuccOrderNoMaxOrder