Loogle!
Result
Found 187 declarations mentioning SSet.horn.
- SSet.horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : (SSet.stdSimplex.obj { len := n }).Subcomplex - SSet.instHasDimensionLTToSSetHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).toSSet.HasDimensionLT n - SSet.horn.face 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (h : j ≠ i) : (SSet.horn (n + 1) i).toSSet.obj (Opposite.op { len := n }) - SSet.horn.const 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i k : Fin (n + 3)) (m : SimplexCategoryᵒᵖ) : ↑((SSet.horn (n + 2) i).obj m) - SSet.horn.edge₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : 3 ≤ n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.horn.ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : SSet.stdSimplex.obj { len := n } ⟶ (SSet.horn (n + 1) i).toSSet - SSet.horn_obj_eq_univ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) (m : ℕ) (h : m + 1 < n := by lia) : (SSet.horn n i).obj (Opposite.op { len := m }) = Set.univ - SSet.op_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).op.preimage (SSet.stdSimplex.opIso { len := n }).inv = SSet.horn n i.rev - SSet.horn.primitiveEdge 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 1)} (h₀ : 0 < i) (hₙ : i < Fin.last n) (j : Fin n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.horn.primitiveTriangle 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 4)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 3)) (k : ℕ) (h : k < n + 2) : (SSet.horn (n + 3) i).toSSet.obj (Opposite.op { len := 2 }) - SSet.horn.faceι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : (SSet.stdSimplex.face {j}ᶜ).toSSet ⟶ (SSet.horn n i).toSSet - SSet.face_le_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (h : i ≠ j) : SSet.stdSimplex.face {i}ᶜ ≤ SSet.horn n j - SSet.horn_obj_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 3)) : (SSet.horn (n + 2) i).obj (Opposite.op { len := 0 }) = ⊤ - SSet.horn.ι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) (SSet.horn (n + 1) i).ι = SSet.stdSimplex.δ j - SSet.horn.edge 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : {i, a, b}.card ≤ n) : (SSet.horn n i).toSSet.obj (Opposite.op { len := 1 }) - SSet.face_le_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (S : Finset (Fin (n + 2))) (j : Fin (n + 2)) : SSet.stdSimplex.face S ≤ SSet.horn (n + 1) j ↔ S ≠ Finset.univ ∧ S ≠ {j}ᶜ - SSet.mem_horn_iff_notMem_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) (i : Fin (n + 1)) : s ∈ (SSet.horn n i).obj (Opposite.op { len := d }) ↔ ∃ j, ∃ (_ : j ≠ i), j ∉ Set.range ⇑s - SSet.horn.ι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) {Z : SSet} (h : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) (CategoryTheory.CategoryStruct.comp (SSet.horn (n + 1) i).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) h - SSet.objEquiv_symm_notMem_horn_of_isIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) {d : SimplexCategory} (f : d ⟶ { len := n }) [CategoryTheory.IsIso f] : SSet.stdSimplex.objEquiv.symm f ∉ (SSet.horn n i).obj (Opposite.op d) - SSet.horn.const_val_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i k : Fin (n + 3)) {m : ℕ} (a : Fin (m + 1)) : ↑(SSet.horn.const n i k (Opposite.op { len := m })) a = k - SSet.horn.edge_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : {i, a, b}.card ≤ n) : ↑(SSet.horn.edge n i a b hab H) = SSet.stdSimplex.edge n a b hab - SSet.horn_obj 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) (x✝ : SimplexCategoryᵒᵖ) : (SSet.horn n i).obj x✝ = {s | Set.range ⇑(SSet.stdSimplex.asOrderHom s) ∪ {i} ≠ Set.univ} - SSet.horn.edge₃_coe_down 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i a b : Fin (n + 1)) (hab : a ≤ b) (H : 3 ≤ n) : (↑(SSet.horn.edge₃ n i a b hab H)).down = SimplexCategory.Hom.mk { toFun := ![a, b], monotone' := ⋯ } - SSet.subcomplex_le_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n + 1 }).Subcomplex) (i : Fin (n + 2)) : A ≤ SSet.horn (n + 1) i ↔ ¬SSet.stdSimplex.face {i}ᶜ ≤ A - SSet.mem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 1)) {m : SimplexCategoryᵒᵖ} (x : (SSet.stdSimplex.obj { len := n }).obj m) : x ∈ (SSet.horn n i).obj m ↔ Set.range ⇑(SSet.stdSimplex.asOrderHom x) ∪ {i} ≠ Set.univ - SSet.horn.faceι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (SSet.horn n i).ι = (SSet.stdSimplex.face {j}ᶜ).ι - SSet.horn.primitiveEdge_coe_down 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 1)} (h₀ : 0 < i) (hₙ : i < Fin.last n) (j : Fin n) : (↑(SSet.horn.primitiveEdge h₀ hₙ j)).down = SimplexCategory.Hom.mk { toFun := ![j.castSucc, j.succ], monotone' := ⋯ } - SSet.horn_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : SSet.horn n i = ⨆ j, SSet.stdSimplex.face {↑j}ᶜ - SSet.horn.primitiveTriangle_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i : Fin (n + 4)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 3)) (k : ℕ) (h : k < n + 2) : ↑(SSet.horn.primitiveTriangle i h₀ hₙ k h) = SSet.stdSimplex.triangle ⟨k, ⋯⟩ ⟨k + 1, ⋯⟩ ⟨k + 2, ⋯⟩ ⋯ ⋯ - SSet.objEquiv_symm_δ_mem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) : SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i) ∈ (SSet.horn (n + 1) j).obj (Opposite.op { len := n }) ↔ i ≠ j - SSet.objEquiv_symm_δ_notMem_horn_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) : SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i) ∉ (SSet.horn (n + 1) j).obj (Opposite.op { len := n }) ↔ i = j - SSet.horn.faceι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) {Z : SSet} (h : SSet.stdSimplex.obj { len := n } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (CategoryTheory.CategoryStruct.comp (SSet.horn n i).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {j}ᶜ).ι h - SSet.horn.yonedaEquiv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : SSet.yonedaEquiv (SSet.horn.ι i j hij) = SSet.horn.face i j hij - SSet.horn.faceSingletonComplIso_inv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (SSet.horn.ι i j hij) = SSet.horn.faceι i j hij - SSet.horn.hom_ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} {i : Fin (n + 2)} {S : SSet} (σ₁ σ₂ : (SSet.horn (n + 1) i).toSSet ⟶ S) (h : ∀ (j : Fin (n + 2)) (h : j ≠ i), (CategoryTheory.ConcreteCategory.hom (σ₁.app (Opposite.op { len := n }))) (SSet.horn.face i j h) = (CategoryTheory.ConcreteCategory.hom (σ₂.app (Opposite.op { len := n }))) (SSet.horn.face i j h)) : σ₁ = σ₂ - SSet.horn.faceSingletonComplIso_inv_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) {Z : SSet} (h : (SSet.horn (n + 1) i).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) h) = CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) h - SSet.horn₂₀.ι₀₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 0).toSSet - SSet.horn₂₀.ι₀₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 0).toSSet - SSet.horn₂₁.ι₀₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 1).toSSet - SSet.horn₂₁.ι₁₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 1).toSSet - SSet.horn₂₂.ι₀₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 2).toSSet - SSet.horn₂₂.ι₁₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 1 } ⟶ (SSet.horn 2 2).toSSet - SSet.horn₃₁.ι₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₁.ι₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₁.ι₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 1).toSSet - SSet.horn₃₂.ι₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn₃₂.ι₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn₃₂.ι₃ 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: SSet.stdSimplex.obj { len := 2 } ⟶ (SSet.horn 3 2).toSSet - SSet.horn.IsCompatible.desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) : (SSet.horn (n + 1) i).toSSet ⟶ X - SSet.horn.IsCompatible.of_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} (g : (SSet.horn (n + 1) i).toSSet ⟶ X) : SSet.horn.IsCompatible fun j hj => CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) g - SSet.horn.IsCompatible.ι_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) (j : Fin (n + 2)) (hj : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) hf.desc = f j hj - SSet.horn₂₀.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 1) (SSet.stdSimplex.δ 1) SSet.horn₂₀.ι₀₁ SSet.horn₂₀.ι₀₂ - SSet.horn₂₁.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 0) (SSet.stdSimplex.δ 1) SSet.horn₂₁.ι₀₁ SSet.horn₂₁.ι₁₂ - SSet.horn₂₂.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: CategoryTheory.IsPushout (SSet.stdSimplex.δ 0) (SSet.stdSimplex.δ 0) SSet.horn₂₂.ι₀₂ SSet.horn₂₂.ι₁₂ - SSet.horn.IsCompatible.ι_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) (j : Fin (n + 2)) (hj : j ≠ i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) (CategoryTheory.CategoryStruct.comp hf.desc h) = CategoryTheory.CategoryStruct.comp (f j hj) h - SSet.horn.IsCompatible.exists_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f : (j : Fin (n + 2)) → j ≠ i → (SSet.stdSimplex.obj { len := n } ⟶ X)} (hf : SSet.horn.IsCompatible f) : ∃ φ, ∀ (j : Fin (n + 2)) (hj : j ≠ i), CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) φ = f j hj - SSet.horn.hom_ext' 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} {X : SSet} {i : Fin (n + 2)} {f g : (SSet.horn (n + 1) i).toSSet ⟶ X} (h : ∀ (j : Fin (n + 2)) (hj : j ≠ i), CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) f = CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hj) g) : f = g - SSet.horn₂₀.sq 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: (SSet.stdSimplex.face {0}).BicartSq (SSet.stdSimplex.face {0, 1}) (SSet.stdSimplex.face {0, 2}) (SSet.horn 2 0) - SSet.horn₂₁.sq 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: (SSet.stdSimplex.face {1}).BicartSq (SSet.stdSimplex.face {0, 1}) (SSet.stdSimplex.face {1, 2}) (SSet.horn 2 1) - SSet.horn₂₂.sq 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
: (SSet.stdSimplex.face {2}).BicartSq (SSet.stdSimplex.face {0, 2}) (SSet.stdSimplex.face {1, 2}) (SSet.horn 2 2) - SSet.horn₃₁.desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn 3 1).toSSet ⟶ X - SSet.horn₃₂.desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn 3 2).toSSet ⟶ X - SSet.horn.multicoequalizerDiagram 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).MulticoequalizerDiagram (fun j => SSet.stdSimplex.face {↑j}ᶜ) fun j k => SSet.stdSimplex.face {↑j, ↑k}ᶜ - SSet.horn₃₁.ι₀_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₀ (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) = f₀ - SSet.horn₃₁.ι₂_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₂ (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) = f₂ - SSet.horn₃₁.ι₃_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₃ (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) = f₃ - SSet.horn₃₂.ι₀_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₀ (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) = f₀ - SSet.horn₃₂.ι₁_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₁ (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) = f₁ - SSet.horn₃₂.ι₃_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₃ (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) = f₃ - SSet.horn₃₁.ι₀_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₀ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₀ h - SSet.horn₃₁.ι₂_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₂ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₂ h - SSet.horn₃₁.ι₃_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₃ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₁.desc f₀ f₂ f₃ h₁₂ h₁₃ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₃ h - SSet.horn₃₂.ι₀_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₀ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₀ h - SSet.horn₃₂.ι₁_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₁ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₁ h - SSet.horn₃₂.ι₃_desc_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₃ (CategoryTheory.CategoryStruct.comp (SSet.horn₃₂.desc f₀ f₁ f₃ h₀₂ h₁₂ h₂₃) h) = CategoryTheory.CategoryStruct.comp f₃ h - SSet.horn₃₁.exists_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : ∃ φ, CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₀ φ = f₀ ∧ CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₂ φ = f₂ ∧ CategoryTheory.CategoryStruct.comp SSet.horn₃₁.ι₃ φ = f₃ - SSet.horn₃₂.exists_desc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : ∃ φ, CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₀ φ = f₀ ∧ CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₁ φ = f₁ ∧ CategoryTheory.CategoryStruct.comp SSet.horn₃₂.ι₃ φ = f₃ - SSet.horn₃₁.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₂.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt = X - SSet.horn₃₂.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt = X - SSet.horn.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₁.desc.multicofork_π_two 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂ - SSet.horn₃₁.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₂.desc.multicofork_π_one 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁ - SSet.horn₃₂.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₂.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₁.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₁.desc.multicofork_π_two_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂) h - SSet.horn₃₁.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.horn₃₂.desc.multicofork_π_one_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁) h - SSet.horn₃₂.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₂.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj { len := 2 } ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.modelCategoryQuillen.horn_ι_mem_J 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
(n : ℕ) [NeZero n] (i : Fin (n + 1)) : SSet.modelCategoryQuillen.J (SSet.horn n i).ι - SSet.modelCategoryQuillen.instHasLiftingPropertyιHornHAddNatOfNatOfFibration 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
{X Y : SSet} (f : X ⟶ Y) [hf : HomotopicalAlgebra.Fibration f] {n : ℕ} (i : Fin (n + 2)) : CategoryTheory.HasLiftingProperty (SSet.horn (n + 1) i).ι f - SSet.KanComplex.hornFilling 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex
{S : SSet} [S.KanComplex] {n : ℕ} {i : Fin (n + 2)} (σ₀ : (SSet.horn (n + 1) i).toSSet ⟶ S) : ∃ σ, σ₀ = CategoryTheory.CategoryStruct.comp (SSet.horn (n + 1) i).ι σ - SSet.quasicategory_of_hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) (h : ∀ {n : ℕ} {i : Fin (n + 1)}, 0 < i → i < Fin.last n → CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S)) : S.Quasicategory - SSet.Quasicategory.hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) [S.Quasicategory] {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) {n : ℕ} {i : Fin (n + 1)} (h0 : 0 < i) (hn : i < Fin.last n) : CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S) - SSet.quasicategory_iff_hasLiftingProperty 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) {X : SSet} (t : CategoryTheory.Limits.IsTerminal X) : S.Quasicategory ↔ ∀ {n : ℕ} {i : Fin (n + 1)}, 0 < i → i < Fin.last n → CategoryTheory.HasLiftingProperty (SSet.horn n i).ι (t.from S) - SSet.Quasicategory.hornFilling 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
{S : SSet} [S.Quasicategory] ⦃n : ℕ⦄ ⦃i : Fin (n + 1)⦄ (h0 : 0 < i) (hn : i < Fin.last n) (σ₀ : (SSet.horn n i).toSSet ⟶ S) : ∃ σ, σ₀ = CategoryTheory.CategoryStruct.comp (SSet.horn n i).ι σ - SSet.Quasicategory.hornFilling' 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
{S : SSet} [self : S.Quasicategory] ⦃n : ℕ⦄ ⦃i : Fin (n + 3)⦄ (σ₀ : (SSet.horn (n + 2) i).toSSet ⟶ S) (_h0 : 0 < i) (_hn : i < Fin.last (n + 2)) : ∃ σ, σ₀ = CategoryTheory.CategoryStruct.comp (SSet.horn (n + 2) i).ι σ - SSet.Quasicategory.mk 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
{S : SSet} (hornFilling' : ∀ ⦃n : ℕ⦄ ⦃i : Fin (n + 3)⦄ (σ₀ : (SSet.horn (n + 2) i).toSSet ⟶ S), 0 < i → i < Fin.last (n + 2) → ∃ σ, σ₀ = CategoryTheory.CategoryStruct.comp (SSet.horn (n + 2) i).ι σ) : S.Quasicategory - SSet.quasicategory_of_filler 📋 Mathlib.AlgebraicTopology.Quasicategory.Basic
(S : SSet) (filler : ∀ ⦃n : ℕ⦄ ⦃i : Fin (n + 3)⦄ (σ₀ : (SSet.horn (n + 2) i).toSSet ⟶ S), 0 < i → i < Fin.last (n + 2) → ∃ σ, ∀ (j : Fin (n + 3)) (h : j ≠ i), (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ S j)) σ = (CategoryTheory.ConcreteCategory.hom (σ₀.app (Opposite.op { len := n + 1 }))) (SSet.horn.face i j h)) : S.Quasicategory - SSet.horn_ι_mem_innerHornInclusions 📋 Mathlib.AlgebraicTopology.Quasicategory.InnerFibration
{n : ℕ} {i : Fin (n + 1)} (h0 : 0 < i) (hn : i < Fin.last n) : SSet.innerHornInclusions (SSet.horn n i).ι - SSet.innerHornInclusions.intro 📋 Mathlib.AlgebraicTopology.Quasicategory.InnerFibration
{n : ℕ} (i : Fin (n + 3)) (h0 : 0 < i) (hn : i < Fin.last (n + 2)) : SSet.innerHornInclusions (SSet.horn (n + 2) i).ι - SSet.innerHornInclusions_eq_iSup 📋 Mathlib.AlgebraicTopology.Quasicategory.InnerFibration
: SSet.innerHornInclusions = ⨆ n, CategoryTheory.MorphismProperty.ofHoms fun p => (SSet.horn (n + 2) ↑p).ι - SSet.horn.spineId 📋 Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : ℕ} (i : Fin (n + 3)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 2)) : (SSet.horn (n + 2) i).toSSet.Path (n + 2) - SSet.horn.spineId_map_hornInclusion 📋 Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : ℕ} (i : Fin (n + 3)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 2)) : (SSet.horn.spineId i h₀ hₙ).map (SSet.horn (n + 2) i).ι = SSet.stdSimplex.spineId (n + 2) - SSet.horn.spineId_vertex_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : ℕ} (i : Fin (n + 3)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 2)) (j : Fin (n + 2 + 1)) : ↑((SSet.horn.spineId i h₀ hₙ).vertex j) = SSet.stdSimplex.const (n + 2) j (Opposite.op { len := 0 }) - SSet.horn.spineId_arrow_coe 📋 Mathlib.AlgebraicTopology.SimplicialSet.Path
{n : ℕ} (i : Fin (n + 3)) (h₀ : 0 < i) (hₙ : i < Fin.last (n + 2)) (j : Fin (n + 2)) : ↑((SSet.horn.spineId i h₀ hₙ).arrow j) = (SSet.stdSimplex.spineId (n + 2)).arrow j - SSet.anodyneExtensions.horn_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Basic
{n : ℕ} [NeZero n] (i : Fin (n + 1)) : SSet.anodyneExtensions (SSet.horn n i).ι - SSet.instIsSmallOfHomsFinHAddNatOfNatιHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Basic
(n : ℕ) : CategoryTheory.MorphismProperty.IsSmall.{u, u, u + 1} (CategoryTheory.MorphismProperty.ofHoms fun i => (SSet.horn (n + 1) i).ι) - SSet.innerAnodyneExtensions.horn_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Inner.Basic
{n : ℕ} {i : Fin (n + 1)} (h0 : 0 < i) (hn : i < Fin.last n) : SSet.innerAnodyneExtensions (SSet.horn n i).ι - SSet.prodStdSimplex.pairing 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 2)) (n : ℕ) : ((SSet.horn (m + 1) k).unionProd (SSet.boundary n)).Pairing - SSet.prodStdSimplex.instIsRegularPairing 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 2)) (n : ℕ) : (SSet.prodStdSimplex.pairing k n).IsRegular - SSet.prodStdSimplex.instIsInnerPairingCoreSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin m) (n : ℕ) : (SSet.prodStdSimplex.pairingCore k.succ n).IsInner - SSet.prodStdSimplex.pairingCore 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).PairingCore - 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.instIsRegularPairingCore 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) : (SSet.prodStdSimplex.pairingCore k n).IsRegular - 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.weakRankFunction 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) : (SSet.prodStdSimplex.pairingCore k n).WeakRankFunction ℕ - SSet.prodStdSimplex.pairingCore_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) : (SSet.prodStdSimplex.pairingCore k n).ι = SSet.prodStdSimplex.pairingCore.Type₁ k n - SSet.prodStdSimplex.pairingCore_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : (SSet.prodStdSimplex.pairingCore k n).dim s = s.d - 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.pairingCore_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : (SSet.prodStdSimplex.pairingCore k n).index s = s.index.castSucc - 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.Type₁.hd 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} {k : Fin (m + 1)} {n : ℕ} (self : SSet.prodStdSimplex.pairingCore.Type₁ k n) : self.x.dim = self.d + 1 - SSet.prodStdSimplex.pairing_castSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) : SSet.prodStdSimplex.pairing k.castSucc n = (SSet.prodStdSimplex.pairingCore k n).pairing - SSet.prodStdSimplex.instIsInnerPairingSuccCastSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin m) (n : ℕ) : (SSet.prodStdSimplex.pairing k.castSucc.succ n).IsInner - 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_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : ℕ} (k : Fin (m + 1)) (n : ℕ) (s : SSet.prodStdSimplex.pairingCore.Type₁ k n) : (SSet.prodStdSimplex.pairingCore k n).simplex s = (s.x.cast ⋯).simplex - 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 ⋯) - SSet.prodStdSimplex.innerAnodyneExtensions_unionProd_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Inner.PushoutProduct
{m : ℕ} (k : Fin (m + 2)) (h0 : 0 < k) (hn : k < Fin.last (m + 1)) (n : ℕ) : SSet.innerAnodyneExtensions ((SSet.horn (m + 1) k).unionProd (SSet.boundary n)).ι - SSet.prodStdSimplex.anodyneExtensions_unionProd_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PushoutProduct
{m : ℕ} (k : Fin (m + 2)) (n : ℕ) : SSet.anodyneExtensions ((SSet.horn (m + 1) k).unionProd (SSet.boundary n)).ι - SSet.prodStdSimplex.strongAnodyneExtensions_unionProd_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PushoutProduct
{m : ℕ} (k : Fin (m + 2)) (n : ℕ) : SSet.strongAnodyneExtensions ((SSet.horn (m + 1) k).unionProd (SSet.boundary n)).ι
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