Loogle!
Result
Found 154 declarations mentioning SSet.boundary.
- SSet.boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : (SSet.stdSimplex.obj { len := n }).Subcomplex - SSet.instHasDimensionLTToSSetBoundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} : (SSet.boundary n).toSSet.HasDimensionLT n - SSet.boundary.instMonoι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.Mono (SSet.boundary.ι i) - SSet.boundary.ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) : SSet.stdSimplex.obj { len := n } ⟶ (SSet.boundary (n + 1)).toSSet - SSet.boundary_obj_eq_univ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(m n : ℕ) (h : m < n := by lia) : (SSet.boundary n).obj (Opposite.op { len := m }) = Set.univ - SSet.op_boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : (SSet.boundary n).op.preimage (SSet.stdSimplex.opIso { len := n }).inv = SSet.boundary n - SSet.boundary.hom_ext₀ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{X : SSet} {f g : (SSet.boundary 0).toSSet ⟶ X} : f = g - SSet.boundary.hom_ext₀_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{X : SSet} {f g : (SSet.boundary 0).toSSet ⟶ X} : f = g ↔ True - SSet.boundary.instMonoFaceι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 1)) : CategoryTheory.Mono (SSet.boundary.faceι i) - SSet.boundary.faceι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 1)) : (SSet.stdSimplex.face {i}ᶜ).toSSet ⟶ (SSet.boundary n).toSSet - SSet.stdSimplex.notMem_boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.stdSimplex.objMk OrderHom.id ∉ (SSet.boundary n).obj (Opposite.op { len := n }) - SSet.face_singleton_compl_le_boundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 1)) : SSet.stdSimplex.face {i}ᶜ ≤ SSet.boundary n - SSet.boundary.ι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.boundary.ι i) (SSet.boundary (n + 1)).ι = SSet.stdSimplex.δ i - SSet.boundary_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.boundary n = ⨆ i, SSet.stdSimplex.face {i}ᶜ - SSet.mem_boundary_iff_notMem_range 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n d : ℕ} (s : (SSet.stdSimplex.obj { len := n }).obj (Opposite.op { len := d })) : s ∈ (SSet.boundary n).obj (Opposite.op { len := d }) ↔ ∃ j, j ∉ Set.range ⇑s - SSet.boundary.ι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) {Z : SSet} (h : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.boundary.ι i) (CategoryTheory.CategoryStruct.comp (SSet.boundary (n + 1)).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) h - SSet.boundary.hom_ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} {X : SSet} {f g : (SSet.boundary (n + 1)).toSSet ⟶ X} (h : ∀ (i : Fin (n + 2)), CategoryTheory.CategoryStruct.comp (SSet.boundary.ι i) f = CategoryTheory.CategoryStruct.comp (SSet.boundary.ι i) g) : f = g - SSet.boundary_lt_top 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.boundary n < ⊤ - SSet.boundary_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
: SSet.boundary 0 = ⊥ - SSet.stdSimplex.le_boundary_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) : A ≤ SSet.boundary n ↔ A ≠ ⊤ - SSet.stdSimplex.eq_boundary_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (A : (SSet.stdSimplex.obj { len := n }).Subcomplex) : A = SSet.boundary n ↔ SSet.boundary n ≤ A ∧ A ≠ ⊤ - SSet.boundary.faceSingletonComplIso_inv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).inv (SSet.boundary.ι i) = SSet.boundary.faceι i - SSet.boundary.faceι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.boundary.faceι i) (SSet.boundary (n + 1)).ι = (SSet.stdSimplex.face {i}ᶜ).ι - SSet.boundary.faceSingletonComplIso_inv_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) {Z : SSet} (h : (SSet.boundary (n + 1)).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).inv (CategoryTheory.CategoryStruct.comp (SSet.boundary.ι i) h) = CategoryTheory.CategoryStruct.comp (SSet.boundary.faceι i) h - SSet.boundary.faceι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
{n : ℕ} (i : Fin (n + 2)) {Z : SSet} (h : SSet.stdSimplex.obj { len := n + 1 } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.boundary.faceι i) (CategoryTheory.CategoryStruct.comp (SSet.boundary (n + 1)).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {i}ᶜ).ι h - SSet.relativeCellComplexOfMono.Cell.ιSigmaBoundary 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : (SSet.boundary d).toSSet ⟶ SSet.relativeCellComplexOfMono.sigmaBoundary i d - SSet.relativeCellComplexOfMono.Cell.preimage_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : ((SSet.skeletonOfMono i) d).preimage c.map = SSet.boundary d - SSet.relativeCellComplexOfMono 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : HomotopicalAlgebra.RelativeCellComplex (fun n x => (SSet.boundary n).ι) i - SSet.relativeCellComplexOfMono.Cell.ι_l 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : CategoryTheory.CategoryStruct.comp c.ιSigmaBoundary (SSet.relativeCellComplexOfMono.l i d) = CategoryTheory.CategoryStruct.comp (SSet.boundary d).ι c.ιSigmaStdSimplex - SSet.relativeCellComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
(X : SSet) : HomotopicalAlgebra.RelativeCellComplex (fun n x => (SSet.boundary n).ι) ⊥.ι - SSet.relativeCellComplexCellsEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} : X.relativeCellComplex.Cells ≃ X.N - SSet.relativeCellComplexOfMono.Cell.ι_l_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) {Z : SSet} (h : SSet.relativeCellComplexOfMono.sigmaStdSimplex i d ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaBoundary (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.l i d) h) = CategoryTheory.CategoryStruct.comp (SSet.boundary d).ι (CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex h) - SSet.relativeCellComplexOfMono_F 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : (SSet.relativeCellComplexOfMono i).F = ⋯.functor.comp SSet.Subcomplex.toSSetFunctor - SSet.relativeCellComplexOfMono.Cell.ι_t_ι_eq_ι_l_b_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) : CategoryTheory.CategoryStruct.comp c.ιSigmaBoundary (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.t i d) ((SSet.skeletonOfMono i) d).ι) = CategoryTheory.CategoryStruct.comp (SSet.boundary d).ι (CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) ((SSet.skeletonOfMono i) (d + 1)).ι)) - SSet.relativeCellComplexOfMono_incl_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (x✝ : ℕ) : (SSet.relativeCellComplexOfMono i).incl.app x✝ = (⋯.functor.obj x✝).ι - SSet.relativeCellComplexOfMono.Cell.ι_t_ι_eq_ι_l_b_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} {i : X ⟶ Y} {d : ℕ} (c : SSet.relativeCellComplexOfMono.Cell i d) {Z : SSet} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaBoundary (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.t i d) (CategoryTheory.CategoryStruct.comp ((SSet.skeletonOfMono i) d).ι h)) = CategoryTheory.CategoryStruct.comp (SSet.boundary d).ι (CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (SSet.relativeCellComplexOfMono.b i d) (CategoryTheory.CategoryStruct.comp ((SSet.skeletonOfMono i) (d + 1)).ι h))) - SSet.relativeCellComplexOfMono_isoBot 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : (SSet.relativeCellComplexOfMono i).isoBot = SSet.Subcomplex.eqToIso ⋯ ≪≫ (CategoryTheory.asIso (SSet.Subcomplex.toRange i)).symm - SSet.relativeCellComplexOfMono_attachCells_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).ι = SSet.relativeCellComplexOfMono.Cell i d - SSet.relativeCellComplexOfMono_attachCells_π 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) (x✝¹ : SSet.relativeCellComplexOfMono.Cell i d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).π x✝¹ = () - SSet.relativeCellComplexOfMono_attachCells_m 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).m = SSet.relativeCellComplexOfMono.l i d - SSet.relativeCellComplexOfMono_attachCells_g₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).g₁ = SSet.relativeCellComplexOfMono.t i d - SSet.relativeCellComplexOfMono_attachCells_g₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).g₂ = SSet.relativeCellComplexOfMono.b i d - SSet.relativeCellComplexOfMono_attachCells_cofan₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).cofan₂ = CategoryTheory.Limits.Cofan.mk (∐ fun i => SSet.stdSimplex.obj { len := d }) (CategoryTheory.Limits.Sigma.ι fun i => SSet.stdSimplex.obj { len := d }) - SSet.relativeCellComplexOfMono_attachCells_cofan₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).cofan₁ = CategoryTheory.Limits.Cofan.mk (∐ fun i => (SSet.boundary d).toSSet) (CategoryTheory.Limits.Sigma.ι fun i => (SSet.boundary d).toSSet) - SSet.relativeCellComplexOfMono_attachCells_isColimit₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).isColimit₂ = CategoryTheory.Limits.coproductIsCoproduct fun i => SSet.stdSimplex.obj { len := d } - SSet.relativeCellComplexOfMono_attachCells_isColimit₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] (d : ℕ) (x✝ : ¬IsMax d) : ((SSet.relativeCellComplexOfMono i).attachCells d x✝).isColimit₁ = CategoryTheory.Limits.coproductIsCoproduct fun i => (SSet.boundary d).toSSet - SSet.relativeCellComplexCellsEquiv_symm_apply_j 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (s : X.N) : (SSet.relativeCellComplexCellsEquiv.symm s).j = s.dim - SSet.relativeCellComplexCellsEquiv_symm_apply_k_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (s : X.N) : (SSet.relativeCellComplexCellsEquiv.symm s).k.simplex = s.simplex - SSet.relativeCellComplexCellsEquiv_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (c : X.relativeCellComplex.Cells) : SSet.relativeCellComplexCellsEquiv c = SSet.N.mk c.k.simplex ⋯ - SSet.relativeCellComplexOfMono_isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X Y : SSet} (i : X ⟶ Y) [CategoryTheory.Mono i] : (SSet.relativeCellComplexOfMono i).isColimit = (CategoryTheory.Limits.isColimitOfPreserves SSet.Subcomplex.toSSetFunctor (CategoryTheory.Limits.CompleteLattice.colimitCocone ⋯.functor).isColimit).ofIsoColimit (CategoryTheory.Limits.Cocone.ext (SSet.Subcomplex.eqToIso ⋯ ≪≫ SSet.Subcomplex.topIso Y) ⋯) - SSet.modelCategoryQuillen.boundary_ι_mem_I 📋 Mathlib.AlgebraicTopology.SimplicialSet.CategoryWithFibrations
(n : ℕ) : SSet.modelCategoryQuillen.I (SSet.boundary n).ι - 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)).ι - SSet.PtSimplex.MulStruct.mulOne 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : f.MulStruct SSet.RelativeMorphism.const f i - SSet.PtSimplex.MulStruct.oneMul 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f f i - SSet.PtSimplex.relStructCastSuccEquivMulStruct 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} : f.RelStruct g i.castSucc ≃ SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f g i - SSet.PtSimplex.relStructSuccEquivMulStruct 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} : f.RelStruct g i.succ ≃ g.MulStruct SSet.RelativeMorphism.const f i - SSet.PtSimplex.comp_map_eq_const 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (s : X.PtSimplex n x) {Y : SSet} (φ : Y ⟶ SSet.stdSimplex.obj { len := n }) [Y.HasDimensionLT n] : CategoryTheory.CategoryStruct.comp φ s.map = SSet.const x - SSet.PtSimplex.RelStruct.refl_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin (n + 1)) : (SSet.PtSimplex.RelStruct.refl f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i) f.map - SSet.PtSimplex.MulStruct.δ_castSucc_castSucc_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.castSucc) self.map = g.map - SSet.PtSimplex.MulStruct.δ_succ_castSucc_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.succ) self.map = fg.map - SSet.PtSimplex.MulStruct.δ_succ_succ_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ.succ) self.map = f.map - SSet.PtSimplex.RelStruct.δ_castSucc_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc) self.map = f.map - SSet.PtSimplex.RelStruct.δ_succ_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ) self.map = g.map - SSet.PtSimplex.comp_map_eq_const_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (s : X.PtSimplex n x) {Y : SSet} (φ : Y ⟶ SSet.stdSimplex.obj { len := n }) [Y.HasDimensionLT n] {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp φ (CategoryTheory.CategoryStruct.comp s.map h) = CategoryTheory.CategoryStruct.comp (SSet.const x) h - SSet.PtSimplex.RelStruct.ofEq_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} (h : f = g) (i : Fin (n + 1)) : (SSet.PtSimplex.RelStruct.ofEq h i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i) f.map - SSet.PtSimplex.δ_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex (n + 1) x) (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) f.map = SSet.const x - SSet.PtSimplex.MulStruct.δ_castSucc_castSucc_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.castSucc) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp g.map h - SSet.PtSimplex.MulStruct.δ_succ_castSucc_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp fg.map h - SSet.PtSimplex.MulStruct.δ_succ_succ_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (self : f.MulStruct g fg i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp f.map h - SSet.PtSimplex.RelStruct.δ_castSucc_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp f.map h - SSet.PtSimplex.RelStruct.δ_succ_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (self : f.RelStruct g i) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ) (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp g.map h - SSet.PtSimplex.δ_map_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex (n + 1) x) (i : Fin (n + 2)) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) (CategoryTheory.CategoryStruct.comp f.map h) = CategoryTheory.CategoryStruct.comp (SSet.const x) h - SSet.PtSimplex.MulStruct.mulOne_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : (SSet.PtSimplex.MulStruct.mulOne f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i.succ) f.map - SSet.PtSimplex.MulStruct.oneMul_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.PtSimplex n x) (i : Fin n) : (SSet.PtSimplex.MulStruct.oneMul f i).map = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.σ i.castSucc) f.map - SSet.PtSimplex.RelStruct.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin (n + 1)} (map : SSet.stdSimplex.obj { len := n + 1 } ⟶ X) (δ_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc) map = f.map := by cat_disch) (δ_succ_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ) map = g.map := by cat_disch) (δ_map_of_lt : ∀ j < i.castSucc, CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) map = SSet.const x := by cat_disch) (δ_map_of_gt : ∀ (j : Fin (n + 2)), i.succ < j → CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) map = SSet.const x := by cat_disch) : f.RelStruct g i - SSet.PtSimplex.relStructCastSuccEquivMulStruct_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : f.RelStruct g i.castSucc) : (SSet.PtSimplex.relStructCastSuccEquivMulStruct h).map = h.map - SSet.PtSimplex.relStructSuccEquivMulStruct_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : f.RelStruct g i.succ) : (SSet.PtSimplex.relStructSuccEquivMulStruct h).map = h.map - SSet.PtSimplex.MulStruct.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g fg : X.PtSimplex n x} {i : Fin n} (map : SSet.stdSimplex.obj { len := n + 1 } ⟶ X) (δ_castSucc_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.castSucc) map = g.map := by cat_disch) (δ_succ_castSucc_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.castSucc.succ) map = fg.map := by cat_disch) (δ_succ_succ_map : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i.succ.succ) map = f.map := by cat_disch) (δ_map_of_lt : ∀ j < i.castSucc.castSucc, CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) map = SSet.const x := by cat_disch) (δ_map_of_gt : ∀ (j : Fin (n + 2)), i.succ.succ < j → CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ j) map = SSet.const x := by cat_disch) : f.MulStruct g fg i - SSet.PtSimplex.relStructCastSuccEquivMulStruct_symm_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : SSet.PtSimplex.MulStruct SSet.RelativeMorphism.const f g i) : (SSet.PtSimplex.relStructCastSuccEquivMulStruct.symm h).map = h.map - SSet.PtSimplex.relStructSuccEquivMulStruct_symm_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} {f g : X.PtSimplex n x} {i : Fin n} (h : g.MulStruct SSet.RelativeMorphism.const f i) : (SSet.PtSimplex.relStructSuccEquivMulStruct.symm h).map = h.map - SSet.PtSimplex.opEquiv_symm_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (g : X.PtSimplex n x) : (SSet.PtSimplex.opEquiv.symm g).map = SSet.yonedaEquiv.symm (SSet.opObjEquiv.symm (SSet.yonedaEquiv g.map)) - SSet.PtSimplex.opEquiv_apply_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.KanComplex.MulStruct
{X : SSet} {n : ℕ} {x : X.obj (Opposite.op { len := 0 })} (f : X.op.PtSimplex n (SSet.opObjEquiv.symm x)) : (SSet.PtSimplex.opEquiv f).map = SSet.yonedaEquiv.symm (SSet.opObjEquiv (SSet.yonedaEquiv f.map))
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