Loogle!
Result
Found 108 declarations mentioning SSet.Subcomplex.unionProd.
- SSet.Subcomplex.unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).Subcomplex - SSet.Subcomplex.unionProd.symmIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).toSSet ≅ (T.unionProd S).toSSet - SSet.Subcomplex.unionProd.ι₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.MonoidalCategoryStruct.tensorObj X T.toSSet ⟶ (S.unionProd T).toSSet - SSet.Subcomplex.unionProd.ι₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.MonoidalCategoryStruct.tensorObj S.toSSet Y ⟶ (S.unionProd T).toSSet - SSet.Subcomplex.prod_le_unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : S.prod T ≤ S.unionProd T - SSet.Subcomplex.preimage_unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) {X' Y' : SSet} (f : X' ⟶ X) (g : Y' ⟶ Y) : (S.unionProd T).preimage (CategoryTheory.MonoidalCategoryStruct.tensorHom f g) = (S.preimage f).unionProd (T.preimage g) - SSet.Subcomplex.unionProd.bicartSq 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.prod T).BicartSq (⊤.prod T) (S.prod ⊤) (S.unionProd T) - SSet.Subcomplex.prod_top_le_unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : S.prod ⊤ ≤ S.unionProd T - SSet.Subcomplex.top_prod_le_unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : ⊤.prod T ≤ S.unionProd T - SSet.Subcomplex.unionProd.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.IsPushout (CategoryTheory.MonoidalCategoryStruct.whiskerRight S.ι T.toSSet) (CategoryTheory.MonoidalCategoryStruct.whiskerLeft S.toSSet T.ι) (SSet.Subcomplex.unionProd.ι₁ S T) (SSet.Subcomplex.unionProd.ι₂ S T) - SSet.Subcomplex.unionProd.image_β_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).image (β_ X Y).hom = T.unionProd S - SSet.Subcomplex.unionProd.image_β_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).image (β_ Y X).inv = T.unionProd S - SSet.Subcomplex.unionProd.preimage_β_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).preimage (β_ Y X).hom = T.unionProd S - SSet.Subcomplex.unionProd.preimage_β_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).preimage (β_ X Y).inv = T.unionProd S - SSet.Subcomplex.unionProd.ι₁_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.unionProd.ι₁ S T) (S.unionProd T).ι = CategoryTheory.MonoidalCategoryStruct.whiskerLeft X T.ι - SSet.Subcomplex.unionProd.ι₂_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.unionProd.ι₂ S T) (S.unionProd T).ι = CategoryTheory.MonoidalCategoryStruct.whiskerRight S.ι Y - SSet.Subcomplex.mem_unionProd_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) {n : SimplexCategoryᵒᵖ} (x : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj n) : x ∈ (S.unionProd T).obj n ↔ x.2 ∈ T.obj n ∨ x.1 ∈ S.obj n - SSet.Subcomplex.preimage_op_unionProd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (S.unionProd T).op.preimage (CategoryTheory.Functor.LaxMonoidal.μ SSet.opFunctor X Y) = S.op.unionProd T.op - SSet.Subcomplex.unionProd.ι₁_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) {Z : SSet} (h : CategoryTheory.MonoidalCategoryStruct.tensorObj X Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.unionProd.ι₁ S T) (CategoryTheory.CategoryStruct.comp (S.unionProd T).ι h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X T.ι) h - SSet.Subcomplex.unionProd.ι₂_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) {Z : SSet} (h : CategoryTheory.MonoidalCategoryStruct.tensorObj X Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.unionProd.ι₂ S T) (CategoryTheory.CategoryStruct.comp (S.unionProd T).ι h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight S.ι Y) h - SSet.Subcomplex.unionProd.symmIso_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.symmIso S T).hom = SSet.Subcomplex.lift (CategoryTheory.CategoryStruct.comp (S.unionProd T).ι (β_ X Y).hom) ⋯ - SSet.Subcomplex.unionProd.symmIso_inv 📋 Mathlib.AlgebraicTopology.SimplicialSet.Monoidal
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.symmIso S T).inv = SSet.Subcomplex.lift (CategoryTheory.CategoryStruct.comp (T.unionProd S).ι (β_ Y X).hom) ⋯ - 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.Subcomplex.unionProd.pushoutObjObj_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.pushoutObjObj S T).pt = (S.unionProd T).toSSet - SSet.Subcomplex.unionProd.pushoutObjObj_inl 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.pushoutObjObj S T).inl = SSet.Subcomplex.unionProd.ι₁ S T - SSet.Subcomplex.unionProd.pushoutObjObj_inr 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.pushoutObjObj S T).inr = SSet.Subcomplex.unionProd.ι₂ S T - SSet.Subcomplex.unionProd.pushoutObjObj_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.pushoutObjObj S T).ι = (S.unionProd T).ι - SSet.Subcomplex.unionProd.ιIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : CategoryTheory.Arrow.mk (S.unionProd T).ι ≅ CategoryTheory.Arrow.mk S.ι □ CategoryTheory.Arrow.mk T.ι - SSet.Subcomplex.unionProd.ιIso_hom_right_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) (X✝ : SimplexCategoryᵒᵖ) (a : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj X✝) : (CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.unionProd.ιIso S T).hom.right.app X✝)) a = a - SSet.Subcomplex.unionProd.ιIso_inv_right_app_hom_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) (X✝ : SimplexCategoryᵒᵖ) (a : (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y).obj X✝) : (CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.unionProd.ιIso S T).inv.right.app X✝)) a = a - SSet.Subcomplex.unionProd.ιIso_hom_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.ιIso S T).hom.left = ⋯.isoPushout.hom - SSet.Subcomplex.unionProd.ιIso_inv_left 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.ιIso S T).inv.left = ⋯.isoPushout.inv - SSet.innerAnodyneExtensions_unionProd_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Inner.PushoutProduct
{X Y : SSet} (A : X.Subcomplex) (B : Y.Subcomplex) (hB : SSet.innerAnodyneExtensions B.ι) : SSet.innerAnodyneExtensions (A.unionProd B).ι - SSet.innerAnodyneExtensions_unionProd_ι' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Inner.PushoutProduct
{X Y : SSet} (A : X.Subcomplex) (B : Y.Subcomplex) (hA : SSet.innerAnodyneExtensions A.ι) : SSet.innerAnodyneExtensions (A.unionProd B).ι - 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.anodyneExtensions_unionProd_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PushoutProduct
{X Y : SSet} (A : X.Subcomplex) (B : Y.Subcomplex) (hB : SSet.anodyneExtensions B.ι) : SSet.anodyneExtensions (A.unionProd B).ι - SSet.anodyneExtensions_unionProd_ι' 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PushoutProduct
{X Y : SSet} (A : X.Subcomplex) (B : Y.Subcomplex) (hA : SSet.anodyneExtensions A.ι) : SSet.anodyneExtensions (A.unionProd B).ι - 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