Loogle!
Result
Found 165 declarations mentioning SSet.Subcomplex.N.
- SSet.Subcomplex.N 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} (A : X.Subcomplex) : Type u - SSet.Subcomplex.N.instPartialOrder 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} : PartialOrder A.N - SSet.Subcomplex.N.toN 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (self : A.N) : X.N - SSet.Subcomplex.N.cast 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) {d : ℕ} (hd : s.dim = d) : A.N - SSet.Subcomplex.N.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (x y : A.N) : x = y ↔ x.toN = y.toN - SSet.Subcomplex.N.cast_eq_self 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) {d : ℕ} (hd : s.dim = d) : s.cast hd = s - SSet.Subcomplex.N.le_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {x y : A.N} : x ≤ y ↔ x.toN ≤ y.toN - SSet.Subcomplex.N.lt_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {x y : A.N} : x < y ↔ x.toN < y.toN - SSet.Subcomplex.N.cases 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} (A : X.Subcomplex) {motive : X.N → Prop} (mem : ∀ (s : X.N), s.subcomplex ≤ A → motive s) (notMem : ∀ (s : A.N), motive s.toN) (s : X.N) : motive s - SSet.Subcomplex.N.opEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} : A.op.N ≃o A.N - SSet.Subcomplex.N.eq_iff_sMk_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (x y : A.N) : x = y ↔ { dim := x.dim, simplex := x.simplex } = { dim := y.dim, simplex := y.simplex } - SSet.Subcomplex.N.orderIsoOfIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {Y : SSet} {B : Y.Subcomplex} (e : X ≅ Y) (hA : B.preimage e.hom = A) : A.N ≃o B.N - SSet.Subcomplex.N.mk' 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (toN : X.N) (notMem : toN.simplex ∉ A.obj (Opposite.op { len := toN.dim })) : A.N - SSet.Subcomplex.N.notMem 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (self : A.N) : self.simplex ∉ A.obj (Opposite.op { len := self.dim }) - SSet.Subcomplex.N.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {n : ℕ} (x : X.obj (Opposite.op { len := n })) (hx : x ∈ X.nonDegenerate n) (hx' : x ∉ A.obj (Opposite.op { len := n })) : A.N - SSet.Subcomplex.N.mk'_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) : ∃ t, ∃ (ht : t.simplex ∉ A.obj (Opposite.op { len := t.dim })), s = { toN := t, notMem := ht } - SSet.Subcomplex.N.orderIsoOfIso_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {Y : SSet} {B : Y.Subcomplex} (e : X ≅ Y) (hA : B.preimage e.hom = A) (x : A.N) : (SSet.Subcomplex.N.orderIsoOfIso e hA) x = { toN := (SSet.N.orderIsoOfIso e) x.toN, notMem := ⋯ } - SSet.Subcomplex.N.opEquiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (x : A.op.N) : SSet.Subcomplex.N.opEquiv x = { toN := SSet.N.opEquiv x.toN, notMem := ⋯ } - SSet.Subcomplex.N.mk_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) : ∃ n x, ∃ (hx : x ∈ X.nonDegenerate n) (hx' : x ∉ A.obj (Opposite.op { len := n })), s = SSet.Subcomplex.N.mk x hx hx' - SSet.Subcomplex.N.orderIsoOfIso_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {Y : SSet} {B : Y.Subcomplex} (e : X ≅ Y) (hA : B.preimage e.hom = A) (y : B.N) : (RelIso.symm (SSet.Subcomplex.N.orderIsoOfIso e hA)) y = { toN := (SSet.N.orderIsoOfIso e).symm y.toN, notMem := ⋯ } - SSet.Subcomplex.N.opEquiv_symm_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (y : A.N) : (RelIso.symm SSet.Subcomplex.N.opEquiv) y = { toN := SSet.N.opEquiv.symm y.toN, notMem := ⋯ } - SSet.Subcomplex.existsN 📋 Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {n : ℕ} (s : X.obj (Opposite.op { len := n })) {A : X.Subcomplex} (hs : s ∉ A.obj (Opposite.op { len := n })) : ∃ x f, CategoryTheory.Epi f ∧ (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x.simplex = s - SSet.Subcomplex.Pairing.I 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (self : A.Pairing) : Set A.N - SSet.Subcomplex.Pairing.II 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (self : A.Pairing) : Set A.N - SSet.Subcomplex.Pairing.AncestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (x y : ↑P.II) : Prop - SSet.Subcomplex.Pairing.instIsWellFoundedElemNIIAncestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsRegular] : IsWellFounded (↑P.II) P.AncestralRel - SSet.Subcomplex.Pairing.p 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (self : A.Pairing) : ↑self.II ≃ ↑self.I - SSet.Subcomplex.Pairing.wf 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsRegular] : WellFounded P.AncestralRel - SSet.Subcomplex.Pairing.IsRegular.wf 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [self : P.IsRegular] : WellFounded P.AncestralRel - SSet.Subcomplex.Pairing.IsRegular.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [toIsProper : P.IsProper] (wf : WellFounded P.AncestralRel) : P.IsRegular - SSet.Subcomplex.Pairing.union 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (self : A.Pairing) : self.I ∪ self.II = Set.univ - SSet.Subcomplex.Pairing.inter 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (self : A.Pairing) : self.I ∩ self.II = ∅ - SSet.Subcomplex.Pairing.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (I II : Set A.N) (inter : I ∩ II = ∅) (union : I ∪ II = Set.univ) (p : ↑II ≃ ↑I) : A.Pairing - SSet.Subcomplex.Pairing.ne 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (x : ↑P.I) (y : ↑P.II) : ↑x ≠ ↑y - SSet.Subcomplex.Pairing.AncestralRel.dim_le 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [P.IsProper] {x y : ↑P.II} (hxy : P.AncestralRel x y) : (↑x).dim ≤ (↑y).dim - SSet.Subcomplex.Pairing.ofIso_I 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) : (P.ofIso e hA).I = ⇑(SSet.Subcomplex.N.orderIsoOfIso e hA) ⁻¹' P.I - SSet.Subcomplex.Pairing.ofIso_II 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) : (P.ofIso e hA).II = ⇑(SSet.Subcomplex.N.orderIsoOfIso e hA) ⁻¹' P.II - SSet.Subcomplex.Pairing.isUniquelyCodimOneFace 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] (x : ↑P.II) : (↑x).IsUniquelyCodimOneFace (↑(P.p x)).toS - SSet.Subcomplex.Pairing.IsProper.isUniquelyCodimOneFace 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [self : P.IsProper] (x : ↑P.II) : (↑x).IsUniquelyCodimOneFace (↑(P.p x)).toS - SSet.Subcomplex.Pairing.IsProper.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} (isUniquelyCodimOneFace : ∀ (x : ↑P.II), (↑x).IsUniquelyCodimOneFace (↑(P.p x)).toS) : P.IsProper - SSet.Subcomplex.Pairing.le 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] (x : ↑P.II) : ↑x ≤ ↑(P.p x) - SSet.Subcomplex.Pairing.lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] (x : ↑P.II) : ↑x < ↑(P.p x) - SSet.Subcomplex.Pairing.exists_or 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (x : A.N) : ∃ y, x = ↑y ∨ x = ↑(P.p y) - SSet.Subcomplex.Pairing.dim_p 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] (x : ↑P.II) : (↑(P.p x)).dim = (↑x).dim + 1 - SSet.Subcomplex.Pairing.IsInner.ne_last 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {inst✝ : P.IsProper} [self : P.IsInner] (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) : ⋯.index hd ≠ Fin.last (d + 1) - SSet.Subcomplex.Pairing.IsInner.ne_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {inst✝ : P.IsProper} [self : P.IsInner] (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) : ⋯.index hd ≠ 0 - SSet.Subcomplex.Pairing.ofIso_ancestralRel_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) (x y : ↑P.II) : (P.ofIso e hA).AncestralRel ⟨(SSet.Subcomplex.N.orderIsoOfIso e hA).symm ↑x, ⋯⟩ ⟨(SSet.Subcomplex.N.orderIsoOfIso e hA).symm ↑y, ⋯⟩ ↔ P.AncestralRel x y - SSet.Subcomplex.Pairing.IsInner.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [P.IsProper] (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)) : P.IsInner - SSet.Subcomplex.Pairing.ofIso_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) (x : ↑P.II) {d : ℕ} (hd : (↑x).dim = d) [P.IsProper] : ⋯.index hd = ⋯.index hd - SSet.Subcomplex.Pairing.ofIso_p 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Pairing
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {Y : SSet} {B : Y.Subcomplex} (e : Y ≅ X) (hA : A.preimage e.hom = B) (x : ↑P.II) : (P.ofIso e hA).p ⟨(SSet.Subcomplex.N.orderIsoOfIso e hA).symm ↑x, ⋯⟩ = ⟨(SSet.Subcomplex.N.orderIsoOfIso e hA).symm ↑(P.p x), ⋯⟩ - SSet.Subcomplex.PairingCore.I 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : Set A.N - SSet.Subcomplex.PairingCore.II 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : Set A.N - SSet.Subcomplex.PairingCore.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ι) : A.N - SSet.Subcomplex.PairingCore.type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ι) : A.N - SSet.Subcomplex.PairingCore.injective_type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : Function.Injective h.type₁ - SSet.Subcomplex.PairingCore.injective_type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : Function.Injective h.type₂ - SSet.Subcomplex.PairingCore.equivI 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : h.ι ≃ ↑h.I - SSet.Subcomplex.PairingCore.equivII 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : h.ι ≃ ↑h.II - SSet.Subcomplex.PairingCore.pairing_I 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : h.pairing.I = h.I - SSet.Subcomplex.PairingCore.pairing_II 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) : h.pairing.II = h.II - SSet.Subcomplex.PairingCore.type₁_ne_type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s t : h.ι) : h.type₁ s ≠ h.type₂ t - SSet.Subcomplex.PairingCore.surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (x : A.N) : ∃ s, x = h.type₁ s ∨ x = h.type₂ s - SSet.Subcomplex.PairingCore.equivII_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (a : h.ι) : ↑(h.equivII a) = h.type₂ a - SSet.Subcomplex.PairingCore.equivI_apply_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (a : h.ι) : ↑(h.equivI a) = h.type₁ a - SSet.Subcomplex.PairingCore.ancestralRel_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s t : h.ι) : h.AncestralRel s t ↔ h.pairing.AncestralRel (h.equivII s) (h.equivII t) - SSet.Subcomplex.PairingCore.type₁_pairing 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (x : h.ι) : h.type₁ x = ↑(h.pairing.p (h.equivII x)) - SSet.Subcomplex.PairingCore.pairing_p_equivII 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (x : h.ι) : h.pairing.p (h.equivII x) = h.equivI x - SSet.Subcomplex.PairingCore.pairing_p_symm_equivI 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (x : h.ι) : h.pairing.p.symm (h.equivI x) = h.equivII x - SSet.Subcomplex.PairingCore.surjective' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (self : A.PairingCore) (x : A.N) : ∃ s, x.toS = { dim := self.dim s + 1, simplex := self.simplex s } ∨ x.toS = { dim := self.dim s, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (self.index s))) (self.simplex s) } - SSet.Subcomplex.PairingCore.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (ι : Type v) (dim : ι → ℕ) (simplex : (s : ι) → X.obj (Opposite.op { len := dim s + 1 })) (index : (s : ι) → Fin (dim s + 2)) (nonDegenerate₁ : ∀ (s : ι), simplex s ∈ X.nonDegenerate (dim s + 1)) (nonDegenerate₂ : ∀ (s : ι), (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index s))) (simplex s) ∈ X.nonDegenerate (dim s)) (notMem₁ : ∀ (s : ι), simplex s ∉ A.obj (Opposite.op { len := dim s + 1 })) (notMem₂ : ∀ (s : ι), (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index s))) (simplex s) ∉ A.obj (Opposite.op { len := dim s })) (injective_type₁' : ∀ {s t : ι}, { dim := dim s + 1, simplex := simplex s } = { dim := dim t + 1, simplex := simplex t } → s = t) (injective_type₂' : ∀ {s t : ι}, { dim := dim s, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index s))) (simplex s) } = { dim := dim t, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index t))) (simplex t) } → s = t) (type₁_ne_type₂' : ∀ (s t : ι), { dim := dim s + 1, simplex := simplex s } ≠ { dim := dim t, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index t))) (simplex t) }) (surjective' : ∀ (x : A.N), ∃ s, x.toS = { dim := dim s + 1, simplex := simplex s } ∨ x.toS = { dim := dim s, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X (index s))) (simplex s) }) : A.PairingCore - SSet.Subcomplex.Pairing.RankFunction.rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.RankFunction α) : ↑P.II → α - SSet.Subcomplex.Pairing.WeakRankFunction.rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.WeakRankFunction α) : ↑P.II → α - SSet.Subcomplex.Pairing.RankFunction.wf_ancestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] [WellFoundedLT α] (f : P.RankFunction α) : WellFounded P.AncestralRel - SSet.Subcomplex.Pairing.WeakRankFunction.wf_ancestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] [WellFoundedLT α] [P.IsProper] (f : P.WeakRankFunction α) : WellFounded P.AncestralRel - SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction_rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (α : Type v) [PartialOrder α] (f : P.RankFunction α) (a✝ : ↑P.II) : (SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction P α f).rank a✝ = f.rank a✝ - SSet.Subcomplex.Pairing.RankFunction.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (rank : ↑P.II → α) (lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → rank x < rank y) : P.RankFunction α - SSet.Subcomplex.Pairing.RankFunction.lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.RankFunction α) {x y : ↑P.II} : P.AncestralRel x y → self.rank x < self.rank y - SSet.Subcomplex.Pairing.WeakRankFunction.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (rank : ↑P.II → α) (lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → (↑x).dim = (↑y).dim → rank x < rank y) : P.WeakRankFunction α - SSet.Subcomplex.Pairing.WeakRankFunction.lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.WeakRankFunction α) {x y : ↑P.II} : P.AncestralRel x y → (↑x).dim = (↑y).dim → self.rank x < self.rank y - SSet.Subcomplex.Pairing.rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsRegular] (x : ↑P.II) : ℕ - SSet.Subcomplex.Pairing.rank' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {y : ↑P.II} (hy : Acc P.AncestralRel y) : ℕ - SSet.Subcomplex.Pairing.instFiniteSubtypeElemNIIAncestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (y : ↑P.II) : Finite { x // P.AncestralRel x y } - SSet.Subcomplex.Pairing.rank_lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} [P.IsRegular] {x y : ↑P.II} (h : P.AncestralRel x y) : P.rank x < P.rank y - SSet.Subcomplex.Pairing.rank'_lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {y : ↑P.II} (hy : Acc P.AncestralRel y) {x : ↑P.II} (r : P.AncestralRel x y) : P.rank' ⋯ < P.rank' hy - SSet.Subcomplex.Pairing.rank'_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) {y : ↑P.II} (hy : Acc P.AncestralRel y) : P.rank' hy = ⨆ x, P.rank' ⋯ + 1 - SSet.Subcomplex.Pairing.RankFunction.Cell.s 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (self : f.Cell i) : ↑P.II - SSet.Subcomplex.Pairing.RankFunction.Cell.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (s : ↑P.II) (rank_s : f.rank s = i) : f.Cell i - SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.range (f.m j)).N - SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.range (f.m j)).N - SSet.Subcomplex.Pairing.RankFunction.Cell.ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} {inst✝ : LinearOrder ι} {f : P.RankFunction ι} {i : ι} {x y : f.Cell i} (s : x.s = y.s) : x = y - SSet.Subcomplex.Pairing.RankFunction.Cell.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} {inst✝ : LinearOrder ι} {f : P.RankFunction ι} {i : ι} {x y : f.Cell i} : x = y ↔ x.s = y.s - SSet.Subcomplex.Pairing.RankFunction.mapN 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (x : (SSet.Subcomplex.range (f.m j)).N) : X.S - SSet.Subcomplex.Pairing.RankFunction.Cell.subcomplex_not_le_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {j : ι} (c : f.Cell j) : ¬(↑c.s).subcomplex ≤ f.filtration j - SSet.Subcomplex.Pairing.RankFunction.Cell.subcomplex_not_le_image_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : ¬(↑c.s).subcomplex ≤ c.horn.image c.map - SSet.Subcomplex.Pairing.RankFunction.mapN_type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c) = { dim := (↑c.s).dim, simplex := (↑c.s).simplex } - SSet.Subcomplex.Pairing.RankFunction.exists_or_of_range_m_N 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (s : (SSet.Subcomplex.range (f.m j)).N) : ∃ c, s = SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c ∨ s = SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c - SSet.Subcomplex.Pairing.RankFunction.subcomplex_le_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) {j : ι} (c : f.Cell j) {i : ι} (h : j < i) : (↑(P.p c.s)).subcomplex ≤ f.filtration i - SSet.Subcomplex.Pairing.RankFunction.Cell.range_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : SSet.Subcomplex.range c.map = (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.image_horn_lt_subcomplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : c.horn.image c.map < (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.filtration_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [SuccOrder ι] (i : ι) (hi : ¬IsMax i) : f.filtration (Order.succ i) = f.filtration i ⊔ ⨆ c, (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.filtration_def 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (i : ι) : f.filtration i = A ⊔ ⨆ j, ⨆ (_ : j < i), ⨆ c, (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.mapN_type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c) = { dim := (↑(P.p c.s)).dim, simplex := (↑(P.p c.s)).simplex } - SSet.Subcomplex.Pairing.RankFunction.Cell.image_face_index_compl 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : (SSet.stdSimplex.face {c.index}ᶜ).image c.map = (↑c.s).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.map_app_objEquiv_symm_δ_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : (CategoryTheory.ConcreteCategory.hom (c.map.app (Opposite.op { len := c.dim }))) (SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ c.index)) = (↑c.s).simplex - SSet.Subcomplex.Pairing.op_I 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Op
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) : P.op.I = ⇑SSet.Subcomplex.N.opEquiv ⁻¹' P.I - SSet.Subcomplex.Pairing.op_II 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Op
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) : P.op.II = ⇑SSet.Subcomplex.N.opEquiv ⁻¹' P.II - SSet.Subcomplex.Pairing.op_ancestralRel_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Op
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (x y : ↑P.II) : P.op.AncestralRel ⟨SSet.Subcomplex.N.opEquiv.symm ↑x, ⋯⟩ ⟨SSet.Subcomplex.N.opEquiv.symm ↑y, ⋯⟩ ↔ P.AncestralRel x y - SSet.Subcomplex.Pairing.op_p 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Op
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (x : ↑P.II) : P.op.p ⟨SSet.Subcomplex.N.opEquiv.symm ↑x, ⋯⟩ = ⟨SSet.Subcomplex.N.opEquiv.symm ↑(P.p x), ⋯⟩ - SSet.prodStdSimplex.pairingCore.IsType₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) : Prop - SSet.prodStdSimplex.pairingCore.Type₁.x 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (self : SSet.prodStdSimplex.pairingCore.Type₁ k n) : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N - SSet.prodStdSimplex.pairingCore.Type₁.δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N - SSet.prodStdSimplex.pairingCore.Type₁.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {s t : SSet.prodStdSimplex.pairingCore.Type₁ k n} : s = t ↔ s.x = t.x - SSet.prodStdSimplex.type₁_pairingCore 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) {n : ℕ} (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : (SSet.prodStdSimplex.pairingCore k n).type₁ s = s.x - SSet.prodStdSimplex.pairingCore.IsType₂.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.min 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Fin (d + 1) - SSet.prodStdSimplex.pairingCore.IsIndex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Fin (d + 1) → Prop - SSet.prodStdSimplex.pairingCore.finset 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : Finset (Fin (d + 1)) - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_d 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).d = d - SSet.prodStdSimplex.pairingCore.nonempty_finset 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.finset x hd).Nonempty - SSet.prodStdSimplex.pairingCore.IsIndex.unique 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {l' : Fin d} (hl' : SSet.prodStdSimplex.pairingCore.IsIndex x hd l'.succ) : l = l' - SSet.prodStdSimplex.pairingCore.IsIndex.min_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.min x hd = l.succ - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).index = SSet.prodStdSimplex.pairingCore.min x hd - SSet.prodStdSimplex.pairingCore.IsType₂.φ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : Fin (m + 2) × Fin (n + 1) - SSet.prodStdSimplex.pairingCore.isIndex_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.IsIndex x hd 0 ↔ False - SSet.prodStdSimplex.pairingCore.IsIndex.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.Type₁.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) (d : ℕ) (hd : x.dim = d + 1) (index : Fin (d + 1)) (isIndex : SSet.prodStdSimplex.pairingCore.IsIndex x hd index.succ) : SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore.IsIndex.isType₂_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.IsType₂ hl.δ - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_d 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.d = d - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succ_fst 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).succ).1 = k.succ - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.index = i - SSet.prodStdSimplex.pairingCore.IsType₂.simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })).obj (Opposite.op { len := d + 1 }) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succ_snd 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).succ).2 = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).castSucc).2 - SSet.prodStdSimplex.pairingCore.IsType₂.strictMono_φ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : StrictMono (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd) - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_eq_of_δ_eq 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {t : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (ht : SSet.prodStdSimplex.pairingCore.IsType₂ t) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) (hst : s.δ = t) {d : ℕ} (hd : t.dim = d) : ht.type₁ hd = s - SSet.prodStdSimplex.pairingCore.IsIndex.δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N - SSet.prodStdSimplex.pairingCore.IsIndex.type₁_x 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {i : Fin (d + 1)} (h : SSet.prodStdSimplex.pairingCore.IsIndex x hd i.succ) : h.type₁.x = x - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_snd_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : (hx.simplex hd).2 i = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i).2 - SSet.prodStdSimplex.pairingCore.IsType₂.type₁_x 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (hx.type₁ hd).x = SSet.Subcomplex.N.mk (hx.simplex hd) ⋯ ⋯ - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_fst_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) : (hx.simplex hd).1 i = (SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i).1 - SSet.prodStdSimplex.pairingCore.IsIndex.δ_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : hl.δ.dim = d - SSet.prodStdSimplex.pairingCore.IsType₂.simplex_mem_nonDegenerate 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : hx.simplex hd ∈ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })).nonDegenerate (d + 1) - SSet.prodStdSimplex.pairingCore.IsIndex.min_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : SSet.prodStdSimplex.pairingCore.min hl.δ ⋯ = l - SSet.prodStdSimplex.pairingCore.IsType₂.notMem_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : hx.simplex hd ∉ ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).obj (Opposite.op { len := d + 1 }) - SSet.prodStdSimplex.pairingCore.IsIndex.δ_injective 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {y : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d' : ℕ} {hd' : y.dim = d' + 1} {l' : Fin (d' + 1)} (hl' : SSet.prodStdSimplex.pairingCore.IsIndex y hd' l'.succ) (h : hl.δ = hl'.δ) : x = y - SSet.prodStdSimplex.pairingCore.IsType₂.δ_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsType₂ x) {d : ℕ} (hd : x.dim = d) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) (SSet.prodStdSimplex.pairingCore.min x hd).castSucc)) (hx.simplex hd) = (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.δ_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : hl.δ.simplex = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) l.castSucc)) (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.eq_of_isType₂_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : ℕ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {u : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hu : SSet.prodStdSimplex.pairingCore.IsType₂ u) (i : Fin (d + 2)) (hu' : { dim := u.dim, simplex := u.simplex } = { dim := d, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) i)) (x.cast hd).simplex }) : i = l.castSucc ∨ i = l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_castSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.castSucc = k.castSucc - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.succ = k.succ - SSet.prodStdSimplex.pairingCore.simplex_fst_le_castSucc_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i ≤ k.castSucc ↔ i < SSet.prodStdSimplex.pairingCore.min x hd - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_le_castSucc_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i ≤ k.castSucc ↔ i < l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.succ_le_simplex_fst_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : k.succ ≤ (x.cast hd).simplex.1 i ↔ l.succ ≤ i - SSet.prodStdSimplex.pairingCore.mem_finset_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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 - SSet.prodStdSimplex.pairingCore.simplex_fst_min 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : (x.cast hd).simplex.1 (SSet.prodStdSimplex.pairingCore.min x hd) = k.succ - SSet.prodStdSimplex.pairingCore.mem_range_right 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (n + 1)) : i ∈ Set.range ⇑(x.cast hd).simplex.2 - SSet.prodStdSimplex.pairingCore.IsType₂.φ_castSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd (SSet.prodStdSimplex.pairingCore.min x hd).castSucc = (k.castSucc, (x.cast hd).simplex.2 (SSet.prodStdSimplex.pairingCore.min x hd)) - SSet.prodStdSimplex.pairingCore.mem_range_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (m + 2)) (hi : i ≠ k.castSucc) : i ∈ Set.range ⇑(x.cast hd).simplex.1 - SSet.prodStdSimplex.objEquiv_apply_snd' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.2 i = (x.cast hd).simplex.2 i - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_snd_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.objEquiv_apply_fst' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i = (x.cast hd).simplex.1 i - SSet.prodStdSimplex.pairingCore.isIndex_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{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) : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ ↔ (x.cast hd).simplex.1 l.castSucc = k.castSucc ∧ (x.cast hd).simplex.1 l.succ = k.succ ∧ (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.pairingCore.IsType₂.φ_succAbove 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 1)) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd ((SSet.prodStdSimplex.pairingCore.min x hd).castSucc.succAbove i) = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) i - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_ne 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i ≠ (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) ((SSet.prodStdSimplex.pairingCore.min x hd).predAbove i) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i < (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.castPred ⋯) - SSet.prodStdSimplex.pairingCore.IsType₂.φ_of_gt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : ℕ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : (SSet.prodStdSimplex.pairingCore.min x hd).castSucc < i) : SSet.prodStdSimplex.pairingCore.IsType₂.φ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.pred ⋯)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c