Loogle!
Result
Found 241 declarations mentioning CategoryTheory.PreOneHypercover. Of these, only the first 200 are shown.
- CategoryTheory.PreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] (S : C) : Type (max (max u v) (w + 1)) - CategoryTheory.PreOneHypercover.trivial π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] (S : C) : CategoryTheory.PreOneHypercover S - CategoryTheory.PreOneHypercover.Iβ' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) : Type w - CategoryTheory.PreOneHypercover.instCategory π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} : CategoryTheory.Category.{max v u_2, max (max u v) (u_2 + 1)} (CategoryTheory.PreOneHypercover S) - CategoryTheory.PreOneHypercover.instNonempty π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} : Nonempty (CategoryTheory.PreOneHypercover S) - CategoryTheory.PreOneHypercover.multicospanShape π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) : CategoryTheory.Limits.MulticospanShape - CategoryTheory.PreOneHypercover.toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) : CategoryTheory.PreZeroHypercover S - CategoryTheory.PreOneHypercover.Hom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) : Type (max (max u_2 u_3) v) - CategoryTheory.PreOneHypercover.Y' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (i : E.Iβ') : C - CategoryTheory.PreOneHypercover.Hom.id π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) : E.Hom E - CategoryTheory.GrothendieckTopology.Cover.preOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) : CategoryTheory.PreOneHypercover X - CategoryTheory.GrothendieckTopology.OneHypercover.toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (self : J.OneHypercover S) : CategoryTheory.PreOneHypercover S - CategoryTheory.PreZeroHypercover.toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] : CategoryTheory.PreOneHypercover S - CategoryTheory.PreOneHypercover.multicospanShape_R π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) : E.multicospanShape.R = E.Iβ' - CategoryTheory.PreOneHypercover.oneToZero π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} : CategoryTheory.Functor (CategoryTheory.PreOneHypercover S) (CategoryTheory.PreZeroHypercover S) - CategoryTheory.PreOneHypercover.multicospanShape_L π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) : E.multicospanShape.L = E.Iβ - CategoryTheory.GrothendieckTopology.OneHypercover.trivial_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (S : C) : (CategoryTheory.GrothendieckTopology.OneHypercover.trivial J S).toPreOneHypercover = CategoryTheory.PreOneHypercover.trivial S - CategoryTheory.PreOneHypercover.Iβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) (iβ iβ : self.Iβ) : Type w - CategoryTheory.PreOneHypercover.multicospanIndex π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) : CategoryTheory.Limits.MulticospanIndex E.multicospanShape A - CategoryTheory.PreOneHypercover.Hom.sβ' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (k : E.Iβ') : F.Iβ' - CategoryTheory.PreOneHypercover.Hom.toHom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) : E.Hom F.toPreZeroHypercover - CategoryTheory.PreOneHypercover.Y π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) β¦iβ iβ : self.Iββ¦ (j : self.Iβ iβ iβ) : C - CategoryTheory.GrothendieckTopology.Cover.oneHypercover_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) : S.oneHypercover.toPreOneHypercover = S.preOneHypercover - CategoryTheory.PreOneHypercover.Hom.comp π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (g : F.Hom G) : E.Hom G - CategoryTheory.PreOneHypercover.multifork π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) : CategoryTheory.Limits.Multifork (E.multicospanIndex F) - CategoryTheory.PreOneHypercover.oneToZero_obj π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (f : CategoryTheory.PreOneHypercover S) : CategoryTheory.PreOneHypercover.oneToZero.obj f = f.toPreZeroHypercover - CategoryTheory.PreOneHypercover.Hom.mapMulticospan π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) : CategoryTheory.Functor (CategoryTheory.Limits.WalkingMulticospan E.multicospanShape) (CategoryTheory.Limits.WalkingMulticospan F.multicospanShape) - CategoryTheory.PreOneHypercover.equivalenceMulticospanOfIso π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (f : E β F) : CategoryTheory.Limits.WalkingMulticospan E.multicospanShape β CategoryTheory.Limits.WalkingMulticospan F.multicospanShape - CategoryTheory.GrothendieckTopology.OneHypercover.isoMk π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {E F : J.OneHypercover S} (f : E.toPreOneHypercover β F.toPreOneHypercover) : E β F - CategoryTheory.Precoverage.ZeroHypercover.toOneHypercover_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [E.HasPullbacks] : E.toOneHypercover.toPreOneHypercover = E.toPreOneHypercover - CategoryTheory.PreOneHypercover.Hom.id_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (a : E.Iβ) : (CategoryTheory.PreOneHypercover.Hom.id E).sβ a = a - CategoryTheory.PreOneHypercover.Hom.id_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ jβ : E.Iβ} (a : E.Iβ iβ jβ) : (CategoryTheory.PreOneHypercover.Hom.id E).sβ a = a - CategoryTheory.PreOneHypercover.pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) β¦iβ iβ : self.Iββ¦ (j : self.Iβ iβ iβ) : self.Y j βΆ self.X iβ - CategoryTheory.PreOneHypercover.pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) β¦iβ iβ : self.Iββ¦ (j : self.Iβ iβ iβ) : self.Y j βΆ self.X iβ - CategoryTheory.PreZeroHypercover.refineOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) [E.HasPullbacks] (F : (i j : E.Iβ) β CategoryTheory.PreZeroHypercover (CategoryTheory.Limits.pullback (E.f i) (E.f j))) : CategoryTheory.PreOneHypercover X - CategoryTheory.PreOneHypercover.id_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (a : E.Iβ) : (CategoryTheory.CategoryStruct.id E).sβ a = a - CategoryTheory.PreOneHypercover.multicospanIndex_left π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) (i : E.multicospanShape.L) : (E.multicospanIndex F).left i = F.obj (Opposite.op (E.X i)) - CategoryTheory.PreOneHypercover.id_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ jβ : E.Iβ} (a : E.Iβ iβ jβ) : (CategoryTheory.CategoryStruct.id E).sβ a = a - CategoryTheory.PreOneHypercover.sieveβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} {W : C} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) : CategoryTheory.Sieve W - CategoryTheory.PreOneHypercover.oneToZero_map π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {Xβ Yβ : CategoryTheory.PreOneHypercover S} (f : Xβ βΆ Yβ) : CategoryTheory.PreOneHypercover.oneToZero.map f = f.toHom - CategoryTheory.PreOneHypercover.congrIndexOneOfEq_refl π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} (i j : E.Iβ) : CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β― = Equiv.refl (E.Iβ i j) - CategoryTheory.PreOneHypercover.congrIndexOneOfEq π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') : E.Iβ i j β E.Iβ i' j' - CategoryTheory.PreOneHypercover.Hom.id_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ jβ : E.Iβ} (xβ : E.Iβ iβ jβ) : (CategoryTheory.PreOneHypercover.Hom.id E).hβ xβ = CategoryTheory.CategoryStruct.id (E.Y xβ) - CategoryTheory.PreOneHypercover.Hom.id_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (xβ : E.Iβ) : (CategoryTheory.PreOneHypercover.Hom.id E).hβ xβ = CategoryTheory.CategoryStruct.id (E.X xβ) - CategoryTheory.PreOneHypercover.Hom.sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) : F.Iβ (self.sβ i) (self.sβ j) - CategoryTheory.PreOneHypercover.id_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ jβ : E.Iβ} (xβ : E.Iβ iβ jβ) : (CategoryTheory.CategoryStruct.id E).hβ xβ = CategoryTheory.CategoryStruct.id (E.Y xβ) - CategoryTheory.PreOneHypercover.id_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (xβ : E.Iβ) : (CategoryTheory.CategoryStruct.id E).hβ xβ = CategoryTheory.CategoryStruct.id (E.X xβ) - CategoryTheory.PreOneHypercover.equivalenceMulticospanOfIso_functor π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (f : E β F) : (CategoryTheory.PreOneHypercover.equivalenceMulticospanOfIso f).functor = CategoryTheory.PreOneHypercover.Hom.mapMulticospan f.hom - CategoryTheory.PreOneHypercover.equivalenceMulticospanOfIso_inverse π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (f : E β F) : (CategoryTheory.PreOneHypercover.equivalenceMulticospanOfIso f).inverse = CategoryTheory.PreOneHypercover.Hom.mapMulticospan f.inv - CategoryTheory.PreOneHypercover.hom_inv_sβ_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : E.Iβ) : e.inv.sβ (e.hom.sβ i) = i - CategoryTheory.PreOneHypercover.inv_hom_sβ_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : F.Iβ) : e.hom.sβ (e.inv.sβ i) = i - CategoryTheory.PreOneHypercover.isLimitEquivOfIso π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E F : CategoryTheory.PreOneHypercover S} (f : E β F) (G : CategoryTheory.Functor Cα΅α΅ A) : CategoryTheory.Limits.IsLimit (E.multifork G) β CategoryTheory.Limits.IsLimit (F.multifork G) - CategoryTheory.GrothendieckTopology.OneHypercover.isoMk_hom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {E F : J.OneHypercover S} (f : E.toPreOneHypercover β F.toPreOneHypercover) : (CategoryTheory.GrothendieckTopology.OneHypercover.isoMk f).hom = f.hom - CategoryTheory.GrothendieckTopology.OneHypercover.isoMk_inv π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {E F : J.OneHypercover S} (f : E.toPreOneHypercover β F.toPreOneHypercover) : (CategoryTheory.GrothendieckTopology.OneHypercover.isoMk f).inv = f.inv - CategoryTheory.PreOneHypercover.Hom.hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) : E.Y k βΆ F.Y (self.sβ k) - CategoryTheory.PreOneHypercover.sieveβ' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (iβ iβ : E.Iβ) [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] : CategoryTheory.Sieve (CategoryTheory.Limits.pullback (E.f iβ) (E.f iβ)) - CategoryTheory.PreOneHypercover.instIsIsoHβHom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : E.Iβ) : CategoryTheory.IsIso (e.hom.hβ i) - CategoryTheory.PreOneHypercover.instIsIsoHβInv π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : F.Iβ) : CategoryTheory.IsIso (e.inv.hβ i) - CategoryTheory.PreOneHypercover.sigmaOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) : CategoryTheory.PreOneHypercover S - CategoryTheory.PreOneHypercover.Hom.comp_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (g : F.Hom G) (aβ : E.Iβ) : (f.comp g).sβ aβ = g.sβ (f.sβ aβ) - CategoryTheory.PreOneHypercover.comp_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {Xβ Yβ Zβ : CategoryTheory.PreOneHypercover S} (f : Xβ.Hom Yβ) (g : Yβ.Hom Zβ) (aβ : Xβ.Iβ) : (CategoryTheory.CategoryStruct.comp f g).sβ aβ = g.sβ (f.sβ aβ) - CategoryTheory.PreOneHypercover.instUniqueLMulticospanShapeSigmaOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) : Unique (E.sigmaOfIsColimit hc hd).multicospanShape.L - CategoryTheory.PreOneHypercover.instUniqueRMulticospanShapeSigmaOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) : Unique (E.sigmaOfIsColimit hc hd).multicospanShape.R - CategoryTheory.PreOneHypercover.multicospanShape_fst π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (j : E.Iβ') : E.multicospanShape.fst j = j.fst.1 - CategoryTheory.PreOneHypercover.multicospanShape_snd π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (j : E.Iβ') : E.multicospanShape.snd j = j.fst.2 - CategoryTheory.PreOneHypercover.w π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreOneHypercover S) β¦iβ iβ : self.Iββ¦ (j : self.Iβ iβ iβ) : CategoryTheory.CategoryStruct.comp (self.pβ j) (self.f iβ) = CategoryTheory.CategoryStruct.comp (self.pβ j) (self.f iβ) - CategoryTheory.PreOneHypercover.Hom.mapMulticospan_obj π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (xβ : CategoryTheory.Limits.WalkingMulticospan E.multicospanShape) : f.mapMulticospan.obj xβ = match xβ with | CategoryTheory.Limits.WalkingMulticospan.left i => CategoryTheory.Limits.WalkingMulticospan.left (f.sβ i) | CategoryTheory.Limits.WalkingMulticospan.right i => CategoryTheory.Limits.WalkingMulticospan.right (f.sβ' i) - CategoryTheory.PreOneHypercover.toPullback π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] (j : E.Iβ iβ iβ) : E.Y j βΆ CategoryTheory.Limits.pullback (E.f iβ) (E.f iβ) - CategoryTheory.PreOneHypercover.pullback_sieveβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} {W : C} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) {T : C} (f : T βΆ W) : CategoryTheory.Sieve.pullback f (E.sieveβ pβ pβ) = E.sieveβ (CategoryTheory.CategoryStruct.comp f pβ) (CategoryTheory.CategoryStruct.comp f pβ) - CategoryTheory.PreOneHypercover.sigmaOfIsColimit_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) : (E.sigmaOfIsColimit hc hd).toPreZeroHypercover = E.sigmaOfIsColimit hc - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) (d : CategoryTheory.Limits.Multifork (F.multicospanIndex P)) : d.pt βΆ c.pt - CategoryTheory.PreOneHypercover.multifork_ΞΉ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) (i : E.Iβ) : (E.multifork F).ΞΉ i = F.map (E.f i).op - CategoryTheory.PreOneHypercover.instIsIsoHβHom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : E.Iβ} (k : E.Iβ i j) : CategoryTheory.IsIso (e.hom.hβ k) - CategoryTheory.PreOneHypercover.instIsIsoHβInv π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : F.Iβ} (k : F.Iβ i j) : CategoryTheory.IsIso (e.inv.hβ k) - CategoryTheory.PreOneHypercover.mk π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (toPreZeroHypercover : CategoryTheory.PreZeroHypercover S) (Iβ : toPreZeroHypercover.Iβ β toPreZeroHypercover.Iβ β Type w) (Y : β¦iβ iβ : toPreZeroHypercover.Iββ¦ β Iβ iβ iβ β C) (pβ : β¦iβ iβ : toPreZeroHypercover.Iββ¦ β (j : Iβ iβ iβ) β Y j βΆ toPreZeroHypercover.X iβ) (pβ : β¦iβ iβ : toPreZeroHypercover.Iββ¦ β (j : Iβ iβ iβ) β Y j βΆ toPreZeroHypercover.X iβ) (w : β β¦iβ iβ : toPreZeroHypercover.Iββ¦ (j : Iβ iβ iβ), CategoryTheory.CategoryStruct.comp (pβ j) (toPreZeroHypercover.f iβ) = CategoryTheory.CategoryStruct.comp (pβ j) (toPreZeroHypercover.f iβ)) : CategoryTheory.PreOneHypercover S - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : E.Y ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k) β E.Y k - CategoryTheory.PreOneHypercover.sigmaOfIsColimit_Y π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (xβ xβΒΉ : (E.sigmaOfIsColimit hc).Iβ) (xβΒ² : PUnit.{w + 1}) : (E.sigmaOfIsColimit hc hd).Y xβΒ² = d.pt - CategoryTheory.GrothendieckTopology.OneHypercover.mk π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (toPreOneHypercover : CategoryTheory.PreOneHypercover S) (memβ : toPreOneHypercover.sieveβ β J S) (memβ : β (iβ iβ : toPreOneHypercover.Iβ) β¦W : Cβ¦ (pβ : W βΆ toPreOneHypercover.X iβ) (pβ : W βΆ toPreOneHypercover.X iβ), CategoryTheory.CategoryStruct.comp pβ (toPreOneHypercover.f iβ) = CategoryTheory.CategoryStruct.comp pβ (toPreOneHypercover.f iβ) β toPreOneHypercover.sieveβ pβ pβ β J W) : J.OneHypercover S - CategoryTheory.PreOneHypercover.inter π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : CategoryTheory.PreOneHypercover S - CategoryTheory.PreOneHypercover.toPullback_fst π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] (k : E.Iβ iβ iβ) : CategoryTheory.CategoryStruct.comp (E.toPullback k) (CategoryTheory.Limits.pullback.fst (E.f iβ) (E.f iβ)) = E.pβ k - CategoryTheory.PreOneHypercover.toPullback_snd π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] (k : E.Iβ iβ iβ) : CategoryTheory.CategoryStruct.comp (E.toPullback k) (CategoryTheory.Limits.pullback.snd (E.f iβ) (E.f iβ)) = E.pβ k - CategoryTheory.PreOneHypercover.Hom.comp_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (g : F.Hom G) {iβ jβ : E.Iβ} (aβ : E.Iβ iβ jβ) : (f.comp g).sβ aβ = g.sβ (f.sβ aβ) - CategoryTheory.PreOneHypercover.interFst π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.inter F).Hom E - CategoryTheory.PreOneHypercover.interSnd π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.inter F).Hom F - CategoryTheory.PreOneHypercover.comp_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {Xβ Yβ Zβ : CategoryTheory.PreOneHypercover S} (f : Xβ.Hom Yβ) (g : Yβ.Hom Zβ) {iβ jβ : Xβ.Iβ} (aβ : Xβ.Iβ iβ jβ) : (CategoryTheory.CategoryStruct.comp f g).sβ aβ = g.sβ (f.sβ aβ) - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit_id π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) (d : CategoryTheory.Limits.Multifork (E.multicospanIndex P)) : (CategoryTheory.PreOneHypercover.Hom.id E).mapMultiforkOfIsLimit P hc d = CategoryTheory.Limits.Multifork.IsLimit.lift hc d.ΞΉ β― - CategoryTheory.PreOneHypercover.interLift π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] {G : CategoryTheory.PreOneHypercover S} (f : G.Hom E) (g : G.Hom F) : G.Hom (E.inter F) - CategoryTheory.PreOneHypercover.inter_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.inter F).toPreZeroHypercover = E.inter F.toPreZeroHypercover - CategoryTheory.PreOneHypercover.sieveβ'_eq_sieveβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (iβ iβ : E.Iβ) [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] : E.sieveβ' iβ iβ = E.sieveβ (CategoryTheory.Limits.pullback.fst (E.f iβ) (E.f iβ)) (CategoryTheory.Limits.pullback.snd (E.f iβ) (E.f iβ)) - CategoryTheory.PreOneHypercover.sieveβ_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} {W : C} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) (Z : C) (g : Z βΆ W) : (E.sieveβ pβ pβ).arrows g = β j h, CategoryTheory.CategoryStruct.comp g pβ = CategoryTheory.CategoryStruct.comp h (E.pβ j) β§ CategoryTheory.CategoryStruct.comp g pβ = CategoryTheory.CategoryStruct.comp h (E.pβ j) - CategoryTheory.PreOneHypercover.interFst_toHom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.interFst F).toHom = E.interFst F.toPreZeroHypercover - CategoryTheory.PreOneHypercover.interSnd_toHom π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.interSnd F).toHom = E.interSnd F.toPreZeroHypercover - CategoryTheory.PreOneHypercover.sieveβ_eq_pullback_sieveβ' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] {W : C} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) (w : CategoryTheory.CategoryStruct.comp pβ (E.f iβ) = CategoryTheory.CategoryStruct.comp pβ (E.f iβ)) : E.sieveβ pβ pβ = CategoryTheory.Sieve.pullback (CategoryTheory.Limits.pullback.lift pβ pβ w) (E.sieveβ' iβ iβ) - CategoryTheory.GrothendieckTopology.OneHypercover.mk' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : CategoryTheory.PreOneHypercover S) [E.HasPullbacks] (memβ : E.sieveβ β J S) (memβ' : β (iβ iβ : E.Iβ), E.sieveβ' iβ iβ β J (CategoryTheory.Limits.pullback (E.f iβ) (E.f iβ))) : J.OneHypercover S - CategoryTheory.PreOneHypercover.Y'_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (i : E.Iβ') : E.Y' i = E.Y i.snd - CategoryTheory.PreOneHypercover.toPullback_fst_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] (k : E.Iβ iβ iβ) {Z : C} (h : E.X iβ βΆ Z) : CategoryTheory.CategoryStruct.comp (E.toPullback k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (E.f iβ) (E.f iβ)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) h - CategoryTheory.PreOneHypercover.toPullback_snd_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {iβ iβ : E.Iβ} [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] (k : E.Iβ iβ iβ) {Z : C} (h : E.X iβ βΆ Z) : CategoryTheory.CategoryStruct.comp (E.toPullback k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd (E.f iβ) (E.f iβ)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) h - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_refl π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i j : E.Iβ} (k : E.Iβ i j) : CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k = CategoryTheory.Iso.refl (E.Y ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k)) - CategoryTheory.GrothendieckTopology.OneHypercover.mk'_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : CategoryTheory.PreOneHypercover S) [E.HasPullbacks] (memβ : E.sieveβ β J S) (memβ' : β (iβ iβ : E.Iβ), E.sieveβ' iβ iβ β J (CategoryTheory.Limits.pullback (E.f iβ) (E.f iβ))) : (CategoryTheory.GrothendieckTopology.OneHypercover.mk' E memβ memβ').toPreOneHypercover = E - CategoryTheory.PreOneHypercover.Hom.comp_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (g : F.Hom G) (i : E.Iβ) : (f.comp g).hβ i = CategoryTheory.CategoryStruct.comp (f.hβ i) (g.hβ (f.sβ i)) - CategoryTheory.PreOneHypercover.comp_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {Xβ Yβ Zβ : CategoryTheory.PreOneHypercover S} (f : Xβ.Hom Yβ) (g : Yβ.Hom Zβ) (i : Xβ.Iβ) : (CategoryTheory.CategoryStruct.comp f g).hβ i = CategoryTheory.CategoryStruct.comp (f.hβ i) (g.hβ (f.sβ i)) - CategoryTheory.PreOneHypercover.Hom.wββ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (self.hβ k) (F.pβ (self.sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (self.hβ i) - CategoryTheory.PreOneHypercover.Hom.wββ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (self.hβ k) (F.pβ (self.sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (self.hβ j) - CategoryTheory.PreOneHypercover.multicospanIndex_right π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) (j : E.multicospanShape.R) : (E.multicospanIndex F).right j = F.obj (Opposite.op (E.Y j.snd)) - CategoryTheory.PreOneHypercover.isLimitSigmaOfIsColimitEquiv π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Discrete.functor fun i => Opposite.op (E.X i)) F] [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Discrete.functor fun i => Opposite.op (E.Y' i)) F] : CategoryTheory.Limits.IsLimit ((E.sigmaOfIsColimit hc hd).multifork F) β CategoryTheory.Limits.IsLimit (E.multifork F) - CategoryTheory.PreOneHypercover.inter_Iβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] (i j : (E.inter F.toPreZeroHypercover).Iβ) : (E.inter F).Iβ i j = (E.Iβ i.1 j.1 Γ F.Iβ i.2 j.2) - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit_comp π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) {d : CategoryTheory.Limits.Multifork (F.multicospanIndex P)} (g : F.Hom G) (t : CategoryTheory.Limits.Multifork (G.multicospanIndex P)) (hd : CategoryTheory.Limits.IsLimit d) : (f.comp g).mapMultiforkOfIsLimit P hc t = CategoryTheory.CategoryStruct.comp (g.mapMultiforkOfIsLimit P hd t) (f.mapMultiforkOfIsLimit P hc d) - CategoryTheory.GrothendieckTopology.OneHypercover.inter_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} [CategoryTheory.Limits.HasPullbacks C] (E : J.OneHypercover S) (F : J.OneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] : (E.inter F).toPreOneHypercover = E.inter F.toPreOneHypercover - CategoryTheory.PreOneHypercover.congrIndexOneOfEq_naturality π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (uβ : E.Iβ β F.Iβ) (uβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (uβ i) (uβ j)) (k : E.Iβ i j) : uβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k) = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (uβ k) - CategoryTheory.PreOneHypercover.interFst_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] {i j : (E.inter F).Iβ} (k : (E.inter F).Iβ i j) : (E.interFst F).sβ k = k.1 - CategoryTheory.PreOneHypercover.interSnd_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] {i j : (E.inter F).Iβ} (k : (E.inter F).Iβ i j) : (E.interSnd F).sβ k = k.2 - CategoryTheory.PreOneHypercover.congrIndexOneOfEq_trans π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') {i'' j'' : E.Iβ} (hii'' : i' = i'') (hjj'' : j' = j'') (k : E.Iβ i j) : (CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii'' hjj'') ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k) = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k - CategoryTheory.PreOneHypercover.Hom.wββ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) {Z : C} (h : F.X (self.sβ i) βΆ Z) : CategoryTheory.CategoryStruct.comp (self.hβ k) (CategoryTheory.CategoryStruct.comp (F.pβ (self.sβ k)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.CategoryStruct.comp (self.hβ i) h) - CategoryTheory.PreOneHypercover.Hom.wββ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (self : E.Hom F) {i j : E.Iβ} (k : E.Iβ i j) {Z : C} (h : F.X (self.sβ j) βΆ Z) : CategoryTheory.CategoryStruct.comp (self.hβ k) (CategoryTheory.CategoryStruct.comp (F.pβ (self.sβ k)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.CategoryStruct.comp (self.hβ j) h) - CategoryTheory.PreOneHypercover.hom_inv_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : E.Iβ) : CategoryTheory.CategoryStruct.comp (e.hom.hβ i) (e.inv.hβ (e.hom.sβ i)) = CategoryTheory.eqToHom β― - CategoryTheory.PreOneHypercover.inv_hom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : F.Iβ) : CategoryTheory.CategoryStruct.comp (e.inv.hβ i) (e.hom.hβ (e.inv.sβ i)) = CategoryTheory.eqToHom β― - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit_comp_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) {d : CategoryTheory.Limits.Multifork (F.multicospanIndex P)} (g : F.Hom G) (t : CategoryTheory.Limits.Multifork (G.multicospanIndex P)) (hd : CategoryTheory.Limits.IsLimit d) {Z : A} (h : c.pt βΆ Z) : CategoryTheory.CategoryStruct.comp ((f.comp g).mapMultiforkOfIsLimit P hc t) h = CategoryTheory.CategoryStruct.comp (g.mapMultiforkOfIsLimit P hd t) (CategoryTheory.CategoryStruct.comp (f.mapMultiforkOfIsLimit P hc d) h) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit_ΞΉ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) (d : CategoryTheory.Limits.Multifork (F.multicospanIndex P)) (a : E.Iβ) : CategoryTheory.CategoryStruct.comp (f.mapMultiforkOfIsLimit P hc d) (c.ΞΉ a) = CategoryTheory.CategoryStruct.comp (d.ΞΉ (f.sβ a)) (P.map (f.hβ a).op) - CategoryTheory.PreOneHypercover.congrIndexOneOfEq_congrFun π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {uβ vβ : E.Iβ β F.Iβ} {uβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (uβ i) (uβ j)} {vβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (vβ i) (vβ j)} (hβ : uβ = vβ) (hβ : β (i j : E.Iβ) (k : E.Iβ i j), uβ k = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (vβ k)) {i j : E.Iβ} (k : E.Iβ i j) : (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (vβ k) = uβ k - CategoryTheory.PreOneHypercover.hom_inv_hβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : E.Iβ) {Z : C} (h : E.X (e.inv.sβ (e.hom.sβ i)) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.hom.hβ i) (CategoryTheory.CategoryStruct.comp (e.inv.hβ (e.hom.sβ i)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h - CategoryTheory.PreOneHypercover.inv_hom_hβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) (i : F.Iβ) {Z : C} (h : F.X (e.hom.sβ (e.inv.sβ i)) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.inv.hβ i) (CategoryTheory.CategoryStruct.comp (e.hom.hβ (e.inv.sβ i)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h - CategoryTheory.PreOneHypercover.Hom.mapMulticospan_map π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) {Xβ Yβ : CategoryTheory.Limits.WalkingMulticospan E.multicospanShape} (xβ : Xβ βΆ Yβ) : f.mapMulticospan.map xβ = match Xβ, Yβ, xβ with | x, .(x), CategoryTheory.Limits.WalkingMulticospan.Hom.id .(x) => CategoryTheory.Limits.WalkingMulticospan.Hom.id (match x with | CategoryTheory.Limits.WalkingMulticospan.left i => CategoryTheory.Limits.WalkingMulticospan.left (f.sβ i) | CategoryTheory.Limits.WalkingMulticospan.right i => CategoryTheory.Limits.WalkingMulticospan.right (f.sβ' i)) | .(CategoryTheory.Limits.WalkingMulticospan.left (E.multicospanShape.fst i)), .(CategoryTheory.Limits.WalkingMulticospan.right i), CategoryTheory.Limits.WalkingMulticospan.Hom.fst i => CategoryTheory.Limits.WalkingMulticospan.Hom.fst (f.sβ' i) | .(CategoryTheory.Limits.WalkingMulticospan.left (E.multicospanShape.snd i)), .(CategoryTheory.Limits.WalkingMulticospan.right i), CategoryTheory.Limits.WalkingMulticospan.Hom.snd i => CategoryTheory.Limits.WalkingMulticospan.Hom.snd (f.sβ' i) - CategoryTheory.PreOneHypercover.Hom.ext π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {x y : E.Hom F} (sβ : x.sβ = y.sβ) (hβ : x.hβ β y.hβ) (sβ : @CategoryTheory.PreOneHypercover.Hom.sβ C instβ S E F x β @CategoryTheory.PreOneHypercover.Hom.sβ C instβ S E F y) (hβ : @CategoryTheory.PreOneHypercover.Hom.hβ C instβ S E F x β @CategoryTheory.PreOneHypercover.Hom.hβ C instβ S E F y) : x = y - CategoryTheory.PreOneHypercover.Hom.mapMultiforkOfIsLimit_ΞΉ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (P : CategoryTheory.Functor Cα΅α΅ A) {c : CategoryTheory.Limits.Multifork (E.multicospanIndex P)} (hc : CategoryTheory.Limits.IsLimit c) (d : CategoryTheory.Limits.Multifork (F.multicospanIndex P)) (a : E.Iβ) {Z : A} (h : (E.multicospanIndex P).left a βΆ Z) : CategoryTheory.CategoryStruct.comp (f.mapMultiforkOfIsLimit P hc d) (CategoryTheory.CategoryStruct.comp (c.ΞΉ a) h) = CategoryTheory.CategoryStruct.comp (d.ΞΉ (f.sβ a)) (CategoryTheory.CategoryStruct.comp (P.map (f.hβ a).op) h) - CategoryTheory.PreOneHypercover.Hom.ext_iff π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {x y : E.Hom F} : x = y β x.sβ = y.sβ β§ x.hβ β y.hβ β§ @CategoryTheory.PreOneHypercover.Hom.sβ C instβ S E F x β @CategoryTheory.PreOneHypercover.Hom.sβ C instβ S E F y β§ @CategoryTheory.PreOneHypercover.Hom.hβ C instβ S E F x β @CategoryTheory.PreOneHypercover.Hom.hβ C instβ S E F y - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_pβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) {Z : C} (h : E.X i' βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (CategoryTheory.CategoryStruct.comp (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_pβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) {Z : C} (h : E.X j' βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (CategoryTheory.CategoryStruct.comp (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) h) = CategoryTheory.CategoryStruct.comp (E.pβ k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.Hom.comp_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {G : CategoryTheory.PreOneHypercover S} (f : E.Hom F) (g : F.Hom G) {iβ jβ : E.Iβ} (i : E.Iβ iβ jβ) : (f.comp g).hβ i = CategoryTheory.CategoryStruct.comp (f.hβ i) (g.hβ (f.sβ i)) - CategoryTheory.PreOneHypercover.Hom.mk π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (toHom : E.Hom F.toPreZeroHypercover) (sβ : {i j : E.Iβ} β E.Iβ i j β F.Iβ (toHom.sβ i) (toHom.sβ j)) (hβ : {i j : E.Iβ} β (k : E.Iβ i j) β E.Y k βΆ F.Y (sβ k)) (wββ : β {i j : E.Iβ} (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k) (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (toHom.hβ i) := by cat_disch) (wββ : β {i j : E.Iβ} (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k) (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (toHom.hβ j) := by cat_disch) : E.Hom F - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_hom_pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).hom (E.pβ k) = CategoryTheory.CategoryStruct.comp (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.comp_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {Xβ Yβ Zβ : CategoryTheory.PreOneHypercover S} (f : Xβ.Hom Yβ) (g : Yβ.Hom Zβ) {iβ jβ : Xβ.Iβ} (i : Xβ.Iβ iβ jβ) : (CategoryTheory.CategoryStruct.comp f g).hβ i = CategoryTheory.CategoryStruct.comp (f.hβ i) (g.hβ (f.sβ i)) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_hom_pβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) {Z : C} (h : E.X i βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).hom (CategoryTheory.CategoryStruct.comp (E.pβ k) h) = CategoryTheory.CategoryStruct.comp (E.pβ ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.pβ_sigmaOfIsColimit_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (i : E.Iβ') {a b : PUnit.{w + 1}} (r : (E.sigmaOfIsColimit hc hd).Iβ a b) {Z : C} (h : (E.sigmaOfIsColimit hc hd).X a βΆ Z) : CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp ((E.sigmaOfIsColimit hc hd).pβ r) h) = CategoryTheory.CategoryStruct.comp (E.pβ i.snd) (CategoryTheory.CategoryStruct.comp (c.inj i.fst.1) h) - CategoryTheory.PreOneHypercover.pβ_sigmaOfIsColimit_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (i : E.Iβ') {a b : PUnit.{w + 1}} (r : (E.sigmaOfIsColimit hc hd).Iβ a b) {Z : C} (h : (E.sigmaOfIsColimit hc hd).X b βΆ Z) : CategoryTheory.CategoryStruct.comp (d.inj i) (CategoryTheory.CategoryStruct.comp ((E.sigmaOfIsColimit hc hd).pβ r) h) = CategoryTheory.CategoryStruct.comp (E.pβ i.snd) (CategoryTheory.CategoryStruct.comp (c.inj i.fst.2) h) - CategoryTheory.PreOneHypercover.pβ_sigmaOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (i : E.Iβ') {a b : PUnit.{w + 1}} (r : (E.sigmaOfIsColimit hc hd).Iβ a b) : CategoryTheory.CategoryStruct.comp (d.inj i) ((E.sigmaOfIsColimit hc hd).pβ r) = CategoryTheory.CategoryStruct.comp (E.pβ i.snd) (c.inj i.fst.1) - CategoryTheory.PreOneHypercover.pβ_sigmaOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (i : E.Iβ') {a b : PUnit.{w + 1}} (r : (E.sigmaOfIsColimit hc hd).Iβ a b) : CategoryTheory.CategoryStruct.comp (d.inj i) ((E.sigmaOfIsColimit hc hd).pβ r) = CategoryTheory.CategoryStruct.comp (E.pβ i.snd) (c.inj i.fst.2) - CategoryTheory.PreOneHypercover.hom_inv_sβ_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : E.Iβ} (k : E.Iβ i j) : e.inv.sβ (e.hom.sβ k) = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k - CategoryTheory.PreOneHypercover.inv_hom_sβ_apply π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : F.Iβ} (k : F.Iβ i j) : e.hom.sβ (e.inv.sβ k) = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k - CategoryTheory.PreOneHypercover.inter_Y π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] (i j : (E.inter F.toPreZeroHypercover).Iβ) (k : E.Iβ i.1 j.1 Γ F.Iβ i.2 j.2) : (E.inter F).Y k = CategoryTheory.Limits.pullback (CategoryTheory.CategoryStruct.comp (E.pβ k.1) (E.f i.1)) (CategoryTheory.CategoryStruct.comp (F.pβ k.2) (F.f i.2)) - CategoryTheory.PreOneHypercover.multicospanIndex_fst π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) (j : E.multicospanShape.R) : (E.multicospanIndex F).fst j = F.map (E.pβ j.snd).op - CategoryTheory.PreOneHypercover.multicospanIndex_snd π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.Functor Cα΅α΅ A) (j : E.multicospanShape.R) : (E.multicospanIndex F).snd j = F.map (E.pβ j.snd).op - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_hom_naturality π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (uβ : E.Iβ β F.Iβ) (uβ : (i j : E.Iβ) β E.Iβ i j β F.Iβ (uβ i) (uβ j)) (z : (i j : E.Iβ) β (k : E.Iβ i j) β E.Y k βΆ F.Y (uβ i j k)) (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).hom (z i j k) = CategoryTheory.CategoryStruct.comp (z i' j' ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (uβ i j k)).hom) - CategoryTheory.PreOneHypercover.forkOfIsColimit π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) : CategoryTheory.Limits.Fork (F.map (CategoryTheory.Limits.Cofan.IsColimit.desc hd fun x => CategoryTheory.CategoryStruct.comp (E.pβ x.snd) (c.inj x.fst.1)).op) (F.map (CategoryTheory.Limits.Cofan.IsColimit.desc hd fun x => CategoryTheory.CategoryStruct.comp (E.pβ x.snd) (c.inj x.fst.2)).op) - CategoryTheory.PreOneHypercover.forkOfIsColimit_pt π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) : (E.forkOfIsColimit hc hd F).pt = F.obj (Opposite.op S) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_hom_naturality_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (uβ : E.Iβ β F.Iβ) (uβ : (i j : E.Iβ) β E.Iβ i j β F.Iβ (uβ i) (uβ j)) (z : (i j : E.Iβ) β (k : E.Iβ i j) β E.Y k βΆ F.Y (uβ i j k)) (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) {Z : C} (h : F.Y (uβ i j k) βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).hom (CategoryTheory.CategoryStruct.comp (z i j k) h) = CategoryTheory.CategoryStruct.comp (z i' j' ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (uβ i j k)).hom h)) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_naturality_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (uβ : E.Iβ β F.Iβ) (uβ : (i j : E.Iβ) β E.Iβ i j β F.Iβ (uβ i) (uβ j)) (z : (i j : E.Iβ) β (k : E.Iβ i j) β E.Y k βΆ F.Y (uβ i j k)) (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) {Z : C} (h : F.Y ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (uβ i j k)) βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (CategoryTheory.CategoryStruct.comp (z i' j' ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h)) = CategoryTheory.CategoryStruct.comp (z i j k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (uβ i j k)).inv h) - CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso_inv_naturality π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {i i' j j' : E.Iβ} (uβ : E.Iβ β F.Iβ) (uβ : (i j : E.Iβ) β E.Iβ i j β F.Iβ (uβ i) (uβ j)) (z : (i j : E.Iβ) β (k : E.Iβ i j) β E.Y k βΆ F.Y (uβ i j k)) (hii' : i = i') (hjj' : j = j') (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso hii' hjj' k).inv (CategoryTheory.CategoryStruct.comp (z i' j' ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq hii' hjj') k)) (CategoryTheory.eqToHom β―)) = CategoryTheory.CategoryStruct.comp (z i j k) (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (uβ i j k)).inv - CategoryTheory.PreOneHypercover.isLimitMultiforkEquivIsLimitFork π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Discrete.functor fun i => Opposite.op (E.X i)) F] [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Discrete.functor fun i => Opposite.op (E.Y' i)) F] : CategoryTheory.Limits.IsLimit (E.multifork F) β CategoryTheory.Limits.IsLimit (E.forkOfIsColimit hc hd F) - CategoryTheory.PreOneHypercover.Iβ'.ext π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {a b : E.Iβ'} (left : a.fst.1 = b.fst.1) (right : a.fst.2 = b.fst.2) (h : (CategoryTheory.PreOneHypercover.congrIndexOneOfEq left right) a.snd = b.snd) : a = b - CategoryTheory.PreOneHypercover.Hom.ext' π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {f g : E.Hom F} (hsβ : f.sβ = g.sβ) (hhβ : β (i : E.Iβ), f.hβ i = CategoryTheory.CategoryStruct.comp (g.hβ i) (CategoryTheory.eqToHom β―)) (hsβ : β (i j : E.Iβ) (k : E.Iβ i j), f.sβ k = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (g.sβ k)) (hhβ : β (i j : E.Iβ) (k : E.Iβ i j), f.hβ k = CategoryTheory.CategoryStruct.comp (g.hβ k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (g.sβ k)).inv (CategoryTheory.eqToHom β―))) : f = g - CategoryTheory.PreOneHypercover.hom_inv_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : E.Iβ} (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (e.hom.hβ k) (e.inv.hβ (e.hom.sβ k)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.inv_hom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : F.Iβ} (k : F.Iβ i j) : CategoryTheory.CategoryStruct.comp (e.inv.hβ k) (e.hom.hβ (e.inv.sβ k)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.forkOfIsColimit_ΞΉ_map_inj π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) (i : E.Iβ) : CategoryTheory.CategoryStruct.comp (E.forkOfIsColimit hc hd F).ΞΉ (F.map (c.inj i).op) = F.map (E.f i).op - CategoryTheory.PreOneHypercover.Hom.ext'_iff π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} {f g : E.Hom F} : f = g β β (hsβ : f.sβ = g.sβ) (_ : β (i : E.Iβ), f.hβ i = CategoryTheory.CategoryStruct.comp (g.hβ i) (CategoryTheory.eqToHom β―)) (hsβ : β (i j : E.Iβ) (k : E.Iβ i j), f.sβ k = (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (g.sβ k)), β (i j : E.Iβ) (k : E.Iβ i j), f.hβ k = CategoryTheory.CategoryStruct.comp (g.hβ k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (g.sβ k)).inv (CategoryTheory.eqToHom β―)) - CategoryTheory.PreOneHypercover.inter_pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] (i j : (E.inter F.toPreZeroHypercover).Iβ) (k : E.Iβ i.1 j.1 Γ F.Iβ i.2 j.2) : (E.inter F).pβ k = CategoryTheory.Limits.pullback.map (CategoryTheory.CategoryStruct.comp (E.pβ k.1) (E.f i.1)) (CategoryTheory.CategoryStruct.comp (F.pβ k.2) (F.f i.2)) (E.f ((Equiv.sigmaEquivProd E.Iβ F.toPreZeroHypercover.1).symm i).fst) (F.f ((Equiv.sigmaEquivProd E.Iβ F.toPreZeroHypercover.1).symm i).snd) (E.pβ k.1) (F.pβ k.2) (CategoryTheory.CategoryStruct.id S) β― β― - CategoryTheory.PreOneHypercover.inter_pβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreOneHypercover S) (F : CategoryTheory.PreOneHypercover S) [β (i : E.Iβ) (j : F.Iβ), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] [β (i j : E.Iβ) (k : E.Iβ i j) (a b : F.Iβ) (l : F.Iβ a b), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) (CategoryTheory.CategoryStruct.comp (F.pβ l) (F.f a))] (i j : (E.inter F.toPreZeroHypercover).Iβ) (k : E.Iβ i.1 j.1 Γ F.Iβ i.2 j.2) : (E.inter F).pβ k = CategoryTheory.Limits.pullback.map (CategoryTheory.CategoryStruct.comp (E.pβ k.1) (E.f i.1)) (CategoryTheory.CategoryStruct.comp (F.pβ k.2) (F.f i.2)) (E.f ((Equiv.sigmaEquivProd E.Iβ F.toPreZeroHypercover.1).symm j).fst) (F.f ((Equiv.sigmaEquivProd E.Iβ F.toPreZeroHypercover.1).symm j).snd) (E.pβ k.1) (F.pβ k.2) (CategoryTheory.CategoryStruct.id S) β― β― - CategoryTheory.PreOneHypercover.hom_inv_hβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : E.Iβ} (k : E.Iβ i j) {Z : C} (h : E.Y (e.inv.sβ (e.hom.sβ k)) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.hom.hβ k) (CategoryTheory.CategoryStruct.comp (e.inv.hβ (e.hom.sβ k)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.inv_hom_hβ_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (e : E β F) {i j : F.Iβ} (k : F.Iβ i j) {Z : C} (h : F.Y (e.hom.sβ (e.inv.sβ k)) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.inv.hβ k) (CategoryTheory.CategoryStruct.comp (e.hom.hβ (e.inv.sβ k)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.forkOfIsColimit_ΞΉ_map_inj_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {S : C} (E : CategoryTheory.PreOneHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan E.Y'} (hd : CategoryTheory.Limits.IsColimit d) (F : CategoryTheory.Functor Cα΅α΅ A) (i : E.Iβ) {Z : A} (h : F.obj (Opposite.op (E.X i)) βΆ Z) : CategoryTheory.CategoryStruct.comp (E.forkOfIsColimit hc hd F).ΞΉ (CategoryTheory.CategoryStruct.comp (F.map (c.inj i).op) h) = CategoryTheory.CategoryStruct.comp (F.map (E.f i).op) h - CategoryTheory.PreOneHypercover.isoMk π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) : E β F - CategoryTheory.PreOneHypercover.isoMk_hom_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) (a : E.Iβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).hom.sβ a = sβ a - CategoryTheory.PreOneHypercover.isoMk_inv_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) (a : F.Iβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).inv.sβ a = sβ.symm a - CategoryTheory.PreOneHypercover.isoMk_hom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) (i : E.Iβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).hom.hβ i = (hβ i).hom - CategoryTheory.PreOneHypercover.isoMk_inv_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) (i : F.Iβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).inv.hβ i = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (hβ (sβ.symm i)).inv - CategoryTheory.PreOneHypercover.isoMk_hom_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) {iβ jβ : E.Iβ} (k : E.Iβ iβ jβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).hom.sβ k = sβ k - CategoryTheory.PreOneHypercover.sieveβ_inter π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} [CategoryTheory.Limits.HasPullbacks C] {i j : E.Iβ Γ F.Iβ} {W : C} {pβ : W βΆ CategoryTheory.Limits.pullback (E.f i.1) (F.f i.2)} {pβ : W βΆ CategoryTheory.Limits.pullback (E.f j.1) (F.f j.2)} (w : CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (E.f i.1) (F.f i.2)) (E.f i.1)) = CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (E.f j.1) (F.f j.2)) (E.f j.1))) : (E.inter F).sieveβ pβ pβ = CategoryTheory.Sieve.bind (E.sieveβ (CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.Limits.pullback.fst (E.f i.1) (F.f i.2))) (CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.Limits.pullback.fst (E.f j.1) (F.f j.2)))).arrows fun x f x_1 => CategoryTheory.Sieve.pullback f (F.sieveβ (CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.Limits.pullback.snd (E.f i.1) (F.f i.2))) (CategoryTheory.CategoryStruct.comp pβ (CategoryTheory.Limits.pullback.snd (E.f j.1) (F.f j.2)))) - CategoryTheory.PreOneHypercover.isoMk_hom_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) {iβ jβ : E.Iβ} (k : E.Iβ iβ jβ) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).hom.hβ k = (hβ k).hom - CategoryTheory.PreOneHypercover.isoMk_inv_sβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) {i j : F.Iβ} (k : F.Iβ i j) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).inv.sβ k = sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k) - CategoryTheory.PreOneHypercover.congrIndexOneOfEq_equiv π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) {i j : E.Iβ} (k : E.Iβ i j) : (CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k = sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (sβ k)) - CategoryTheory.PreOneHypercover.isoMk_inv_hβ π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (hβ : (i : E.Iβ) β E.X i β F.X (sβ i)) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (wβ : β (i : E.Iβ), CategoryTheory.CategoryStruct.comp (hβ i).hom (F.f (sβ i)) = E.f i := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ i).hom := by cat_disch) (wββ : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.CategoryStruct.comp (hβ k).hom (F.pβ (sβ k)) = CategoryTheory.CategoryStruct.comp (E.pβ k) (hβ j).hom := by cat_disch) {i j : F.Iβ} (k : F.Iβ i j) : (CategoryTheory.PreOneHypercover.isoMk sβ hβ sβ hβ wβ wββ wββ).inv.hβ k = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (hβ (sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) k))).inv) - CategoryTheory.PreOneHypercover.isoMk_aux_assoc π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) {i j : E.Iβ} (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (k : E.Iβ i j) {Z : C} (h : E.Y (sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (sβ k))) βΆ Z) : CategoryTheory.CategoryStruct.comp (hβ k).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (sβ k)).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (CategoryTheory.CategoryStruct.comp (hβ (sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (sβ k)))).inv h))) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) h) - CategoryTheory.PreOneHypercover.isoMk_aux π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreOneHypercover S} {F : CategoryTheory.PreOneHypercover S} (sβ : E.Iβ β F.Iβ) (sβ : β¦i j : E.Iββ¦ β E.Iβ i j β F.Iβ (sβ i) (sβ j)) {i j : E.Iβ} (hβ : β¦i j : E.Iββ¦ β (k : E.Iβ i j) β E.Y k β F.Y (sβ k)) (k : E.Iβ i j) : CategoryTheory.CategoryStruct.comp (hβ k).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― (sβ k)).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) (hβ (sβ.symm ((CategoryTheory.PreOneHypercover.congrIndexOneOfEq β― β―) (sβ k)))).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.PreOneHypercover.congrIndexOneOfEqIso β― β― k).inv (CategoryTheory.eqToHom β―) - CategoryTheory.PreOneHypercover.map π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) : CategoryTheory.PreOneHypercover (F.obj X) - CategoryTheory.PreOneHypercover.map_id π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (E : CategoryTheory.PreOneHypercover X) : E.map (CategoryTheory.Functor.id C) = E - CategoryTheory.PreOneHypercover.map_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) : (E.map F).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.map F E.toPreZeroHypercover - CategoryTheory.PreOneHypercover.map_Iβ π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) (iβ iβ : E.Iβ) : (E.map F).Iβ iβ iβ = E.Iβ iβ iβ - CategoryTheory.PreOneHypercover.sieveβ_map π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) : (E.map F).sieveβ = CategoryTheory.Sieve.functorPushforward F E.sieveβ - CategoryTheory.GrothendieckTopology.OneHypercover.map_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {J : CategoryTheory.GrothendieckTopology C} {X : C} (E : J.OneHypercover X) (F : CategoryTheory.Functor C D) (K : CategoryTheory.GrothendieckTopology D) [E.IsPreservedBy F K] : (E.map F K).toPreOneHypercover = E.map F - CategoryTheory.PreOneHypercover.map_comp π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) {D' : Type u_1} [CategoryTheory.Category.{v_1, u_1} D'] (G : CategoryTheory.Functor D D') : E.map (F.comp G) = (E.map F).map G - CategoryTheory.PreOneHypercover.map_Y π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) (xβ xβΒΉ : (CategoryTheory.PreZeroHypercover.map F E.toPreZeroHypercover).Iβ) (j : E.Iβ xβ xβΒΉ) : (E.map F).Y j = F.obj (E.Y j) - CategoryTheory.PreOneHypercover.map_pβ π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) (xβ xβΒΉ : (CategoryTheory.PreZeroHypercover.map F E.toPreZeroHypercover).Iβ) (j : E.Iβ xβ xβΒΉ) : (E.map F).pβ j = F.map (E.pβ j) - CategoryTheory.PreOneHypercover.map_pβ π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) (xβ xβΒΉ : (CategoryTheory.PreZeroHypercover.map F E.toPreZeroHypercover).Iβ) (j : E.Iβ xβ xβΒΉ) : (E.map F).pβ j = F.map (E.pβ j) - CategoryTheory.PreOneHypercover.isLimitMapMultiforkEquiv π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor C D) {A : Type u} [CategoryTheory.Category.{t, u} A] (P : CategoryTheory.Functor Dα΅α΅ A) : CategoryTheory.Limits.IsLimit ((E.map F).multifork P) β CategoryTheory.Limits.IsLimit (E.multifork (F.op.comp P)) - CategoryTheory.PreOneHypercover.functorPushforward_sieveβ_map_le π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} {E : CategoryTheory.PreOneHypercover X} (F : CategoryTheory.Functor C D) {W : C} {iβ iβ : E.Iβ} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) : CategoryTheory.Sieve.functorPushforward F (E.sieveβ pβ pβ) β€ (E.map F).sieveβ (F.map pβ) (F.map pβ) - CategoryTheory.PreOneHypercover.functorPushforward_sieveβ_of_preservesPullbacks π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} {E : CategoryTheory.PreOneHypercover X} (F : CategoryTheory.Functor C D) {W : C} {iβ iβ : E.Iβ} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) (h : CategoryTheory.CategoryStruct.comp pβ (E.f iβ) = CategoryTheory.CategoryStruct.comp pβ (E.f iβ)) [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] : CategoryTheory.Sieve.functorPushforward F (E.sieveβ pβ pβ) = (E.map F).sieveβ (F.map pβ) (F.map pβ) - CategoryTheory.PreOneHypercover.functorPushforward_sieveβ'_of_preservesLimit π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} {E : CategoryTheory.PreOneHypercover X} (F : CategoryTheory.Functor C D) (iβ iβ : E.Iβ) [CategoryTheory.Limits.HasPullback (E.f iβ) (E.f iβ)] [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (E.f iβ) (E.f iβ)) F] : CategoryTheory.Sieve.functorPushforward F (E.sieveβ' iβ iβ) = (E.map F).sieveβ (F.map (CategoryTheory.Limits.pullback.fst (E.f iβ) (E.f iβ))) (F.map (CategoryTheory.Limits.pullback.snd (E.f iβ) (E.f iβ))) - CategoryTheory.Sieve.overEquiv_preOneHypercover_sieveβ π Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {Y : CategoryTheory.Over X} (E : CategoryTheory.PreOneHypercover Y) {iβ iβ : E.Iβ} {W : CategoryTheory.Over X} (pβ : W βΆ E.X iβ) (pβ : W βΆ E.X iβ) : (CategoryTheory.Sieve.overEquiv W) (E.sieveβ pβ pβ) = (E.map (CategoryTheory.Over.forget X)).sieveβ (CategoryTheory.Over.Hom.left pβ) (CategoryTheory.Over.Hom.left pβ) - CategoryTheory.PreOneHypercover.IsStronglySeparatedFor π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor Cα΅α΅ (Type u_3)) : Prop - CategoryTheory.PreOneHypercover.IsStronglySheafFor π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} (E : CategoryTheory.PreOneHypercover X) (F : CategoryTheory.Functor Cα΅α΅ (Type u_3)) : Prop - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isStronglySeparatedFor π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_2)} (h : E.IsStronglySheafFor F) : E.IsStronglySeparatedFor F - CategoryTheory.PreOneHypercover.IsStronglySeparatedFor.isSeparatedFor_presieveβ π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (self : E.IsStronglySeparatedFor F) : CategoryTheory.Presieve.IsSeparatedFor F E.presieveβ - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isSheafFor_presieveβ π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (self : E.IsStronglySheafFor F) : CategoryTheory.Presieve.IsSheafFor F E.presieveβ - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isLimitMultifork π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_2)} (h : E.IsStronglySheafFor F) : CategoryTheory.Limits.IsLimit (E.multifork F) - CategoryTheory.PreOneHypercover.IsStronglySeparatedFor.isSeparatedFor_sieveβ π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (self : E.IsStronglySeparatedFor F) β¦i j : E.Iββ¦ β¦W : Cβ¦ (pβ : W βΆ E.X i) (pβ : W βΆ E.X j) (h : CategoryTheory.CategoryStruct.comp pβ (E.f i) = CategoryTheory.CategoryStruct.comp pβ (E.f j)) : CategoryTheory.Presieve.IsSeparatedFor F (E.sieveβ pβ pβ).arrows - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isSeparatedFor_sieveβ π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (self : E.IsStronglySheafFor F) β¦i j : E.Iββ¦ β¦W : Cβ¦ (pβ : W βΆ E.X i) (pβ : W βΆ E.X j) (h : CategoryTheory.CategoryStruct.comp pβ (E.f i) = CategoryTheory.CategoryStruct.comp pβ (E.f j)) : CategoryTheory.Presieve.IsSeparatedFor F (E.sieveβ pβ pβ).arrows - CategoryTheory.PreOneHypercover.IsStronglySeparatedFor.mk π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (isSeparatedFor_presieveβ : CategoryTheory.Presieve.IsSeparatedFor F E.presieveβ) (isSeparatedFor_sieveβ : β β¦i j : E.Iββ¦ β¦W : Cβ¦ (pβ : W βΆ E.X i) (pβ : W βΆ E.X j), CategoryTheory.CategoryStruct.comp pβ (E.f i) = CategoryTheory.CategoryStruct.comp pβ (E.f j) β CategoryTheory.Presieve.IsSeparatedFor F (E.sieveβ pβ pβ).arrows) : E.IsStronglySeparatedFor F - CategoryTheory.PreOneHypercover.IsStronglySheafFor.mk π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_3)} (isSheafFor_presieveβ : CategoryTheory.Presieve.IsSheafFor F E.presieveβ) (isSeparatedFor_sieveβ : β β¦i j : E.Iββ¦ β¦W : Cβ¦ (pβ : W βΆ E.X i) (pβ : W βΆ E.X j), CategoryTheory.CategoryStruct.comp pβ (E.f i) = CategoryTheory.CategoryStruct.comp pβ (E.f j) β CategoryTheory.Presieve.IsSeparatedFor F (E.sieveβ pβ pβ).arrows) : E.IsStronglySheafFor F - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isSheafFor_sieve_of_pullback π Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : C} {E : CategoryTheory.PreOneHypercover X} {F : CategoryTheory.Functor Cα΅α΅ (Type u_2)} (hβ : E.IsStronglySheafFor F) (hβ : β β¦Y : Cβ¦ (f : Y βΆ X), CategoryTheory.Presieve.IsSeparatedFor F (CategoryTheory.Sieve.pullback f E.sieveβ).arrows) {S : CategoryTheory.Sieve X} (H : β (i : E.Iβ), CategoryTheory.Presieve.IsSheafFor F (CategoryTheory.Sieve.pullback (E.f i) S).arrows) (H' : β β¦i j : E.Iββ¦ (k : E.Iβ i j), CategoryTheory.Presieve.IsSeparatedFor F (CategoryTheory.Sieve.pullback (CategoryTheory.CategoryStruct.comp (E.pβ k) (E.f i)) S).arrows) : CategoryTheory.Presieve.IsSheafFor F S.arrows
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c