Loogle!
Result
Found 247 declarations mentioning CategoryTheory.PreOneHypercover.toPreZeroHypercover. Of these, only the first 200 are shown.
- 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.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.instHasPullbacksToPreOneHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] : E.toPreOneHypercover.HasPullbacks - 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.trivial_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] (S : C) : (CategoryTheory.PreOneHypercover.trivial S).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.singleton (CategoryTheory.CategoryStruct.id S) - CategoryTheory.PreZeroHypercover.toPreOneHypercover_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] : E.toPreOneHypercover.toPreZeroHypercover = E - 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.preOneHypercover_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) : S.preOneHypercover.I₀ = S.Arrow - 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.GrothendieckTopology.OneHypercover.toZeroHypercover_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) : E.toZeroHypercover.toPreZeroHypercover = E.toPreZeroHypercover - CategoryTheory.GrothendieckTopology.Cover.preOneHypercover_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) (f : S.Arrow) : S.preOneHypercover.X f = f.Y - 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.GrothendieckTopology.Cover.preOneHypercover_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) (f : S.Arrow) : S.preOneHypercover.f f = f.f - 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.GrothendieckTopology.OneHypercover.mem₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (self : J.OneHypercover S) : self.sieve₀ ∈ J S - 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.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.instHasPullbacksRefineOneHypercover 📋 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))) : (E.refineOneHypercover F).HasPullbacks - CategoryTheory.GrothendieckTopology.Cover.preOneHypercover_sieve₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (S : J.Cover X) : S.preOneHypercover.sieve₀ = ↑S - CategoryTheory.PreZeroHypercover.refineOneHypercover_toPreZeroHypercover 📋 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))) : (E.refineOneHypercover F).toPreZeroHypercover = E - 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.GrothendieckTopology.OneHypercover.id_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) (a : E.I₀) : (CategoryTheory.CategoryStruct.id E).s₀ a = a - CategoryTheory.PreOneHypercover.sieve₀_trivial 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] (S : C) : (CategoryTheory.PreOneHypercover.trivial S).sieve₀ = ⊤ - CategoryTheory.GrothendieckTopology.OneHypercover.id_s₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) {i✝ j✝ : E.I₀} (a : E.I₁ i✝ j✝) : (CategoryTheory.CategoryStruct.id E).s₁ a = a - 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.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.GrothendieckTopology.OneHypercover.id_h₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) {i✝ j✝ : E.I₀} (x✝ : E.I₁ i✝ j✝) : (CategoryTheory.CategoryStruct.id E).h₁ x✝ = CategoryTheory.CategoryStruct.id (E.Y x✝) - CategoryTheory.GrothendieckTopology.OneHypercover.id_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) (x✝ : E.I₀) : (CategoryTheory.CategoryStruct.id E).h₀ x✝ = CategoryTheory.CategoryStruct.id (E.X x✝) - 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.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.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.PreZeroHypercover.sieve₁'_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))) (i j : E.I₀) : (E.refineOneHypercover F).sieve₁' i j = (F i j).sieve₀ - CategoryTheory.GrothendieckTopology.OneHypercover.comp_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {X✝ Y✝ Z✝ : J.OneHypercover 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.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.GrothendieckTopology.OneHypercover.mem₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (self : J.OneHypercover S) (i₁ i₂ : self.I₀) ⦃W : C⦄ (p₁ : W ⟶ self.X i₁) (p₂ : W ⟶ self.X i₂) (w : CategoryTheory.CategoryStruct.comp p₁ (self.f i₁) = CategoryTheory.CategoryStruct.comp p₂ (self.f i₂)) : self.sieve₁ p₁ p₂ ∈ J W - 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.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.GrothendieckTopology.OneHypercover.inter 📋 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))] : J.OneHypercover S - 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.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.GrothendieckTopology.OneHypercover.mem_sieve₁' 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} (E : J.OneHypercover S) (i₁ i₂ : E.I₀) [CategoryTheory.Limits.HasPullback (E.f i₁) (E.f i₂)] : E.sieve₁' i₁ i₂ ∈ J (CategoryTheory.Limits.pullback (E.f i₁) (E.f i₂)) - 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.GrothendieckTopology.OneHypercover.comp_s₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {X✝ Y✝ Z✝ : J.OneHypercover 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.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.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.GrothendieckTopology.OneHypercover.multiforkLift_map 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {J : CategoryTheory.GrothendieckTopology C} {S : C} {E : J.OneHypercover S} {F : CategoryTheory.Sheaf J A} (c : CategoryTheory.Limits.Multifork (E.multicospanIndex F.obj)) (i₀ : E.I₀) : CategoryTheory.CategoryStruct.comp (CategoryTheory.GrothendieckTopology.OneHypercover.multiforkLift c) (F.obj.map (E.f i₀).op) = c.ι i₀ - 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.GrothendieckTopology.OneHypercover.comp_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {X✝ Y✝ Z✝ : J.OneHypercover 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.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.GrothendieckTopology.OneHypercover.multiforkLift_map_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] {J : CategoryTheory.GrothendieckTopology C} {S : C} {E : J.OneHypercover S} {F : CategoryTheory.Sheaf J A} (c : CategoryTheory.Limits.Multifork (E.multicospanIndex F.obj)) (i₀ : E.I₀) {Z : A} (h : F.obj.obj (Opposite.op (E.X i₀)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.GrothendieckTopology.OneHypercover.multiforkLift c) (CategoryTheory.CategoryStruct.comp (F.obj.map (E.f i₀).op) h) = CategoryTheory.CategoryStruct.comp (c.ι i₀) h - 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.GrothendieckTopology.OneHypercover.comp_h₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {S : C} {X✝ Y✝ Z✝ : J.OneHypercover 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.sieve₁'_toPreOneHypercover_eq_top 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] (i j : E.I₀) : E.toPreOneHypercover.sieve₁' i j = ⊤ - 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.GrothendieckTopology.OneHypercoverFamily.exists_oneHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (H : J.OneHypercoverFamily) [H.IsGenerating] {X : C} (S : CategoryTheory.Sieve X) (hS : S ∈ J X) : ∃ E, ∃ (_ : H E), E.sieve₀ ≤ S - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsGenerating.le 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.GrothendieckTopology C} {H : J.OneHypercoverFamily} [self : H.IsGenerating] {X : C} (S : CategoryTheory.Sieve X) (hS : S ∈ J X) : ∃ E, ∃ (_ : H E), E.sieve₀ ≤ S - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsGenerating.mk 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {H : J.OneHypercoverFamily} (le : ∀ {X : C}, ∀ S ∈ J X, ∃ E, ∃ (_ : H E), E.sieve₀ ≤ S) : H.IsGenerating - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.isLimit 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] {H : J.OneHypercoverFamily} {P : CategoryTheory.Functor Cᵒᵖ A} (hP : ∀ ⦃X : C⦄ (E : J.OneHypercover X), H E → Nonempty (CategoryTheory.Limits.IsLimit (E.multifork P))) {X : C} {S : CategoryTheory.Sieve X} {E : J.OneHypercover X} (hE : H E) (le : E.sieve₀ ≤ S) [H.IsGenerating] : CategoryTheory.Limits.IsLimit (CategoryTheory.GrothendieckTopology.Cover.multifork ⟨S, ⋯⟩ P) - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.lift 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] {H : J.OneHypercoverFamily} {P : CategoryTheory.Functor Cᵒᵖ A} (hP : ∀ ⦃X : C⦄ (E : J.OneHypercover X), H E → Nonempty (CategoryTheory.Limits.IsLimit (E.multifork P))) {X : C} {S : CategoryTheory.Sieve X} {E : J.OneHypercover X} (hE : H E) (le : E.sieve₀ ≤ S) (F : CategoryTheory.Limits.Multifork (CategoryTheory.GrothendieckTopology.Cover.index ⟨S, ⋯⟩ P)) : F.pt ⟶ P.obj (Opposite.op X) - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.fac 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] {H : J.OneHypercoverFamily} {P : CategoryTheory.Functor Cᵒᵖ A} (hP : ∀ ⦃X : C⦄ (E : J.OneHypercover X), H E → Nonempty (CategoryTheory.Limits.IsLimit (E.multifork P))) {X : C} {S : CategoryTheory.Sieve X} {E : J.OneHypercover X} (hE : H E) (le : E.sieve₀ ≤ S) (F : CategoryTheory.Limits.Multifork (CategoryTheory.GrothendieckTopology.Cover.index ⟨S, ⋯⟩ P)) [H.IsGenerating] {Y : C} (f : Y ⟶ X) (hf : S.arrows f) : CategoryTheory.CategoryStruct.comp (CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.lift hP hE le F) (P.map f.op) = F.ι { Y := Y, f := f, hf := hf } - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.fac' 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] {H : J.OneHypercoverFamily} {P : CategoryTheory.Functor Cᵒᵖ A} (hP : ∀ ⦃X : C⦄ (E : J.OneHypercover X), H E → Nonempty (CategoryTheory.Limits.IsLimit (E.multifork P))) {X : C} {S : CategoryTheory.Sieve X} {E : J.OneHypercover X} (hE : H E) (le : E.sieve₀ ≤ S) (F : CategoryTheory.Limits.Multifork (CategoryTheory.GrothendieckTopology.Cover.index ⟨S, ⋯⟩ P)) (i : E.I₀) : CategoryTheory.CategoryStruct.comp (CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.lift hP hE le F) (P.map (E.f i).op) = F.ι { Y := E.X i, f := E.f i, hf := ⋯ } - CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.fac'_assoc 📋 Mathlib.CategoryTheory.Sites.Hypercover.IsSheaf
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type u'} [CategoryTheory.Category.{v', u'} A] {H : J.OneHypercoverFamily} {P : CategoryTheory.Functor Cᵒᵖ A} (hP : ∀ ⦃X : C⦄ (E : J.OneHypercover X), H E → Nonempty (CategoryTheory.Limits.IsLimit (E.multifork P))) {X : C} {S : CategoryTheory.Sieve X} {E : J.OneHypercover X} (hE : H E) (le : E.sieve₀ ≤ S) (F : CategoryTheory.Limits.Multifork (CategoryTheory.GrothendieckTopology.Cover.index ⟨S, ⋯⟩ P)) (i : E.I₀) {Z : A} (h : P.obj (Opposite.op (E.X i)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.GrothendieckTopology.OneHypercoverFamily.IsSheafIff.lift hP hE le F) (CategoryTheory.CategoryStruct.comp (P.map (E.f i).op) h) = CategoryTheory.CategoryStruct.comp (F.ι { Y := E.X i, f := E.f i, hf := ⋯ }) h - 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.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.GrothendieckTopology.OneHypercover.IsPreservedBy.mem₀ 📋 Mathlib.CategoryTheory.Sites.Continuous
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {J : CategoryTheory.GrothendieckTopology C} {X : C} {E : J.OneHypercover X} {F : CategoryTheory.Functor C D} {K : CategoryTheory.GrothendieckTopology D} [self : E.IsPreservedBy F K] : (E.map F).sieve₀ ∈ K (F.obj X) - 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.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.GrothendieckTopology.OneHypercover.IsPreservedBy.mem₁ 📋 Mathlib.CategoryTheory.Sites.Continuous
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {J : CategoryTheory.GrothendieckTopology C} {X : C} {E : J.OneHypercover X} {F : CategoryTheory.Functor C D} {K : CategoryTheory.GrothendieckTopology D} [self : E.IsPreservedBy F K] (i₁ i₂ : E.I₀) ⦃W : D⦄ (p₁ : W ⟶ F.obj (E.X i₁)) (p₂ : W ⟶ F.obj (E.X i₂)) (w : CategoryTheory.CategoryStruct.comp p₁ (F.map (E.f i₁)) = CategoryTheory.CategoryStruct.comp p₂ (F.map (E.f i₂))) : (E.map F).sieve₁ p₁ p₂ ∈ K W - CategoryTheory.GrothendieckTopology.OneHypercover.IsPreservedBy.mk 📋 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} (mem₀ : (E.map F).sieve₀ ∈ K (F.obj X)) (mem₁ : ∀ (i₁ i₂ : E.I₀) ⦃W : D⦄ (p₁ : W ⟶ F.obj (E.X i₁)) (p₂ : W ⟶ F.obj (E.X i₂)), CategoryTheory.CategoryStruct.comp p₁ (F.map (E.f i₁)) = CategoryTheory.CategoryStruct.comp p₂ (F.map (E.f i₂)) → (E.map F).sieve₁ p₁ p₂ ∈ K W) : E.IsPreservedBy F K - 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.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.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 - CategoryTheory.PreOneHypercover.IsStronglySheafFor.isSheafFor_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) {R : CategoryTheory.Presieve X} (H : ∀ (i : E.I₀), CategoryTheory.Presieve.IsSheafFor F (CategoryTheory.Sieve.pullback (E.f i) (CategoryTheory.Sieve.generate R)).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)) (CategoryTheory.Sieve.generate R)).arrows) : CategoryTheory.Presieve.IsSheafFor F R - CategoryTheory.GrothendieckTopology.OneHypercover.isSheafFor_sieve_of_pullback 📋 Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} (E : J.OneHypercover X) {F : CategoryTheory.Functor Cᵒᵖ (Type u_2)} (hF : CategoryTheory.Presieve.IsSheaf J F) {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 - CategoryTheory.GrothendieckTopology.OneHypercover.isSheafFor_of_pullback 📋 Mathlib.CategoryTheory.Sites.Hypercover.SheafOfTypes
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.GrothendieckTopology C} {X : C} {E : J.OneHypercover X} {F : CategoryTheory.Functor Cᵒᵖ (Type u_2)} (hF : CategoryTheory.Presieve.IsSheaf J F) {R : CategoryTheory.Presieve X} (h₁ : ∀ (i : E.I₀), CategoryTheory.Presieve.IsSheafFor F (CategoryTheory.Sieve.pullback (E.f i) (CategoryTheory.Sieve.generate R)).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)) (CategoryTheory.Sieve.generate R)).arrows) : CategoryTheory.Presieve.IsSheafFor F R - CategoryTheory.PreOneHypercover.IsStronglySheafFor.amalgamate 📋 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) (x : (i : E.I₀) → F.obj (Opposite.op (E.X i))) (hc : ∀ ⦃i j : E.I₀⦄ (k : E.I₁ i j), (CategoryTheory.ConcreteCategory.hom (F.map (E.p₁ k).op)) (x i) = (CategoryTheory.ConcreteCategory.hom (F.map (E.p₂ k).op)) (x j)) : F.obj (Opposite.op X) - CategoryTheory.PreOneHypercover.IsStronglySeparatedFor.arrowsCompatible 📋 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.IsStronglySeparatedFor F) (x : (i : E.I₀) → F.obj (Opposite.op (E.X i))) (hc : ∀ ⦃i j : E.I₀⦄ (k : E.I₁ i j), (CategoryTheory.ConcreteCategory.hom (F.map (E.p₁ k).op)) (x i) = (CategoryTheory.ConcreteCategory.hom (F.map (E.p₂ k).op)) (x j)) : CategoryTheory.Presieve.Arrows.Compatible F E.f x - CategoryTheory.PreOneHypercover.IsStronglySheafFor.map_amalgamate 📋 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) (x : (i : E.I₀) → F.obj (Opposite.op (E.X i))) (hc : ∀ ⦃i j : E.I₀⦄ (k : E.I₁ i j), (CategoryTheory.ConcreteCategory.hom (F.map (E.p₁ k).op)) (x i) = (CategoryTheory.ConcreteCategory.hom (F.map (E.p₂ k).op)) (x j)) (i : E.I₀) : (CategoryTheory.ConcreteCategory.hom (F.map (E.f i).op)) (h.amalgamate x hc) = x i
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