Theorems · Definition · algebraic topology

SSet.Subcomplex.Pairing.IsInner.recOn

{X : SSet} →
  {A : X.Subcomplex} →
    {P : A.Pairing} →
      [inst : P.IsProper] →
        {motive : P.IsInner → Sort u_1} →
          (t : P.IsInner) →
            ((ne_zero : ∀ (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d), ⋯.index hd ≠ 0) →
                (ne_last : ∀ (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d), ⋯.index hd ≠ Fin.last (d + 1)) → motive ⋯) →
              motive t

Defined in

Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing

Cited by

0 results in Mathlib

Foundations

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

Assumes

SSet.Subcomplex.Pairing.IsProper