Loogle!
Result
Found 210 declarations mentioning LE.le.trans. Of these, only the first 200 are shown.
- LE.le.trans 📋 Mathlib.Order.Basic
{α : Type u_1} [Preorder α] {a b c : α} : a ≤ b → b ≤ c → a ≤ c - Set.inclusion_inclusion 📋 Mathlib.Data.Set.Inclusion
{α : Type u_1} {s t u : Set α} (hst : s ⊆ t) (htu : t ⊆ u) (x : ↑s) : Set.inclusion htu (Set.inclusion hst x) = Set.inclusion ⋯ x - Set.inclusion_comp_inclusion 📋 Mathlib.Data.Set.Inclusion
{α : Type u_2} {s t u : Set α} (hst : s ⊆ t) (htu : t ⊆ u) : Set.inclusion htu ∘ Set.inclusion hst = Set.inclusion ⋯ - Set.domRestrict₂_comp_domRestrict₂ 📋 Mathlib.Data.Set.Restrict
{α : Type u_1} {π : α → Type u_5} {s t u : Set α} (hst : s ⊆ t) (htu : t ⊆ u) : Set.domRestrict₂ hst ∘ Set.domRestrict₂ htu = Set.domRestrict₂ ⋯ - Set.restrict₂_comp_restrict₂ 📋 Mathlib.Data.Set.Restrict
{α : Type u_1} {π : α → Type u_5} {s t u : Set α} (hst : s ⊆ t) (htu : t ⊆ u) : Set.domRestrict₂ hst ∘ Set.domRestrict₂ htu = Set.domRestrict₂ ⋯ - Finset.restrict₂_comp_restrict₂ 📋 Mathlib.Data.Finset.Pi
{ι : Type u_2} {π : ι → Type u_3} {s t u : Finset ι} (hst : s ⊆ t) (htu : t ⊆ u) : Finset.restrict₂ hst ∘ Finset.restrict₂ htu = Finset.restrict₂ ⋯ - SubgroupClass.inclusion_inclusion 📋 Mathlib.Algebra.Group.Subgroup.Defs
{G : Type u_1} [Group G] {S : Type u_4} {H K : S} [SetLike S G] [SubgroupClass S G] [Preorder S] [IsConcreteLE S G] {L : S} (hHK : H ≤ K) (hKL : K ≤ L) (x : ↥H) : (SubgroupClass.inclusion hKL) ((SubgroupClass.inclusion hHK) x) = (SubgroupClass.inclusion ⋯) x - QuotientAddGroup.map_comp_map 📋 Mathlib.GroupTheory.QuotientGroup.Defs
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] (N : AddSubgroup G) [nN : N.Normal] {I : Type u_5} [AddGroup I] (M : AddSubgroup H) (O : AddSubgroup I) [M.Normal] [O.Normal] (f : G →+ H) (g : H →+ I) (hf : N ≤ AddSubgroup.comap f M) (hg : M ≤ AddSubgroup.comap g O) (hgf : N ≤ AddSubgroup.comap (g.comp f) O := ⋯) : (QuotientAddGroup.map M O g hg).comp (QuotientAddGroup.map N M f hf) = QuotientAddGroup.map N O (g.comp f) hgf - QuotientGroup.map_comp_map 📋 Mathlib.GroupTheory.QuotientGroup.Defs
{G : Type u_1} {H : Type u_2} [Group G] [Group H] (N : Subgroup G) [nN : N.Normal] {I : Type u_5} [Group I] (M : Subgroup H) (O : Subgroup I) [M.Normal] [O.Normal] (f : G →* H) (g : H →* I) (hf : N ≤ Subgroup.comap f M) (hg : M ≤ Subgroup.comap g O) (hgf : N ≤ Subgroup.comap (g.comp f) O := ⋯) : (QuotientGroup.map M O g hg).comp (QuotientGroup.map N M f hf) = QuotientGroup.map N O (g.comp f) hgf - QuotientAddGroup.map_map 📋 Mathlib.GroupTheory.QuotientGroup.Defs
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] (N : AddSubgroup G) [nN : N.Normal] {I : Type u_5} [AddGroup I] (M : AddSubgroup H) (O : AddSubgroup I) [M.Normal] [O.Normal] (f : G →+ H) (g : H →+ I) (hf : N ≤ AddSubgroup.comap f M) (hg : M ≤ AddSubgroup.comap g O) (hgf : N ≤ AddSubgroup.comap (g.comp f) O := ⋯) (x : G ⧸ N) : (QuotientAddGroup.map M O g hg) ((QuotientAddGroup.map N M f hf) x) = (QuotientAddGroup.map N O (g.comp f) hgf) x - QuotientGroup.map_map 📋 Mathlib.GroupTheory.QuotientGroup.Defs
{G : Type u_1} {H : Type u_2} [Group G] [Group H] (N : Subgroup G) [nN : N.Normal] {I : Type u_5} [Group I] (M : Subgroup H) (O : Subgroup I) [M.Normal] [O.Normal] (f : G →* H) (g : H →* I) (hf : N ≤ Subgroup.comap f M) (hg : M ≤ Subgroup.comap g O) (hgf : N ≤ Subgroup.comap (g.comp f) O := ⋯) (x : G ⧸ N) : (QuotientGroup.map M O g hg) ((QuotientGroup.map N M f hf) x) = (QuotientGroup.map N O (g.comp f) hgf) x - Succ.rec 📋 Mathlib.Order.SuccPred.Archimedean
{α : Type u_1} [Preorder α] [SuccOrder α] [IsSuccArchimedean α] {m : α} {P : (n : α) → m ≤ n → Prop} (rfl : P m ⋯) (succ : ∀ (n : α) (hmn : m ≤ n), P n hmn → P (Order.succ n) ⋯) ⦃n : α⦄ (hmn : m ≤ n) : P n hmn - Submodule.factor_comp 📋 Mathlib.LinearAlgebra.Quotient.Basic
{R : Type u_1} {M : Type u_2} [Ring R] [AddCommGroup M] [Module R M] {p p' p'' : Submodule R M} (H1 : p ≤ p') (H2 : p' ≤ p'') : Submodule.factor H2 ∘ₗ Submodule.factor H1 = Submodule.factor ⋯ - Submodule.mapQ_comp 📋 Mathlib.LinearAlgebra.Quotient.Basic
{R : Type u_1} {M : Type u_2} [Ring R] [AddCommGroup M] [Module R M] (p : Submodule R M) {R₂ : Type u_3} {M₂ : Type u_4} [Ring R₂] [AddCommGroup M₂] [Module R₂ M₂] {τ₁₂ : R →+* R₂} {R₃ : Type u_5} {M₃ : Type u_6} [Ring R₃] [AddCommGroup M₃] [Module R₃ M₃] (p₂ : Submodule R₂ M₂) (p₃ : Submodule R₃ M₃) {τ₂₃ : R₂ →+* R₃} {τ₁₃ : R →+* R₃} [RingHomCompTriple τ₁₂ τ₂₃ τ₁₃] (f : M →ₛₗ[τ₁₂] M₂) (g : M₂ →ₛₗ[τ₂₃] M₃) (hf : p ≤ Submodule.comap f p₂) (hg : p₂ ≤ Submodule.comap g p₃) (h : p ≤ Submodule.comap f (Submodule.comap g p₃) := ⋯) : p.mapQ p₃ (g ∘ₛₗ f) h = p₂.mapQ p₃ g hg ∘ₛₗ p.mapQ p₂ f hf - Submodule.factor_comp_apply 📋 Mathlib.LinearAlgebra.Quotient.Basic
{R : Type u_1} {M : Type u_2} [Ring R] [AddCommGroup M] [Module R M] {p p' p'' : Submodule R M} (H1 : p ≤ p') (H2 : p' ≤ p'') (x : M ⧸ p) : (Submodule.factor H2) ((Submodule.factor H1) x) = (Submodule.factor ⋯) x - Ideal.Quotient.factor_comp 📋 Mathlib.RingTheory.Ideal.Quotient.Defs
{R : Type u} [Ring R] {S T U : Ideal R} [S.IsTwoSided] [T.IsTwoSided] [U.IsTwoSided] (H1 : S ≤ T) (H2 : T ≤ U) : (Ideal.Quotient.factor H2).comp (Ideal.Quotient.factor H1) = Ideal.Quotient.factor ⋯ - Ideal.Quotient.factor_comp_apply 📋 Mathlib.RingTheory.Ideal.Quotient.Defs
{R : Type u} [Ring R] {S T U : Ideal R} [S.IsTwoSided] [T.IsTwoSided] [U.IsTwoSided] (H1 : S ≤ T) (H2 : T ≤ U) (x : R ⧸ S) : (Ideal.Quotient.factor H2) ((Ideal.Quotient.factor H1) x) = (Ideal.Quotient.factor ⋯) x - Subalgebra.saturation_saturation 📋 Mathlib.Algebra.Algebra.Subalgebra.Lattice
{R : Type u_1} {S : Type u_2} [CommSemiring R] [CommSemiring S] [Algebra R S] {s : Subalgebra R S} {M : Submonoid S} {H : M ≤ s.toSubmonoid} : (s.saturation M H).saturation M ⋯ = s.saturation M H - Ideal.Quotient.factorₐ_comp 📋 Mathlib.RingTheory.Ideal.Quotient.Operations
(R₁ : Type u_1) {A : Type u_3} [CommSemiring R₁] [Ring A] [Algebra R₁ A] {I J : Ideal A} [I.IsTwoSided] [J.IsTwoSided] (hIJ : I ≤ J) {K : Ideal A} [K.IsTwoSided] (hJK : J ≤ K) : (Ideal.Quotient.factorₐ R₁ hJK).comp (Ideal.Quotient.factorₐ R₁ hIJ) = Ideal.Quotient.factorₐ R₁ ⋯ - DirectedSystem.map_map 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_1} {inst✝ : Preorder ι} {F : ι → Type u_4} {f : ⦃i j : ι⦄ → i ≤ j → F i → F j} [self : DirectedSystem F f] ⦃k j i : ι⦄ (hij : i ≤ j) (hjk : j ≤ k) (x : F i) : f hjk (f hij x) = f ⋯ x - InverseSystem.map_map 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_1} {inst✝ : Preorder ι} {F : ι → Type u_4} {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} [self : InverseSystem f] ⦃k j i : ι⦄ (hkj : k ≤ j) (hji : j ≤ i) (x : F i) : f hkj (f hji x) = f ⋯ x - DirectedSystem.mk 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_1} [Preorder ι] {F : ι → Type u_4} {f : ⦃i j : ι⦄ → i ≤ j → F i → F j} (map_self : ∀ ⦃i : ι⦄ (x : F i), f ⋯ x = x) (map_map : ∀ ⦃k j i : ι⦄ (hij : i ≤ j) (hjk : j ≤ k) (x : F i), f hjk (f hij x) = f ⋯ x) : DirectedSystem F f - InverseSystem.mk 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_1} [Preorder ι] {F : ι → Type u_4} {f : ⦃i j : ι⦄ → i ≤ j → F j → F i} (map_self : ∀ ⦃i : ι⦄ (x : F i), f ⋯ x = x) (map_map : ∀ ⦃k j i : ι⦄ (hkj : k ≤ j) (hji : j ≤ i) (x : F i), f hkj (f hji x) = f ⋯ x) : InverseSystem f - DirectedSystem.map_map' 📋 Mathlib.Order.DirectedInverseSystem
{ι : Type u_1} [Preorder ι] {F : ι → Type u_4} {T : ⦃i j : ι⦄ → i ≤ j → Sort u_8} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun x1 x2 x3 => ⇑(f x1 x2 x3)] ⦃i j k : ι⦄ (hij : i ≤ j) (hjk : j ≤ k) (x : F i) : (f j k hjk) ((f i j hij) x) = (f i k ⋯) x - Module.DirectedSystem.map_map 📋 Mathlib.Algebra.Colimit.Module
{ι : Type u_1} [Preorder ι] {F : ι → Type u_4} {T : ⦃i j : ι⦄ → i ≤ j → Sort u_8} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun x1 x2 x3 => ⇑(f x1 x2 x3)] ⦃i j k : ι⦄ (hij : i ≤ j) (hjk : j ≤ k) (x : F i) : (f j k hjk) ((f i j hij) x) = (f i k ⋯) x - CategoryTheory.homOfLE_comp 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {x y z : X} (h : x ≤ y) (k : y ≤ z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE h) (CategoryTheory.homOfLE k) = CategoryTheory.homOfLE ⋯ - CategoryTheory.eqToHom_comp_homOfLE 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : a = b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.homOfLE hbc) = CategoryTheory.homOfLE ⋯ - CategoryTheory.homOfLE_comp_eqToHom 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : a ≤ b) (hbc : b = c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab) (CategoryTheory.eqToHom hbc) = CategoryTheory.homOfLE ⋯ - CategoryTheory.eqToHom_comp_homOfLE_assoc 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : a = b) (hbc : b ≤ c) {Z : X} (h : c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯) h - CategoryTheory.homOfLE_comp_eqToHom_assoc 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : a ≤ b) (hbc : b = c) {Z : X} (h : c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯) h - CategoryTheory.eqToHom_comp_homOfLE_op 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : Opposite.op a = Opposite.op b) (hbc : c ≤ b) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.homOfLE hbc).op = (CategoryTheory.homOfLE ⋯).op - CategoryTheory.homOfLE_op_comp_eqToHom 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : b ≤ a) (hbc : Opposite.op b = Opposite.op c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab).op (CategoryTheory.eqToHom hbc) = (CategoryTheory.homOfLE ⋯).op - CategoryTheory.eqToHom_comp_homOfLE_op_assoc 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : Opposite.op a = Opposite.op b) (hbc : c ≤ b) {Z : Xᵒᵖ} (h : Opposite.op c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hbc).op h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯).op h - CategoryTheory.homOfLE_op_comp_eqToHom_assoc 📋 Mathlib.CategoryTheory.Category.Preorder
{X : Type u} [Preorder X] {a b c : X} (hab : b ≤ a) (hbc : Opposite.op b = Opposite.op c) {Z : Xᵒᵖ} (h : Opposite.op c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab).op (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯).op h - CategoryTheory.Subobject.ofMkLE_comp_ofLEMk 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h₁ : CategoryTheory.Subobject.mk f ≤ X) (h₂ : X ≤ CategoryTheory.Subobject.mk g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X h₁) (X.ofLEMk g h₂) = CategoryTheory.Subobject.ofMkLEMk f g ⋯ - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLEMk 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ A₃ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h : A₃ ⟶ B) [CategoryTheory.Mono h] (h₁ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) (h₂ : CategoryTheory.Subobject.mk g ≤ CategoryTheory.Subobject.mk h) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h₁) (CategoryTheory.Subobject.ofMkLEMk g h h₂) = CategoryTheory.Subobject.ofMkLEMk f h ⋯ - CategoryTheory.Subobject.ofLE_comp_ofLEMk 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A : C} (X Y : CategoryTheory.Subobject B) (f : A ⟶ B) [CategoryTheory.Mono f] (h₁ : X ≤ Y) (h₂ : Y ≤ CategoryTheory.Subobject.mk f) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h₁) (Y.ofLEMk f h₂) = X.ofLEMk f ⋯ - CategoryTheory.Subobject.ofMkLE_comp_ofLE 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (X Y : CategoryTheory.Subobject B) (h₁ : CategoryTheory.Subobject.mk f ≤ X) (h₂ : X ≤ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X h₁) (X.ofLE Y h₂) = CategoryTheory.Subobject.ofMkLE f Y ⋯ - CategoryTheory.Subobject.ofLEMk_comp_ofMkLEMk 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (X : CategoryTheory.Subobject B) (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h₁ : X ≤ CategoryTheory.Subobject.mk f) (h₂ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f h₁) (CategoryTheory.Subobject.ofMkLEMk f g h₂) = X.ofLEMk g ⋯ - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLE 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (X : CategoryTheory.Subobject B) (h₁ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) (h₂ : CategoryTheory.Subobject.mk g ≤ X) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h₁) (CategoryTheory.Subobject.ofMkLE g X h₂) = CategoryTheory.Subobject.ofMkLE f X ⋯ - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLEMk_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ A₃ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h : A₃ ⟶ B) [CategoryTheory.Mono h] (h₁ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) (h₂ : CategoryTheory.Subobject.mk g ≤ CategoryTheory.Subobject.mk h) {Z : C} (h✝ : A₃ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h₁) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk g h h₂) h✝) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f h ⋯) h✝ - CategoryTheory.Subobject.ofLE_comp_ofLE 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B : C} (X Y Z : CategoryTheory.Subobject B) (h₁ : X ≤ Y) (h₂ : Y ≤ Z) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h₁) (Y.ofLE Z h₂) = X.ofLE Z ⋯ - CategoryTheory.Subobject.ofLEMk_comp_ofMkLE 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A ⟶ B) [CategoryTheory.Mono f] (Y : CategoryTheory.Subobject B) (h₁ : X ≤ CategoryTheory.Subobject.mk f) (h₂ : CategoryTheory.Subobject.mk f ≤ Y) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f h₁) (CategoryTheory.Subobject.ofMkLE f Y h₂) = X.ofLE Y ⋯ - CategoryTheory.Subobject.ofMkLE_comp_ofLEMk_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h₁ : CategoryTheory.Subobject.mk f ≤ X) (h₂ : X ≤ CategoryTheory.Subobject.mk g) {Z : C} (h : A₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X h₁) (CategoryTheory.CategoryStruct.comp (X.ofLEMk g h₂) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g ⋯) h - CategoryTheory.Subobject.ofLEMk_comp_ofMkLEMk_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (X : CategoryTheory.Subobject B) (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (h₁ : X ≤ CategoryTheory.Subobject.mk f) (h₂ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) {Z : C} (h : A₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f h₁) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h₂) h) = CategoryTheory.CategoryStruct.comp (X.ofLEMk g ⋯) h - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLE_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ A₂ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (g : A₂ ⟶ B) [CategoryTheory.Mono g] (X : CategoryTheory.Subobject B) (h₁ : CategoryTheory.Subobject.mk f ≤ CategoryTheory.Subobject.mk g) (h₂ : CategoryTheory.Subobject.mk g ≤ X) {Z : C} (h : CategoryTheory.Subobject.underlying.obj X ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h₁) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE g X h₂) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X ⋯) h - CategoryTheory.Subobject.ofLE_comp_ofLEMk_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A : C} (X Y : CategoryTheory.Subobject B) (f : A ⟶ B) [CategoryTheory.Mono f] (h₁ : X ≤ Y) (h₂ : Y ≤ CategoryTheory.Subobject.mk f) {Z : C} (h : A ⟶ Z) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h₁) (CategoryTheory.CategoryStruct.comp (Y.ofLEMk f h₂) h) = CategoryTheory.CategoryStruct.comp (X.ofLEMk f ⋯) h - CategoryTheory.Subobject.ofMkLE_comp_ofLE_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A₁ : C} (f : A₁ ⟶ B) [CategoryTheory.Mono f] (X Y : CategoryTheory.Subobject B) (h₁ : CategoryTheory.Subobject.mk f ≤ X) (h₂ : X ≤ Y) {Z : C} (h : CategoryTheory.Subobject.underlying.obj Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X h₁) (CategoryTheory.CategoryStruct.comp (X.ofLE Y h₂) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f Y ⋯) h - CategoryTheory.Subobject.ofLEMk_comp_ofMkLE_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A ⟶ B) [CategoryTheory.Mono f] (Y : CategoryTheory.Subobject B) (h₁ : X ≤ CategoryTheory.Subobject.mk f) (h₂ : CategoryTheory.Subobject.mk f ≤ Y) {Z : C} (h : CategoryTheory.Subobject.underlying.obj Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f h₁) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f Y h₂) h) = CategoryTheory.CategoryStruct.comp (X.ofLE Y ⋯) h - CategoryTheory.Subobject.ofLE_comp_ofLE_assoc 📋 Mathlib.CategoryTheory.Subobject.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {B : C} (X Y Z : CategoryTheory.Subobject B) (h₁ : X ≤ Y) (h₂ : Y ≤ Z) {Z✝ : C} (h : CategoryTheory.Subobject.underlying.obj Z ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h₁) (CategoryTheory.CategoryStruct.comp (Y.ofLE Z h₂) h) = CategoryTheory.CategoryStruct.comp (X.ofLE Z ⋯) h - ContinuousMap.inclusion_comp_inclusion 📋 Mathlib.Topology.ContinuousMap.Basic
{α : Type u_1} [TopologicalSpace α] {r s t : Set α} (hst : s ⊆ t) (hrs : r ⊆ s) : (ContinuousMap.inclusion hst).comp (ContinuousMap.inclusion hrs) = ContinuousMap.inclusion ⋯ - CategoryTheory.ComposableArrows.Mk₁.map_comp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X₀ X₁ : C} (f : X₀ ⟶ X₁) {i j k : Fin 2} (hij : i ≤ j) (hjk : j ≤ k) : CategoryTheory.ComposableArrows.Mk₁.map f i k ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.Mk₁.map f i j hij) (CategoryTheory.ComposableArrows.Mk₁.map f j k hjk) - CategoryTheory.ComposableArrows.Precomp.map_comp 📋 Mathlib.CategoryTheory.ComposableArrows.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {n : ℕ} (F : CategoryTheory.ComposableArrows C n) {X : C} (f : X ⟶ F.left) {i j k : Fin (n + 1 + 1)} (hij : i ≤ j) (hjk : j ≤ k) : CategoryTheory.ComposableArrows.Precomp.map F f i k ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.ComposableArrows.Precomp.map F f i j hij) (CategoryTheory.ComposableArrows.Precomp.map F f j k hjk) - SSet.Subcomplex.homOfLE_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) {S₃ : X.Subcomplex} (h' : S₂ ≤ S₃) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) (SSet.Subcomplex.homOfLE h') = SSet.Subcomplex.homOfLE ⋯ - SSet.Subcomplex.homOfLE_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex
{X : SSet} {S₁ S₂ : X.Subcomplex} (h : S₁ ≤ S₂) {S₃ : X.Subcomplex} (h' : S₂ ≤ S₃) {Z : SSet} (h✝ : S₃.toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE h') h✝) = CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) h✝ - CategoryTheory.Triangulated.TStructure.natTransTruncGEOfLE_trans 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLTGE
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (t.natTransTruncGEOfLE a b hab) (t.natTransTruncGEOfLE b c hbc) = t.natTransTruncGEOfLE a c ⋯ - CategoryTheory.Triangulated.TStructure.natTransTruncLTOfLE_trans 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLTGE
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (t.natTransTruncLTOfLE a b hab) (t.natTransTruncLTOfLE b c hbc) = t.natTransTruncLTOfLE a c ⋯ - CategoryTheory.Triangulated.TStructure.natTransTriangleLTGEOfLE_trans 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLTGE
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (t.natTransTriangleLTGEOfLE a b hab) (t.natTransTriangleLTGEOfLE b c hbc) = t.natTransTriangleLTGEOfLE a c ⋯ - CategoryTheory.Triangulated.TStructure.natTransTruncGEOfLE_trans_app 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLTGE
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) (X : C) : CategoryTheory.CategoryStruct.comp ((t.natTransTruncGEOfLE a b hab).app X) ((t.natTransTruncGEOfLE b c hbc).app X) = (t.natTransTruncGEOfLE a c ⋯).app X - CategoryTheory.Triangulated.TStructure.natTransTruncLTOfLE_trans_app 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLTGE
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) (X : C) : CategoryTheory.CategoryStruct.comp ((t.natTransTruncLTOfLE a b hab).app X) ((t.natTransTruncLTOfLE b c hbc).app X) = (t.natTransTruncLTOfLE a c ⋯).app X - CategoryTheory.Triangulated.TStructure.natTransTruncLEOfLE_trans 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLEGT
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (t.natTransTruncLEOfLE a b hab) (t.natTransTruncLEOfLE b c hbc) = t.natTransTruncLEOfLE a c ⋯ - CategoryTheory.Triangulated.TStructure.natTransTruncLEOfLE_trans_app 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLEGT
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) (X : C) : CategoryTheory.CategoryStruct.comp ((t.natTransTruncLEOfLE a b hab).app X) ((t.natTransTruncLEOfLE b c hbc).app X) = (t.natTransTruncLEOfLE a c ⋯).app X - CategoryTheory.Triangulated.TStructure.natTransTruncLEOfLE_trans_app_assoc 📋 Mathlib.CategoryTheory.Triangulated.TStructure.TruncLEGT
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) (a b c : ℤ) (hab : a ≤ b) (hbc : b ≤ c) (X : C) {Z : C} (h : (t.truncLE c).obj X ⟶ Z) : CategoryTheory.CategoryStruct.comp ((t.natTransTruncLEOfLE a b hab).app X) (CategoryTheory.CategoryStruct.comp ((t.natTransTruncLEOfLE b c hbc).app X) h) = CategoryTheory.CategoryStruct.comp ((t.natTransTruncLEOfLE a c ⋯).app X) h - CategoryTheory.Functor.OfSequence.map_comp 📋 Mathlib.CategoryTheory.Functor.OfSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : ℕ → C} (f : (n : ℕ) → X n ⟶ X (n + 1)) (i j k : ℕ) (hij : i ≤ j) (hjk : j ≤ k) : CategoryTheory.Functor.OfSequence.map f i k ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OfSequence.map f i j hij) (CategoryTheory.Functor.OfSequence.map f j k hjk) - CategoryTheory.Functor.OfSequence.map_comp_assoc 📋 Mathlib.CategoryTheory.Functor.OfSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : ℕ → C} (f : (n : ℕ) → X n ⟶ X (n + 1)) (i j k : ℕ) (hij : i ≤ j) (hjk : j ≤ k) {Z : C} (h : X k ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OfSequence.map f i k ⋯) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OfSequence.map f i j hij) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OfSequence.map f j k hjk) h) - CategoryTheory.ComposableArrows.twoδ₁Toδ₀' 📋 Mathlib.CategoryTheory.ComposableArrows.Two
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) : CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE ⋯) ⟶ CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₁₂) - CategoryTheory.ComposableArrows.twoδ₂Toδ₁' 📋 Mathlib.CategoryTheory.ComposableArrows.Two
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) : CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁) ⟶ CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE ⋯) - CategoryTheory.Abelian.SpectralObject.mono_H_map_twoδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] [CategoryTheory.Abelian C] {ι' : Type u_3} [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (n₀ : ℤ) (i₀ i₁ i₂ : ι') (h₀₁ : i₀ ≤ i₁) (h₁₂ : i₁ ≤ i₂) (h₁ : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE h₀₁)))) : CategoryTheory.Mono ((X'.H n₀).map (CategoryTheory.ComposableArrows.twoδ₁Toδ₀' i₀ i₁ i₂ h₀₁ h₁₂)) - CategoryTheory.Abelian.SpectralObject.epi_H_map_twoδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] [CategoryTheory.Abelian C] {ι' : Type u_3} [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (n₀ n₁ : ℤ) (hn₁ : n₀ + 1 = n₁) (i₀ i₁ i₂ : ι') (h₀₁ : i₀ ≤ i₁) (h₁₂ : i₁ ≤ i₂) (h₂ : CategoryTheory.Limits.IsZero ((X'.H n₁).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE h₀₁)))) : CategoryTheory.Epi ((X'.H n₀).map (CategoryTheory.ComposableArrows.twoδ₁Toδ₀' i₀ i₁ i₂ h₀₁ h₁₂)) - CategoryTheory.Abelian.SpectralObject.isIso_H_map_twoδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.Basic
{C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] [CategoryTheory.Abelian C] {ι' : Type u_3} [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (n₀ n₁ : ℤ) (hn₁ : n₀ + 1 = n₁) (i₀ i₁ i₂ : ι') (h₀₁ : i₀ ≤ i₁) (h₁₂ : i₁ ≤ i₂) (h₁ : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE h₀₁)))) (h₂ : CategoryTheory.Limits.IsZero ((X'.H n₁).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE h₀₁)))) : CategoryTheory.IsIso ((X'.H n₀).map (CategoryTheory.ComposableArrows.twoδ₁Toδ₀' i₀ i₁ i₂ h₀₁ h₁₂)) - CategoryTheory.ComposableArrows.threeδ₁Toδ₀' 📋 Mathlib.CategoryTheory.ComposableArrows.Three
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) : CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) ⟶ CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) - CategoryTheory.ComposableArrows.threeδ₃Toδ₂' 📋 Mathlib.CategoryTheory.ComposableArrows.Three
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) : CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) ⟶ CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE ⋯) - CategoryTheory.ComposableArrows.threeδ₂Toδ₁' 📋 Mathlib.CategoryTheory.ComposableArrows.Three
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) : CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE ⋯) ⟶ CategoryTheory.ComposableArrows.mk₂ (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) - CategoryTheory.ComposableArrows.fourδ₁Toδ₀' 📋 Mathlib.CategoryTheory.ComposableArrows.Four
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ i₄ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) : CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) ⟶ CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) - CategoryTheory.ComposableArrows.fourδ₄Toδ₃' 📋 Mathlib.CategoryTheory.ComposableArrows.Four
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ i₄ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) : CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) ⟶ CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) - CategoryTheory.ComposableArrows.fourδ₂Toδ₁' 📋 Mathlib.CategoryTheory.ComposableArrows.Four
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ i₄ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) : CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₃₄) ⟶ CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) - CategoryTheory.ComposableArrows.fourδ₃Toδ₂' 📋 Mathlib.CategoryTheory.ComposableArrows.Four
{ι : Type u_1} [Preorder ι] (i₀ i₁ i₂ i₃ i₄ : ι) (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) : CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) ⟶ CategoryTheory.ComposableArrows.mk₃ (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₃₄) - CategoryTheory.Abelian.SpectralObject.mapFourδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : X'.E (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ ⟶ X'.E (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.mapFourδ₄Toδ₃' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) n₀ n₁ n₂ hn₁ hn₂ ⟶ X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.mapFourδ₂Toδ₁' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ ⟶ X'.E (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : X'.E (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ ≅ X'.E (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₃' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) n₀ n₁ n₂ hn₁ hn₂ ≅ X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.isIso_mapFourδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.IsIso (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isIso_mapFourδ₄Toδ₃' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.IsIso (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.mapFourδ₁Toδ₀'_comp 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₃ i₄ i₅ hi₀₁ ⋯ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) (X'.mapFourδ₁Toδ₀' i₁ i₂ i₃ i₄ i₅ hi₁₂ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) = X'.mapFourδ₁Toδ₀' i₀ i₂ i₃ i₄ i₅ ⋯ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.mapFourδ₄Toδ₃'_comp 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₄ i₅ hi₀₁ hi₁₂ ⋯ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) = X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₅ hi₀₁ hi₁₂ hi₂₃ ⋯ n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀'_hom 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X'.isoMapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).hom = X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₃'_hom 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X'.isoMapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).hom = X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂ - CategoryTheory.Abelian.SpectralObject.mapFourδ₁Toδ₀'_comp_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h : X'.E (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) (CategoryTheory.homOfLE hi₄₅) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₃ i₄ i₅ hi₀₁ ⋯ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₁ i₂ i₃ i₄ i₅ hi₁₂ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) h) = CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₂ i₃ i₄ i₅ ⋯ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) h - CategoryTheory.Abelian.SpectralObject.mapFourδ₄Toδ₃'_comp_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₄ i₅ hi₀₁ hi₁₂ ⋯ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) h) = CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₅ hi₀₁ hi₁₂ hi₂₃ ⋯ n₀ n₁ n₂ hn₁ hn₂) h - CategoryTheory.Abelian.SpectralObject.mapFourδ₁Toδ₀'_mapFourδ₃Toδ₃' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (X'.mapFourδ₄Toδ₃' i₁ i₂ i₃ i₄ i₅ hi₁₂ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) = CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₂ i₃ i₄ i₅ ⋯ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₅ hi₀₁ hi₁₂ hi₂₃ ⋯ n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀'_inv_hom_id 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) = CategoryTheory.CategoryStruct.id (X'.E (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₄'_hom_inv_id 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (X'.isoMapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv = CategoryTheory.CategoryStruct.id (X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀'_inv_hom_id_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h✝ : X'.E (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) h✝) = h✝ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₄'_hom_inv_id_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h✝ : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv h✝) = h✝ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀'_hom_inv_id 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (X'.isoMapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv = CategoryTheory.CategoryStruct.id (X'.E (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₄'_inv_hom_id 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) = CategoryTheory.CategoryStruct.id (X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₁Toδ₀'_hom_inv_id_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₂).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₀₁)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h✝ : X'.E (CategoryTheory.homOfLE ⋯) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE hi₃₄) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv h✝) = h✝ - CategoryTheory.Abelian.SpectralObject.isoMapFourδ₄Toδ₄'_inv_hom_id_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h : CategoryTheory.Limits.IsZero ((X'.H n₀).obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE hi₃₄)))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h✝ : X'.E (CategoryTheory.homOfLE hi₀₁) (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.isoMapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ h hn₁ hn₂).inv (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) h✝) = h✝ - CategoryTheory.Abelian.SpectralObject.mapFourδ₁Toδ₀'_mapFourδ₃Toδ₃'_assoc 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ i₅ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (hi₄₅ : i₄ ≤ i₅) (n₀ n₁ n₂ : ℤ) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) {Z : C} (h : X'.E (CategoryTheory.homOfLE hi₁₂) (CategoryTheory.homOfLE hi₂₃) (CategoryTheory.homOfLE ⋯) n₀ n₁ n₂ hn₁ hn₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₁ i₂ i₃ i₄ i₅ hi₁₂ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) h) = CategoryTheory.CategoryStruct.comp (X'.mapFourδ₄Toδ₃' i₀ i₂ i₃ i₄ i₅ ⋯ hi₂₃ hi₃₄ hi₄₅ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.CategoryStruct.comp (X'.mapFourδ₁Toδ₀' i₀ i₁ i₂ i₃ i₅ hi₀₁ hi₁₂ hi₂₃ ⋯ n₀ n₁ n₂ hn₁ hn₂) h) - CategoryTheory.Abelian.SpectralObject.isIso_mapFourδ₂Toδ₁' 📋 Mathlib.Algebra.Homology.SpectralObject.EpiMono
{C : Type u_1} {ι' : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι'] (X' : CategoryTheory.Abelian.SpectralObject C ι') (i₀ i₁ i₂ i₃ i₄ : ι') (hi₀₁ : i₀ ≤ i₁) (hi₁₂ : i₁ ≤ i₂) (hi₂₃ : i₂ ≤ i₃) (hi₃₄ : i₃ ≤ i₄) (n₀ n₁ n₂ : ℤ) (h₁ : CategoryTheory.IsIso ((X'.H n₁).map (CategoryTheory.ComposableArrows.twoδ₁Toδ₀' i₁ i₂ i₃ hi₁₂ hi₂₃))) (h₂ : CategoryTheory.IsIso ((X'.H n₂).map (CategoryTheory.ComposableArrows.twoδ₂Toδ₁' i₀ i₁ i₂ hi₀₁ hi₁₂))) (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.IsIso (X'.mapFourδ₂Toδ₁' i₀ i₁ i₂ i₃ i₄ hi₀₁ hi₁₂ hi₂₃ hi₃₄ n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.SpectralSequence.homologyIso 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq' : κ) [X.HasSpectralSequence data] : (CategoryTheory.Abelian.SpectralObject.SpectralSequence.page X data r hr).homology pq' ≅ (CategoryTheory.Abelian.SpectralObject.SpectralSequence.page X data r' ⋯).X pq' - CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.isIso_mapFourδ₁Toδ₀' 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq' pq'' : κ) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') [X.HasSpectralSequence data] (h : ¬(c r).Rel pq' pq'') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.IsIso (X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃ ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ hn₁ hn₂) - CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.isIso_mapFourδ₄Toδ₃' 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' : κ) (hpq : (c r).prev pq' = pq) (i₀ i₁ i₂ i₃ i₃' : ι) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') [X.HasSpectralSequence data] (h : ¬(c r).Rel pq pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.IsIso (X.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯) - CategoryTheory.Abelian.SpectralObject.SpectralSequence.homologyData_left_π 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') [X.HasSpectralSequence data] (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (CategoryTheory.Abelian.SpectralObject.SpectralSequence.homologyData X data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).left.π = X.mapFourδ₄Toδ₃' i₀' i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯ - CategoryTheory.Abelian.SpectralObject.SpectralSequence.homologyData_right_ι 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') [X.HasSpectralSequence data] (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (CategoryTheory.Abelian.SpectralObject.SpectralSequence.homologyData X data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).right.ι = X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯ - CategoryTheory.Abelian.SpectralObject.spectralSequenceHomologyData_left_π 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) [X.HasSpectralSequence data] (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X.spectralSequenceHomologyData data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).left.π = X.mapFourδ₄Toδ₃' i₀' i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯ - CategoryTheory.Abelian.SpectralObject.spectralSequenceHomologyData_right_ι 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) [X.HasSpectralSequence data] (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X.spectralSequenceHomologyData data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).right.ι = X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯ - CategoryTheory.Abelian.SpectralObject.spectralSequenceHomologyData_left_i 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) [X.HasSpectralSequence data] (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X.spectralSequenceHomologyData data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).left.i = CategoryTheory.CategoryStruct.comp (X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃ ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯) (X.spectralSequencePageXIso data r hr pq' i₀ i₁ i₂ i₃ hi₀ hi₁ hi₂ hi₃ n₀ n₁ n₂ hn₁' ⋯ ⋯).inv - CategoryTheory.Abelian.SpectralObject.spectralSequenceHomologyData_right_p 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) [X.HasSpectralSequence data] (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (hpq : (c r).prev pq' = pq) (hpq' : (c r).next pq' = pq'') (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : (X.spectralSequenceHomologyData data r r' hrr' hr pq pq' pq'' hpq hpq' i₀' i₀ i₁ i₂ i₃ i₃' hi₀' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' hn₁ hn₂).right.p = CategoryTheory.CategoryStruct.comp (X.spectralSequencePageXIso data r hr pq' i₀ i₁ i₂ i₃ hi₀ hi₁ hi₂ hi₃ n₀ n₁ n₂ hn₁' ⋯ ⋯).hom (X.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯) - CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.kf_w 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq' pq'' : κ) (i₀' i₀ i₁ i₂ i₃ : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃ ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ hn₁ hn₂) (CategoryTheory.Abelian.SpectralObject.SpectralSequence.pageXIso X data r hr pq' i₀ i₁ i₂ i₃ hi₀ hi₁ hi₂ hi₃ n₀ n₁ n₂ hn₁' hn₁ hn₂).inv) ((CategoryTheory.Abelian.SpectralObject.SpectralSequence.page X data r hr).d pq' pq'') = 0 - CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.cc_w 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' : κ) (i₀ i₁ i₂ i₃ i₃' : ι) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.Abelian.SpectralObject.SpectralSequence.page X data r hr).d pq pq') (CategoryTheory.CategoryStruct.comp (CategoryTheory.Abelian.SpectralObject.SpectralSequence.pageXIso X data r hr pq' i₀ i₁ i₂ i₃ hi₀ hi₁ hi₂ hi₃ n₀ n₁ n₂ hn₁' ⋯ ⋯).hom (X.mapFourδ₄Toδ₃' i₀ i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯)) = 0 - CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.fac 📋 Mathlib.Algebra.Homology.SpectralObject.SpectralSequence
{C : Type u_1} {ι : Type u_2} {κ : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] [Preorder ι] (X : CategoryTheory.Abelian.SpectralObject C ι) {c : ℤ → ComplexShape κ} {r₀ : ℤ} (data : CategoryTheory.Abelian.SpectralObject.SpectralSequenceDataCore ι c r₀) (r r' : ℤ) (hrr' : r + 1 = r') (hr : r₀ ≤ r) (pq pq' pq'' : κ) (i₀' i₀ i₁ i₂ i₃ i₃' : ι) (hi₀' : i₀' = data.i₀ r' pq' ⋯) (hi₀ : i₀ = data.i₀ r pq' ⋯) (hi₁ : i₁ = data.i₁ pq') (hi₂ : i₂ = data.i₂ pq') (hi₃ : i₃ = data.i₃ r pq' ⋯) (hi₃' : i₃' = data.i₃ r' pq' ⋯) (n₀ n₁ n₂ : ℤ) (hn₁' : n₁ = data.deg pq') (hn₁ : n₀ + 1 = n₁ := by lia) (hn₂ : n₁ + 1 = n₂ := by lia) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Fork.ι (CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.kf X data r r' hrr' hr pq' pq'' i₀' i₀ i₁ i₂ i₃ hi₀' hi₀ hi₁ hi₂ hi₃ n₀ n₁ n₂ hn₁' ⋯ ⋯)) (CategoryTheory.Limits.Cofork.π (CategoryTheory.Abelian.SpectralObject.SpectralSequence.HomologyData.cc X data r r' hrr' hr pq pq' i₀ i₁ i₂ i₃ i₃' hi₀ hi₁ hi₂ hi₃ hi₃' n₀ n₁ n₂ hn₁' ⋯ ⋯)) = CategoryTheory.CategoryStruct.comp (X.mapFourδ₄Toδ₃' i₀' i₁ i₂ i₃ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯) (X.mapFourδ₁Toδ₀' i₀' i₀ i₁ i₂ i₃' ⋯ ⋯ ⋯ ⋯ n₀ n₁ n₂ ⋯ ⋯) - MeasureTheory.sigmaFiniteTrim_mono 📋 Mathlib.MeasureTheory.Measure.Trim
{α : Type u_1} {m m₂ m0 : MeasurableSpace α} {μ : MeasureTheory.Measure α} (hm : m ≤ m0) (hm₂ : m₂ ≤ m) [MeasureTheory.SigmaFinite (μ.trim ⋯)] : MeasureTheory.SigmaFinite (μ.trim hm) - MeasureTheory.trim_trim 📋 Mathlib.MeasureTheory.Measure.Trim
{α : Type u_1} {m0 : MeasurableSpace α} {μ : MeasureTheory.Measure α} {m₁ m₂ : MeasurableSpace α} {hm₁₂ : m₁ ≤ m₂} {hm₂ : m₂ ≤ m0} : (μ.trim hm₂).trim hm₁₂ = μ.trim ⋯ - Affine.Simplex.face_restrict 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic
{k : Type u_1} {V : Type u_2} {P : Type u_5} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {n : ℕ} (s : Affine.Simplex k P n) {S : AffineSubspace k P} (hS : affineSpan k (Set.range s.points) ≤ S) {fs : Finset (Fin (n + 1))} {m : ℕ} (h : fs.card = m + 1) : (s.restrict S hS).face h = (s.face h).restrict S ⋯ - Affine.Simplex.faceOpposite_restrict 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic
{k : Type u_1} {V : Type u_2} {P : Type u_5} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex k P n) {S : AffineSubspace k P} (hS : affineSpan k (Set.range s.points) ≤ S) (i : Fin (n + 1)) : (s.restrict S hS).faceOpposite i = (s.faceOpposite i).restrict S ⋯ - Affine.Simplex.restrict_map_inclusion 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic
{k : Type u_1} {V : Type u_2} {P : Type u_5} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {n : ℕ} (s : Affine.Simplex k P n) (S₁ S₂ : AffineSubspace k P) (hS₁ : affineSpan k (Set.range s.points) ≤ S₁) (hS₂ : S₁ ≤ S₂) : (s.restrict S₁ hS₁).map (AffineSubspace.inclusion hS₂) ⋯ = s.restrict S₂ ⋯ - Affine.Simplex.restrict_map_restrict 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic
{k : Type u_1} {V : Type u_2} {V₂ : Type u_3} {P : Type u_5} {P₂ : Type u_6} [Ring k] [AddCommGroup V] [AddCommGroup V₂] [Module k V] [Module k V₂] [AddTorsor V P] [AddTorsor V₂ P₂] {n : ℕ} (s : Affine.Simplex k P n) (f : P →ᵃ[k] P₂) (hf : Function.Injective ⇑f) (S₁ : AffineSubspace k P) (S₂ : AffineSubspace k P₂) (hS₁ : affineSpan k (Set.range s.points) ≤ S₁) (hfS : AffineSubspace.map f S₁ ≤ S₂) : (s.restrict S₁ hS₁).map (f.restrict hfS) ⋯ = (s.map f hf).restrict S₂ ⋯ - ArchimedeanClass.FiniteElement.mk_add_mk 📋 Mathlib.Algebra.Order.Ring.StandardPart
{K : Type u_1} [LinearOrder K] [Field K] [IsOrderedRing K] (x y : K) (hx : 0 ≤ ArchimedeanClass.mk x) (hy : 0 ≤ ArchimedeanClass.mk y) : ArchimedeanClass.FiniteElement.mk x hx + ArchimedeanClass.FiniteElement.mk y hy = ArchimedeanClass.FiniteElement.mk (x + y) ⋯ - ArchimedeanClass.FiniteElement.mk_sub_mk 📋 Mathlib.Algebra.Order.Ring.StandardPart
{K : Type u_1} [LinearOrder K] [Field K] [IsOrderedRing K] (x y : K) (hx : 0 ≤ ArchimedeanClass.mk x) (hy : 0 ≤ ArchimedeanClass.mk y) : ArchimedeanClass.FiniteElement.mk x hx - ArchimedeanClass.FiniteElement.mk y hy = ArchimedeanClass.FiniteElement.mk (x - y) ⋯ - AlgebraicGeometry.StructureSheaf.comapₗ_const 📋 Mathlib.AlgebraicGeometry.StructureSheaf
{R M : Type u} [CommRing R] [AddCommGroup M] [Module R M] {S : Type u} [CommRing S] {N : Type u} [AddCommGroup N] [Module S N] {σ : R →+* S} (f : M →ₛₗ[σ] N) (U : TopologicalSpace.Opens ↑(AlgebraicGeometry.PrimeSpectrum.Top R)) (V : TopologicalSpace.Opens ↑(AlgebraicGeometry.PrimeSpectrum.Top S)) (hUV : V.carrier ⊆ PrimeSpectrum.comap σ ⁻¹' U.carrier) (a : M) (b : R) (hb : U ≤ PrimeSpectrum.basicOpen b) : (AlgebraicGeometry.StructureSheaf.comapₗ f U V hUV) (AlgebraicGeometry.StructureSheaf.const a b U hb) = AlgebraicGeometry.StructureSheaf.const (f a) (σ b) V ⋯ - AlgebraicGeometry.Scheme.Hom.appLE_map 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V V' : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : Opposite.op V ⟶ Opposite.op V') : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V e) (X.presheaf.map i) = AlgebraicGeometry.Scheme.Hom.appLE f U V' ⋯ - AlgebraicGeometry.Scheme.Hom.appLE_map_assoc 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V V' : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : Opposite.op V ⟶ Opposite.op V') {Z : CommRingCat} (h : X.presheaf.obj (Opposite.op V') ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V e) (CategoryTheory.CategoryStruct.comp (X.presheaf.map i) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V' ⋯) h - AlgebraicGeometry.Scheme.Hom.map_appLE 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U U' : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : Opposite.op U' ⟶ Opposite.op U) : CategoryTheory.CategoryStruct.comp (Y.presheaf.map i) (AlgebraicGeometry.Scheme.Hom.appLE f U V e) = AlgebraicGeometry.Scheme.Hom.appLE f U' V ⋯ - AlgebraicGeometry.Scheme.Hom.map_appLE_assoc 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U U' : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : Opposite.op U' ⟶ Opposite.op U) {Z : CommRingCat} (h : X.presheaf.obj (Opposite.op V) ⟶ Z) : CategoryTheory.CategoryStruct.comp (Y.presheaf.map i) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V e) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U' V ⋯) h - AlgebraicGeometry.Scheme.Hom.appLE_comp_appLE 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) (U : Z.Opens) (V : Y.Opens) (W : X.Opens) (e₁ : V ≤ (TopologicalSpace.Opens.map g.base).obj U) (e₂ : W ≤ (TopologicalSpace.Opens.map f.base).obj V) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE g U V e₁) (AlgebraicGeometry.Scheme.Hom.appLE f V W e₂) = AlgebraicGeometry.Scheme.Hom.appLE (CategoryTheory.CategoryStruct.comp f g) U W ⋯ - AlgebraicGeometry.Scheme.Hom.appLE_comp_appLE_assoc 📋 Mathlib.AlgebraicGeometry.Scheme
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) (U : Z.Opens) (V : Y.Opens) (W : X.Opens) (e₁ : V ≤ (TopologicalSpace.Opens.map g.base).obj U) (e₂ : W ≤ (TopologicalSpace.Opens.map f.base).obj V) {Z✝ : CommRingCat} (h : X.presheaf.obj (Opposite.op W) ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE g U V e₁) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f V W e₂) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE (CategoryTheory.CategoryStruct.comp f g) U W ⋯) h - AlgebraicGeometry.IsOpenImmersion.comp_lift 📋 Mathlib.AlgebraicGeometry.OpenImmersion
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Z) (g : Y ⟶ Z) [H : AlgebraicGeometry.IsOpenImmersion f] {Y' : AlgebraicGeometry.Scheme} (g' : Y' ⟶ Y) (H✝ : Set.range ⇑g ⊆ Set.range ⇑f) : CategoryTheory.CategoryStruct.comp g' (AlgebraicGeometry.IsOpenImmersion.lift f g H✝) = AlgebraicGeometry.IsOpenImmersion.lift f (CategoryTheory.CategoryStruct.comp g' g) ⋯ - AlgebraicGeometry.IsOpenImmersion.comp_lift_assoc 📋 Mathlib.AlgebraicGeometry.OpenImmersion
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Z) (g : Y ⟶ Z) [H : AlgebraicGeometry.IsOpenImmersion f] {Y' : AlgebraicGeometry.Scheme} (g' : Y' ⟶ Y) (H✝ : Set.range ⇑g ⊆ Set.range ⇑f) {Z✝ : AlgebraicGeometry.Scheme} (h : X ⟶ Z✝) : CategoryTheory.CategoryStruct.comp g' (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.IsOpenImmersion.lift f g H✝) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.IsOpenImmersion.lift f (CategoryTheory.CategoryStruct.comp g' g) ⋯) h - AlgebraicGeometry.Scheme.Hom.appLE_appIso_inv 📋 Mathlib.AlgebraicGeometry.OpenImmersion
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [AlgebraicGeometry.IsOpenImmersion f] {U : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V e) (AlgebraicGeometry.Scheme.Hom.appIso f V).inv = Y.presheaf.map (CategoryTheory.homOfLE ⋯).op - AlgebraicGeometry.Scheme.Hom.appLE_appIso_inv_assoc 📋 Mathlib.AlgebraicGeometry.OpenImmersion
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [AlgebraicGeometry.IsOpenImmersion f] {U : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) {Z : CommRingCat} (h : Y.presheaf.obj (Opposite.op ((AlgebraicGeometry.Scheme.Hom.opensFunctor f).obj V)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appLE f U V e) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.appIso f V).inv h) = CategoryTheory.CategoryStruct.comp (Y.presheaf.map (CategoryTheory.homOfLE ⋯).op) h - AlgebraicGeometry.Scheme.Hom.appLE_appIso_inv_apply 📋 Mathlib.AlgebraicGeometry.OpenImmersion
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [AlgebraicGeometry.IsOpenImmersion f] {U : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (x : ↑(Y.presheaf.obj (Opposite.op U))) : (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.appIso f V).inv) ((CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.appLE f U V e)) x) = (CategoryTheory.ConcreteCategory.hom (Y.presheaf.map (CategoryTheory.homOfLE ⋯).op)) x - AlgebraicGeometry.Scheme.homOfLE_homOfLE 📋 Mathlib.AlgebraicGeometry.Restrict
(X : AlgebraicGeometry.Scheme) {U V W : X.Opens} (e₁ : U ≤ V) (e₂ : V ≤ W) : CategoryTheory.CategoryStruct.comp (X.homOfLE e₁) (X.homOfLE e₂) = X.homOfLE ⋯ - AlgebraicGeometry.Scheme.homOfLE_homOfLE_assoc 📋 Mathlib.AlgebraicGeometry.Restrict
(X : AlgebraicGeometry.Scheme) {U V W : X.Opens} (e₁ : U ≤ V) (e₂ : V ≤ W) {Z : AlgebraicGeometry.Scheme} (h : ↑W ⟶ Z) : CategoryTheory.CategoryStruct.comp (X.homOfLE e₁) (CategoryTheory.CategoryStruct.comp (X.homOfLE e₂) h) = CategoryTheory.CategoryStruct.comp (X.homOfLE ⋯) h - AlgebraicGeometry.Scheme.Hom.map_resLE 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V V' : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : V' ≤ V) : CategoryTheory.CategoryStruct.comp (X.homOfLE i) (AlgebraicGeometry.Scheme.Hom.resLE f U V e) = AlgebraicGeometry.Scheme.Hom.resLE f U V' ⋯ - AlgebraicGeometry.Scheme.Hom.map_resLE_assoc 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V V' : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : V' ≤ V) {Z : AlgebraicGeometry.Scheme} (h : ↑U ⟶ Z) : CategoryTheory.CategoryStruct.comp (X.homOfLE i) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V e) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V' ⋯) h - AlgebraicGeometry.Scheme.Hom.resLE_map 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U U' : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : U ≤ U') : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V e) (Y.homOfLE i) = AlgebraicGeometry.Scheme.Hom.resLE f U' V ⋯ - AlgebraicGeometry.Scheme.Hom.resLE_map_assoc 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U U' : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) (i : U ≤ U') {Z : AlgebraicGeometry.Scheme} (h : ↑U' ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V e) (CategoryTheory.CategoryStruct.comp (Y.homOfLE i) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U' V ⋯) h - AlgebraicGeometry.Scheme.homOfLE_appLE 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} {U V : X.Opens} (e : U ≤ V) (W : (↑V).Opens) (W' : (↑U).Opens) (e' : W' ≤ (TopologicalSpace.Opens.map (X.homOfLE e).base).obj W) : AlgebraicGeometry.Scheme.Hom.appLE (X.homOfLE e) W W' e' = X.presheaf.map (CategoryTheory.homOfLE ⋯).op - AlgebraicGeometry.Scheme.Hom.resLE_comp_resLE 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) {Z : AlgebraicGeometry.Scheme} (g : Y ⟶ Z) {W : Z.Opens} (e' : U ≤ (TopologicalSpace.Opens.map g.base).obj W) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V e) (AlgebraicGeometry.Scheme.Hom.resLE g W U e') = AlgebraicGeometry.Scheme.Hom.resLE (CategoryTheory.CategoryStruct.comp f g) W V ⋯ - AlgebraicGeometry.Scheme.Hom.resLE_comp_resLE_assoc 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) {U : Y.Opens} {V : X.Opens} (e : V ≤ (TopologicalSpace.Opens.map f.base).obj U) {Z : AlgebraicGeometry.Scheme} (g : Y ⟶ Z) {W : Z.Opens} (e' : U ≤ (TopologicalSpace.Opens.map g.base).obj W) {Z✝ : AlgebraicGeometry.Scheme} (h : ↑W ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE f U V e) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE g W U e') h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.resLE (CategoryTheory.CategoryStruct.comp f g) W V ⋯) h - AlgebraicGeometry.morphismRestrict_appLE 📋 Mathlib.AlgebraicGeometry.Restrict
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (U : Y.Opens) (V : (↑U).Opens) (W : (↑((TopologicalSpace.Opens.map f.base).obj U)).Opens) (e : W ≤ (TopologicalSpace.Opens.map (f ∣_ U).base).obj V) : AlgebraicGeometry.Scheme.Hom.appLE (f ∣_ U) V W e = AlgebraicGeometry.Scheme.Hom.appLE f ((AlgebraicGeometry.Scheme.Hom.opensFunctor U.ι).obj V) ((AlgebraicGeometry.Scheme.Hom.opensFunctor ((TopologicalSpace.Opens.map f.base).obj U).ι).obj W) ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (h₁ : I ≤ J) (h₂ : J ≤ K) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₂) (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₁) = AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (hIJ : I ≤ J) (hJK : J ≤ K) (U : ↑X.affineOpens) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hJK U) (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hIJ U) = AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom ⋯ U - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_comp_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (h₁ : I ≤ J) (h₂ : J ≤ K) {Z : AlgebraicGeometry.Scheme} (h : I.subscheme ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₂) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₁) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯) h - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_comp_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (hIJ : I ≤ J) (hJK : J ≤ K) (U : ↑X.affineOpens) {Z : AlgebraicGeometry.Scheme} (h : I.glueDataObj U ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hJK U) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hIJ U) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom ⋯ U) h - AlgebraicGeometry.isIso_pushoutSection_of_iSup_eq 📋 Mathlib.AlgebraicGeometry.Morphisms.Flat
{X Y S T : AlgebraicGeometry.Scheme} {f : T ⟶ S} {g : Y ⟶ X} {iX : X ⟶ S} {iY : Y ⟶ T} (H : CategoryTheory.IsPullback g iY iX f) {US : S.Opens} {UT : T.Opens} {UX : X.Opens} (hUST : UT ≤ (TopologicalSpace.Opens.map f.base).obj US) (hUSX : UX ≤ (TopologicalSpace.Opens.map iX.base).obj US) {UY : Y.Opens} (hUY : UY = (TopologicalSpace.Opens.map g.base).obj UX ⊓ (TopologicalSpace.Opens.map iY.base).obj UT) {ι : Type u} [Finite ι] (VX : ι → X.Opens) (hVU : iSup VX = UX) (hV : ∀ (i : ι), CategoryTheory.IsIso (AlgebraicGeometry.pushoutSection H hUST ⋯ ⋯)) (hV' : ∀ (i j : ι), CategoryTheory.Mono (AlgebraicGeometry.pushoutSection H hUST ⋯ ⋯)) (hT : (CommRingCat.Hom.hom (AlgebraicGeometry.Scheme.Hom.appLE f US UT hUST)).Flat) : CategoryTheory.IsIso (AlgebraicGeometry.pushoutSection H hUST hUSX hUY) - AlgebraicGeometry.Scheme.PartialMap.restrict_restrict 📋 Mathlib.AlgebraicGeometry.Birational.RationalMap
{X Y : AlgebraicGeometry.Scheme} (f : X.PartialMap Y) (U : X.Opens) (hU : Dense ↑U) (hU' : U ≤ f.domain) (V : X.Opens) (hV : Dense ↑V) (hV' : V ≤ U) : (f.restrict U hU hU').restrict V hV hV' = f.restrict V hV ⋯ - AlgebraicGeometry.Scheme.PartialMap.restrict_restrict_hom 📋 Mathlib.AlgebraicGeometry.Birational.RationalMap
{X Y : AlgebraicGeometry.Scheme} (f : X.PartialMap Y) (U : X.Opens) (hU : Dense ↑U) (hU' : U ≤ f.domain) (V : X.Opens) (hV : Dense ↑V) (hV' : V ≤ U) : ((f.restrict U hU hU').restrict V hV hV').hom = (f.restrict V hV ⋯).hom - HomogeneousLocalization.map_comp 📋 Mathlib.RingTheory.GradedAlgebra.HomogeneousLocalization
{ι : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing A] [SetLike σ A] [AddSubgroupClass σ A] [AddCommMonoid ι] [DecidableEq ι] {𝒜 : ι → σ} [GradedRing 𝒜] {B : Type u_4} {τ : Type u_5} [CommRing B] [SetLike τ B] [AddSubgroupClass τ B] {ℬ : ι → τ} [GradedRing ℬ] {C : Type u_6} {ψ : Type u_7} [CommRing C] [SetLike ψ C] [AddSubgroupClass ψ C] {𝒞 : ι → ψ} [GradedRing 𝒞] {f : 𝒜 →+*ᵍ ℬ} {g : ℬ →+*ᵍ 𝒞} {P : Submonoid A} {Q : Submonoid B} {R : Submonoid C} (hpq : P ≤ Submonoid.comap f Q) (hqr : Q ≤ Submonoid.comap g R) : HomogeneousLocalization.map (g.comp f) ⋯ = (HomogeneousLocalization.map g hqr).comp (HomogeneousLocalization.map f hpq) - HomogeneousLocalization.map_map 📋 Mathlib.RingTheory.GradedAlgebra.HomogeneousLocalization
{ι : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing A] [SetLike σ A] [AddSubgroupClass σ A] [AddCommMonoid ι] [DecidableEq ι] {𝒜 : ι → σ} [GradedRing 𝒜] {B : Type u_4} {τ : Type u_5} [CommRing B] [SetLike τ B] [AddSubgroupClass τ B] {ℬ : ι → τ} [GradedRing ℬ] {C : Type u_6} {ψ : Type u_7} [CommRing C] [SetLike ψ C] [AddSubgroupClass ψ C] {𝒞 : ι → ψ} [GradedRing 𝒞] {f : 𝒜 →+*ᵍ ℬ} {g : ℬ →+*ᵍ 𝒞} {P : Submonoid A} {Q : Submonoid B} {R : Submonoid C} (hpq : P ≤ Submonoid.comap f Q) (hqr : Q ≤ Submonoid.comap g R) (x : HomogeneousLocalization 𝒜 P) : (HomogeneousLocalization.map g hqr) ((HomogeneousLocalization.map f hpq) x) = (HomogeneousLocalization.map (g.comp f) ⋯) x - Set.principalSegIioIicOfLE_apply 📋 Mathlib.Order.Interval.Set.InitialSeg
{α : Type u_1} [Preorder α] {i j : α} (h : i ≤ j) (k : ↑(Set.Iio i)) : (Set.principalSegIioIicOfLE h).toRelEmbedding k = ⟨↑k, ⋯⟩ - Set.principalSegIioIicOfLE_toRelEmbedding 📋 Mathlib.Order.Interval.Set.InitialSeg
{α : Type u_1} [Preorder α] {i j : α} (h : i ≤ j) (k : ↑(Set.Iio i)) : (Set.principalSegIioIicOfLE h).toRelEmbedding k = ⟨↑k, ⋯⟩ - CategoryTheory.SmallObject.SuccStruct.arrowMap_restrictionLE 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [LinearOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {j' : J} (hj' : j' ≤ j) (i₁ i₂ : J) (h₁₂ : i₁ ≤ i₂) (h₂ : i₂ ≤ j') : CategoryTheory.SmallObject.SuccStruct.arrowMap (CategoryTheory.SmallObject.restrictionLE F hj') i₁ i₂ h₁₂ h₂ = CategoryTheory.SmallObject.SuccStruct.arrowMap F i₁ i₂ h₁₂ ⋯ - CategoryTheory.SmallObject.restrictionLE_obj 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [PartialOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {i : J} (hi : i ≤ j) (k : J) (hk : k ≤ i) : (CategoryTheory.SmallObject.restrictionLE F hi).obj ⟨k, hk⟩ = F.obj ⟨k, ⋯⟩ - CategoryTheory.SmallObject.restrictionLT_obj 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [PartialOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {i : J} (hi : i ≤ j) (k : J) (hk : k < i) : (CategoryTheory.SmallObject.restrictionLT F hi).obj ⟨k, hk⟩ = F.obj ⟨k, ⋯⟩ - CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.mapEq_trans 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type w} [LinearOrder K] {x : K} {F G : CategoryTheory.Functor (↑(Set.Iic x)) C} {i₁ i₂ i₃ : K} (h₁₂ : i₁ ≤ i₂) (h₂₃ : i₂ ≤ i₃) {h₃ : i₃ ≤ x} (m₁₂ : CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq F G i₁ i₂ h₁₂ ⋯) (m₂₃ : CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq F G i₂ i₃ h₂₃ h₃) : CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq F G i₁ i₃ ⋯ h₃ - CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq.src 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type w} [LinearOrder K] {x : K} (F G : CategoryTheory.Functor (↑(Set.Iic x)) C) {k₁ k₂ : K} {h₁₂ : k₁ ≤ k₂} {h₂ : k₂ ≤ x} (h : CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq F G k₁ k₂ h₁₂ h₂) : F.obj ⟨k₁, ⋯⟩ = G.obj ⟨k₁, ⋯⟩ - CategoryTheory.SmallObject.SuccStruct.Iteration.mapObj_refl 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} {Φ : CategoryTheory.SmallObject.SuccStruct C} [LinearOrder J] [SuccOrder J] [OrderBot J] [CategoryTheory.Limits.HasIterationOfShape J C] [WellFoundedLT J] {j : J} (iter : Φ.Iteration j) {k l : J} (h : k ≤ l) (h' : l ≤ j) : iter.mapObj iter h ⋯ h' ⋯ = iter.F.map (CategoryTheory.homOfLE h) - CategoryTheory.SmallObject.SuccStruct.Iteration.mapObj_trans 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} {Φ : CategoryTheory.SmallObject.SuccStruct C} [LinearOrder J] [SuccOrder J] [OrderBot J] [CategoryTheory.Limits.HasIterationOfShape J C] [WellFoundedLT J] {j₁ j₂ j₃ : J} (iter₁ : Φ.Iteration j₁) (iter₂ : Φ.Iteration j₂) (iter₃ : Φ.Iteration j₃) {k₁ k₂ k₃ : J} (h₁₂ : k₁ ≤ k₂) (h₂₃ : k₂ ≤ k₃) (h₁ : k₁ ≤ j₁) (h₂ : k₂ ≤ j₂) (h₃ : k₃ ≤ j₃) (h₁₂' : j₁ ≤ j₂) (h₂₃' : j₂ ≤ j₃) : CategoryTheory.CategoryStruct.comp (iter₁.mapObj iter₂ h₁₂ h₁ h₂ h₁₂') (iter₂.mapObj iter₃ h₂₃ h₂ h₃ h₂₃') = iter₁.mapObj iter₃ ⋯ h₁ h₃ ⋯ - CategoryTheory.SmallObject.SuccStruct.Iteration.mapObj_trans_assoc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} {Φ : CategoryTheory.SmallObject.SuccStruct C} [LinearOrder J] [SuccOrder J] [OrderBot J] [CategoryTheory.Limits.HasIterationOfShape J C] [WellFoundedLT J] {j₁ j₂ j₃ : J} (iter₁ : Φ.Iteration j₁) (iter₂ : Φ.Iteration j₂) (iter₃ : Φ.Iteration j₃) {k₁ k₂ k₃ : J} (h₁₂ : k₁ ≤ k₂) (h₂₃ : k₂ ≤ k₃) (h₁ : k₁ ≤ j₁) (h₂ : k₂ ≤ j₂) (h₃ : k₃ ≤ j₃) (h₁₂' : j₁ ≤ j₂) (h₂₃' : j₂ ≤ j₃) {Z : C} (h : iter₃.F.obj ⟨k₃, h₃⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp (iter₁.mapObj iter₂ h₁₂ h₁ h₂ h₁₂') (CategoryTheory.CategoryStruct.comp (iter₂.mapObj iter₃ h₂₃ h₂ h₃ h₂₃') h) = CategoryTheory.CategoryStruct.comp (iter₁.mapObj iter₃ ⋯ h₁ h₃ ⋯) h - CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq.w 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type w} [LinearOrder K] {x : K} (F G : CategoryTheory.Functor (↑(Set.Iic x)) C) {k₁ k₂ : K} {h₁₂ : k₁ ≤ k₂} {h₂ : k₂ ≤ x} (h : CategoryTheory.SmallObject.SuccStruct.Iteration.subsingleton.MapEq F G k₁ k₂ h₁₂ h₂) : F.map (CategoryTheory.homOfLE h₁₂) = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.homOfLE h₁₂)) (CategoryTheory.eqToHom ⋯)) - CategoryTheory.SmallObject.SuccStruct.Iteration.congr_map 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} {Φ : CategoryTheory.SmallObject.SuccStruct C} [LinearOrder J] [SuccOrder J] [OrderBot J] [CategoryTheory.Limits.HasIterationOfShape J C] [WellFoundedLT J] {j₁ j₂ : J} (iter₁ : Φ.Iteration j₁) (iter₂ : Φ.Iteration j₂) {k₁ k₂ : J} (h : k₁ ≤ k₂) (h₁ : k₂ ≤ j₁) (h₂ : k₂ ≤ j₂) : iter₁.F.map (CategoryTheory.homOfLE h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (CategoryTheory.CategoryStruct.comp (iter₂.F.map (CategoryTheory.homOfLE h)) (CategoryTheory.eqToHom ⋯)) - CategoryTheory.SmallObject.coconeOfLE_ι_app 📋 Mathlib.CategoryTheory.SmallObject.Iteration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [PartialOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {i : J} (hi : i ≤ j) (i✝ : ↑(Set.Iio i)) : (CategoryTheory.SmallObject.coconeOfLE F hi).ι.app i✝ = F.map (CategoryTheory.homOfLE ⋯) - CategoryTheory.SmallObject.SuccStruct.arrowMap_extendToSucc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.SmallObject.SuccStruct.arrowMap (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ) i₁ i₂ hi ⋯ = CategoryTheory.SmallObject.SuccStruct.arrowMap F i₁ i₂ hi hi₂ - CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) (X : C) (i : ↑(Set.Iic j)) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨↑i, ⋯⟩ = F.obj i - CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (F : CategoryTheory.Functor (↑(Set.Iic j)) C) (X : C) (i : ↑(Set.Iic j)) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨↑i, ⋯⟩ ≅ F.obj i - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ Order.succ j) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨i₁, ⋯⟩ ⟶ CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨i₂, hi₂⟩ - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_id 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i : J) (hi : i ≤ Order.succ j) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i i ⋯ hi = CategoryTheory.CategoryStruct.id (CategoryTheory.SmallObject.SuccStruct.extendToSucc.obj F X ⟨i, ⋯⟩) - CategoryTheory.SmallObject.SuccStruct.extendToSucc_obj_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i : J) (hi : i ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).obj ⟨i, ⋯⟩ = F.obj ⟨i, hi⟩ - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i : J) (hi : i ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).obj ⟨i, ⋯⟩ ≅ F.obj ⟨i, hi⟩ - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_comp 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ i₃ : J) (h₁₂ : i₁ ≤ i₂) (h₂₃ : i₂ ≤ i₃) (h : i₃ ≤ Order.succ j) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i₁ i₃ ⋯ h = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i₁ i₂ h₁₂ ⋯) (CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i₂ i₃ h₂₃ h) - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_self_succ 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ j (Order.succ j) ⋯ ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨j, ⋯⟩).hom (CategoryTheory.CategoryStruct.comp τ (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objSuccIso hj F X).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSucc_map_le_succ 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ j ⋯).hom (CategoryTheory.CategoryStruct.comp τ (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjSuccIso hj F τ).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSucc.map_eq 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.SmallObject.SuccStruct.extendToSucc.map hj F τ i₁ i₂ hi ⋯ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨i₁, ⋯⟩).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSucc.objIso F X ⟨i₂, hi₂⟩).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso_hom_naturality 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (F.map (CategoryTheory.homOfLE hi)) - CategoryTheory.SmallObject.SuccStruct.extendToSucc_map 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) : (CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).inv) - CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso_hom_naturality_assoc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.ExtendToSucc
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] [SuccOrder J] {j : J} (hj : ¬IsMax j) (F : CategoryTheory.Functor (↑(Set.Iic j)) C) {X : C} (τ : F.obj ⟨j, ⋯⟩ ⟶ X) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ ≤ j) {Z : C} (h : F.obj ⟨i₂, hi₂⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.extendToSucc hj F τ).map (CategoryTheory.homOfLE hi)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₂ hi₂).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.extendToSuccObjIso hj F τ i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) h) - CategoryTheory.SmallObject.SuccStruct.ofCocone.map_comp 📋 Mathlib.CategoryTheory.SmallObject.Iteration.FunctorOfCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] {j : J} {F : CategoryTheory.Functor (↑(Set.Iio j)) C} (c : CategoryTheory.Limits.Cocone F) (i₁ i₂ i₃ : J) (hi : i₁ ≤ i₂) (hi' : i₂ ≤ i₃) (hi₃ : i₃ ≤ j) : CategoryTheory.SmallObject.SuccStruct.ofCocone.map c i₁ i₃ ⋯ hi₃ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCocone.map c i₁ i₂ hi ⋯) (CategoryTheory.SmallObject.SuccStruct.ofCocone.map c i₂ i₃ hi' hi₃) - CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso_hom_naturality 📋 Mathlib.CategoryTheory.SmallObject.Iteration.FunctorOfCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] {j : J} {F : CategoryTheory.Functor (↑(Set.Iio j)) C} (c : CategoryTheory.Limits.Cocone F) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ < j) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.ofCocone c).map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₂ hi₂).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₁ ⋯).hom (F.map (CategoryTheory.homOfLE hi)) - CategoryTheory.SmallObject.SuccStruct.ofCocone_map 📋 Mathlib.CategoryTheory.SmallObject.Iteration.FunctorOfCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] {j : J} {F : CategoryTheory.Functor (↑(Set.Iio j)) C} (c : CategoryTheory.Limits.Cocone F) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ < j) : (CategoryTheory.SmallObject.SuccStruct.ofCocone c).map (CategoryTheory.homOfLE hi) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₂ hi₂).inv) - CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso_hom_naturality_assoc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.FunctorOfCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] {j : J} {F : CategoryTheory.Functor (↑(Set.Iio j)) C} (c : CategoryTheory.Limits.Cocone F) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ < j) {Z : C} (h : F.obj ⟨i₂, hi₂⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.ofCocone c).map (CategoryTheory.homOfLE hi)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₂ hi₂).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) h) - CategoryTheory.SmallObject.SuccStruct.ofCocone_map_assoc 📋 Mathlib.CategoryTheory.SmallObject.Iteration.FunctorOfCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : Type u} [LinearOrder J] {j : J} {F : CategoryTheory.Functor (↑(Set.Iio j)) C} (c : CategoryTheory.Limits.Cocone F) (i₁ i₂ : J) (hi : i₁ ≤ i₂) (hi₂ : i₂ < j) {Z : C} (h : (CategoryTheory.SmallObject.SuccStruct.ofCocone c).obj ⟨i₂, ⋯⟩ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.SuccStruct.ofCocone c).map (CategoryTheory.homOfLE hi)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₁ ⋯).hom (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.homOfLE hi)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.SuccStruct.ofCoconeObjIso c i₂ hi₂).inv h)) - CategoryTheory.SmallObject.SuccStruct.arrowMk_iterationFunctor_map 📋 Mathlib.CategoryTheory.SmallObject.TransfiniteIteration
{C : Type u} [CategoryTheory.Category.{v, u} C] (Φ : CategoryTheory.SmallObject.SuccStruct C) {J : Type w} [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] [CategoryTheory.Limits.HasIterationOfShape J C] (i₁ i₂ : J) (h₁₂ : i₁ ≤ i₂) {j : J} (iter : Φ.Iteration j) (hj : i₂ ≤ j) : CategoryTheory.Arrow.mk ((Φ.iterationFunctor J).map (CategoryTheory.homOfLE h₁₂)) = CategoryTheory.Arrow.mk (iter.F.map (CategoryTheory.homOfLE h₁₂)) - CategoryTheory.Functor.WellOrderInductionData.Extension.map_limit 📋 Mathlib.CategoryTheory.SmallObject.WellOrderInductionData
{J : Type u} [LinearOrder J] [SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)} {d : F.WellOrderInductionData} [OrderBot J] {val₀ : F.obj (Opposite.op ⊥)} {j : J} (self : d.Extension val₀ j) (i : J) (hi : Order.IsSuccLimit i) (hij : i ≤ j) : (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE hij).op)) self.val = d.lift i hi ⟨fun x => match x with | Opposite.op ⟨k, hk⟩ => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) self.val, ⋯⟩ - CategoryTheory.Functor.WellOrderInductionData.Extension.mk 📋 Mathlib.CategoryTheory.SmallObject.WellOrderInductionData
{J : Type u} [LinearOrder J] [SuccOrder J] {F : CategoryTheory.Functor Jᵒᵖ (Type v)} {d : F.WellOrderInductionData} [OrderBot J] {val₀ : F.obj (Opposite.op ⊥)} {j : J} (val : F.obj (Opposite.op j)) (map_zero : (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) val = val₀) (map_succ : ∀ (i : J) (hi : i < j), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) val = d.succ i ⋯ ((CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) val)) (map_limit : ∀ (i : J) (hi : Order.IsSuccLimit i) (hij : i ≤ j), (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE hij).op)) val = d.lift i hi ⟨fun x => match x with | Opposite.op ⟨k, hk⟩ => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.homOfLE ⋯).op)) val, ⋯⟩) : d.Extension val₀ j - SSet.N.monoOfLE_comp 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y z : X.N} (h : x ≤ y) (h' : y ≤ z) : CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h) (SSet.N.monoOfLE h') = SSet.N.monoOfLE ⋯ - SSet.N.monoOfLE_comp_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y z : X.N} (h : x ≤ y) (h' : y ≤ z) {Z : SimplexCategory} (h✝ : { len := z.dim } ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h) (CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE h') h✝) = CategoryTheory.CategoryStruct.comp (SSet.N.monoOfLE ⋯) h✝ - lp.linearMapOfLE_comp 📋 Mathlib.Analysis.Normed.Lp.lpSpace
{𝕜 : Type u_1} {α : Type u_3} {E : α → Type u_4} [(i : α) → NormedAddCommGroup (E i)] [NormedRing 𝕜] [(i : α) → Module 𝕜 (E i)] [∀ (i : α), IsBoundedSMul 𝕜 (E i)] {p q r : ENNReal} (hpq : p ≤ q) (hqr : q ≤ r) : lp.linearMapOfLE 𝕜 E hqr ∘ₗ lp.linearMapOfLE 𝕜 E hpq = lp.linearMapOfLE 𝕜 E ⋯ - CategoryTheory.Subgroupoid.inclusion_trans 📋 Mathlib.CategoryTheory.Groupoid.Subgroupoid
{C : Type u} [CategoryTheory.Groupoid C] {R S T : CategoryTheory.Subgroupoid C} (k : R ≤ S) (h : S ≤ T) : CategoryTheory.Subgroupoid.inclusion ⋯ = (CategoryTheory.Subgroupoid.inclusion k).comp (CategoryTheory.Subgroupoid.inclusion h) - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap_comp 📋 Mathlib.CategoryTheory.Presentable.Directed
{J : Type w} [CategoryTheory.SmallCategory J] {κ : Cardinal.{w}} {D₁ D₂ D₃ : CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal J κ} (h₁₂ : D₁ ≤ D₂) (h₂₃ : D₂ ≤ D₃) : CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap h₁₂) (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap h₂₃) = CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap ⋯ - CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap_comp_assoc 📋 Mathlib.CategoryTheory.Presentable.Directed
{J : Type w} [CategoryTheory.SmallCategory J] {κ : Cardinal.{w}} {D₁ D₂ D₃ : CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal J κ} (h₁₂ : D₁ ≤ D₂) (h₂₃ : D₂ ≤ D₃) {Z : J} (h : D₃.top ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap h₁₂) (CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap h₂₃) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap ⋯) h - Cardinal.SharplyLT.succ_two_pow_of_le 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Lemmas
{κ₁ κ₂ : Cardinal.{u}} [Fact κ₁.IsRegular] (h₀ : κ₁ ≤ κ₂) (hκ₂ : Cardinal.aleph0 ≤ κ₂) : κ₁.SharplyLT (Order.succ (2 ^ κ₂)) - CategoryTheory.Triangulated.TStructure.triangleω₁δObjIso 📋 Mathlib.CategoryTheory.Triangulated.TStructure.SpectralObject
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.HasShift C ℤ] [∀ (n : ℤ), (CategoryTheory.shiftFunctor C n).Additive] [CategoryTheory.Pretriangulated C] (t : CategoryTheory.Triangulated.TStructure C) [CategoryTheory.IsTriangulated C] (a b c : EInt) (hab : a ≤ b) (hbc : b ≤ c) (X : C) : (t.triangleω₁δ a b c hab hbc).obj X ≅ (t.eTriangleLTGE.obj b).obj ((t.ω₁.obj (CategoryTheory.ComposableArrows.mk₁ (CategoryTheory.homOfLE ⋯))).obj X) - SimpleGraph.Copy.ofLE_comp 📋 Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {G₁ G₂ G₃ : SimpleGraph V} (h₁₂ : G₁ ≤ G₂) (h₂₃ : G₂ ≤ G₃) : (SimpleGraph.Copy.ofLE G₂ G₃ h₂₃).comp (SimpleGraph.Copy.ofLE G₁ G₂ h₁₂) = SimpleGraph.Copy.ofLE G₁ G₃ ⋯ - SimpleGraph.ComponentCompl.hom_trans 📋 Mathlib.Combinatorics.SimpleGraph.Ends.Defs
{V : Type u} {G : SimpleGraph V} {K L M : Set V} (C : G.ComponentCompl L) (h : K ⊆ L) (h' : M ⊆ K) : SimpleGraph.ComponentCompl.hom ⋯ C = SimpleGraph.ComponentCompl.hom h' (SimpleGraph.ComponentCompl.hom h C) - DiscreteQuotient.ofLE_ofLE 📋 Mathlib.Topology.DiscreteQuotient
{X : Type u_2} [TopologicalSpace X] {A B C : DiscreteQuotient X} (h₁ : A ≤ B) (h₂ : B ≤ C) (x : Quotient A.toSetoid) : DiscreteQuotient.ofLE h₂ (DiscreteQuotient.ofLE h₁ x) = DiscreteQuotient.ofLE ⋯ x - FirstOrder.Language.BoundedFormula.castLE_castLE 📋 Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {α : Type u'} {k m n : ℕ} (km : k ≤ m) (mn : m ≤ n) (φ : L.BoundedFormula α k) : FirstOrder.Language.BoundedFormula.castLE mn (FirstOrder.Language.BoundedFormula.castLE km φ) = FirstOrder.Language.BoundedFormula.castLE ⋯ φ - FirstOrder.Language.BoundedFormula.castLE_comp_castLE 📋 Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {α : Type u'} {k m n : ℕ} (km : k ≤ m) (mn : m ≤ n) : FirstOrder.Language.BoundedFormula.castLE mn ∘ FirstOrder.Language.BoundedFormula.castLE km = FirstOrder.Language.BoundedFormula.castLE ⋯
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 69fae59