Loogle!
Result
Found 481 declarations mentioning CategoryTheory.PreZeroHypercover.f. Of these, only the first 200 are shown.
- CategoryTheory.PreZeroHypercover.f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (self : CategoryTheory.PreZeroHypercover S) (i : self.I₀) : self.X i ⟶ S - CategoryTheory.PreZeroHypercover.presieve₀_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (i : E.I₀) : E.presieve₀ (E.f i) - CategoryTheory.PreZeroHypercover.sieve₀_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (i : E.I₀) : E.sieve₀.arrows (E.f i) - CategoryTheory.PreZeroHypercover.singleton_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (x✝ : PUnit.{w + 1}) : (CategoryTheory.PreZeroHypercover.singleton f).f x✝ = f - CategoryTheory.PreZeroHypercover.empty_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (S : C) (i : PEmpty.{w + 1}) : (CategoryTheory.PreZeroHypercover.empty S).f i = i.elim - CategoryTheory.PreZeroHypercover.pullback₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] : CategoryTheory.PreZeroHypercover S - CategoryTheory.PreZeroHypercover.pullback₂ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : CategoryTheory.PreZeroHypercover S - CategoryTheory.PreZeroHypercover.restrictIndex_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) {ι : Type w'} (f : ι → E.I₀) (i : ι) : (E.restrictIndex f).f i = E.f (f i) - CategoryTheory.Precoverage.ZeroHypercover.instHasPullbackFOfHasPullbacksPresieve₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (E : CategoryTheory.PreZeroHypercover X) (f : Y ⟶ X) [E.presieve₀.HasPullbacks f] (i : E.I₀) : CategoryTheory.Limits.HasPullback (E.f i) f - CategoryTheory.Precoverage.ZeroHypercover.instHasPullbackFOfHasPullbacksPresieve₀_1 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (E : CategoryTheory.PreZeroHypercover X) (f : Y ⟶ X) [E.presieve₀.HasPullbacks f] (i : E.I₀) : CategoryTheory.Limits.HasPullback f (E.f i) - CategoryTheory.PreZeroHypercover.inter 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) (F : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : CategoryTheory.PreZeroHypercover T - CategoryTheory.PreZeroHypercover.pullback₁_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] : (CategoryTheory.PreZeroHypercover.pullback₁ f E).I₀ = E.I₀ - CategoryTheory.PreZeroHypercover.pullback₂_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : (CategoryTheory.PreZeroHypercover.pullback₂ f E).I₀ = E.I₀ - CategoryTheory.PreZeroHypercover.add_f_nome 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {T : C} (f : T ⟶ S) : (E.add f).f none = f - CategoryTheory.PreZeroHypercover.interFst 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : (E.inter F).Hom E - CategoryTheory.PreZeroHypercover.interSnd 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : (E.inter F).Hom F - CategoryTheory.Precoverage.ZeroHypercover.pullback₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} [J.IsStableUnderBaseChange] (f : S ⟶ T) (E : J.ZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] : J.ZeroHypercover S - CategoryTheory.Precoverage.ZeroHypercover.pullback₂ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} [J.IsStableUnderBaseChange] (f : S ⟶ T) (E : J.ZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : J.ZeroHypercover S - CategoryTheory.PreZeroHypercover.pushforward_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y : C} (f : X ⟶ Y) (E : CategoryTheory.PreZeroHypercover X) (i : E.I₀) : (CategoryTheory.PreZeroHypercover.pushforward f E).f i = CategoryTheory.CategoryStruct.comp (E.f i) f - CategoryTheory.PreZeroHypercover.inter_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) (F : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : (E.inter F).I₀ = (E.I₀ × F.1) - CategoryTheory.PreZeroHypercover.add_f_some 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {T : C} (f : T ⟶ S) (i : E.I₀) : (E.add f).f (some i) = E.f i - CategoryTheory.PreZeroHypercover.sum_f_inl 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) (i : E.I₀) : (E.sum F).f (Sum.inl i) = E.f i - CategoryTheory.PreZeroHypercover.sum_f_inr 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) (i : F.I₀) : (E.sum F).f (Sum.inr i) = F.f i - CategoryTheory.PreZeroHypercover.interLift 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} {G : CategoryTheory.PreZeroHypercover S} [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (f : G.Hom E) (g : G.Hom F) : G.Hom (E.inter F) - CategoryTheory.PreZeroHypercover.shrink_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) : E.shrink.I₀ = ↑(Set.range fun i => ⟨E.X i, E.f i⟩) - CategoryTheory.PreZeroHypercover.pullback₁_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] (i : E.I₀) : (CategoryTheory.PreZeroHypercover.pullback₁ f E).X i = CategoryTheory.Limits.pullback f (E.f i) - CategoryTheory.PreZeroHypercover.pullback₂_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (i : E.I₀) : (CategoryTheory.PreZeroHypercover.pullback₂ f E).X i = CategoryTheory.Limits.pullback (E.f i) f - CategoryTheory.Precoverage.mem_iff_exists_zeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {X : C} {R : CategoryTheory.Presieve X} : R ∈ J.coverings X ↔ ∃ 𝒰, R = CategoryTheory.Presieve.ofArrows 𝒰.X 𝒰.f - CategoryTheory.PreZeroHypercover.pullbackCoverOfLeft 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.f i) f) g] : CategoryTheory.PreZeroHypercover (CategoryTheory.Limits.pullback f g) - CategoryTheory.PreZeroHypercover.pullbackCoverOfRight 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} (E : CategoryTheory.PreZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (CategoryTheory.CategoryStruct.comp (E.f i) g)] : CategoryTheory.PreZeroHypercover (CategoryTheory.Limits.pullback f g) - CategoryTheory.Precoverage.ZeroHypercover.instSmallPullback₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [E.Small] {T : C} (f : T ⟶ S) [J.IsStableUnderBaseChange] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f E).Small - CategoryTheory.PreZeroHypercover.map_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (F : CategoryTheory.Functor C D) (E : CategoryTheory.PreZeroHypercover S) (i : E.I₀) : (CategoryTheory.PreZeroHypercover.map F E).f i = F.map (E.f i) - CategoryTheory.PreZeroHypercover.pullbackIso 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : CategoryTheory.PreZeroHypercover.pullback₁ f E ≅ CategoryTheory.PreZeroHypercover.pullback₂ f E - CategoryTheory.PreZeroHypercover.Hom.w₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} (self : E.Hom F) (i : E.I₀) : CategoryTheory.CategoryStruct.comp (self.h₀ i) (F.f (self.s₀ i)) = E.f i - CategoryTheory.PreZeroHypercover.presieve₀_pullback₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : (CategoryTheory.PreZeroHypercover.pullback₂ f E).presieve₀ = CategoryTheory.Presieve.pullbackArrows f E.presieve₀ - CategoryTheory.PreZeroHypercover.interSnd_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (i : (E.inter F).I₀) : (E.interSnd F).s₀ i = i.2 - CategoryTheory.PreZeroHypercover.interFst_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (i : (E.inter F).I₀) : (E.interFst F).s₀ i = i.1 - CategoryTheory.Precoverage.ZeroHypercover.pullback₁_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} [J.IsStableUnderBaseChange] (f : S ⟶ T) (E : J.ZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f E).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.pullback₁ f E.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.pullback₂_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} [J.IsStableUnderBaseChange] (f : S ⟶ T) (E : J.ZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] : (CategoryTheory.Precoverage.ZeroHypercover.pullback₂ f E).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.pullback₂ f E.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.inter 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} [J.IsStableUnderBaseChange] [J.IsStableUnderComposition] (E : J.ZeroHypercover T) (F : J.ZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : J.ZeroHypercover T - CategoryTheory.PreZeroHypercover.ext 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {S : C} {x y : CategoryTheory.PreZeroHypercover S} (I₀ : x.I₀ = y.I₀) (X : x.X ≍ y.X) (f : x.f ≍ y.f) : x = y - CategoryTheory.PreZeroHypercover.pullbackCoverOfLeft_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.f i) f) g] : (E.pullbackCoverOfLeft f g).I₀ = E.I₀ - CategoryTheory.PreZeroHypercover.pullbackCoverOfRight_I₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} (E : CategoryTheory.PreZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (CategoryTheory.CategoryStruct.comp (E.f i) g)] : (E.pullbackCoverOfRight f g).I₀ = E.I₀ - CategoryTheory.PreZeroHypercover.ext_iff 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {S : C} {x y : CategoryTheory.PreZeroHypercover S} : x = y ↔ x.I₀ = y.I₀ ∧ x.X ≍ y.X ∧ x.f ≍ y.f - CategoryTheory.PreZeroHypercover.pullback₁_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] (x✝ : E.I₀) : (CategoryTheory.PreZeroHypercover.pullback₁ f E).f x✝ = CategoryTheory.Limits.pullback.fst f (E.f x✝) - CategoryTheory.PreZeroHypercover.pullback₂_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (x✝ : E.I₀) : (CategoryTheory.PreZeroHypercover.pullback₂ f E).f x✝ = CategoryTheory.Limits.pullback.snd (E.f x✝) f - CategoryTheory.PreZeroHypercover.Hom.mk 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ → F.I₀) (h₀ : (i : E.I₀) → E.X i ⟶ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i) (F.f (s₀ i)) = E.f i := by cat_disch) : E.Hom F - CategoryTheory.Precoverage.ZeroHypercover.pullbackCoverOfLeft 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {X : C} (E : J.ZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.fst f g)] : J.ZeroHypercover (CategoryTheory.Limits.pullback f g) - CategoryTheory.Precoverage.ZeroHypercover.pullbackCoverOfRight 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {Y : C} (E : J.ZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.snd f g)] : J.ZeroHypercover (CategoryTheory.Limits.pullback f g) - CategoryTheory.PreZeroHypercover.presieve₀_sigmaOfIsColimit 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) : (E.sigmaOfIsColimit hc).presieve₀ = CategoryTheory.Presieve.singleton (CategoryTheory.Limits.Cofan.IsColimit.desc hc E.f) - CategoryTheory.PreZeroHypercover.sigmaOfIsColimit_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) (x✝ : PUnit.{w + 1}) : (E.sigmaOfIsColimit hc).f x✝ = CategoryTheory.Limits.Cofan.IsColimit.desc hc E.f - CategoryTheory.PreZeroHypercover.reindex_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) {ι : Type w'} (e : ι ≃ E.I₀) (i : ι) : (E.reindex e).f i = E.f (e i) - CategoryTheory.PreZeroHypercover.interLift_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} {G : CategoryTheory.PreZeroHypercover S} [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (f : G.Hom E) (g : G.Hom F) (i : G.I₀) : (CategoryTheory.PreZeroHypercover.interLift f g).s₀ i = (f.s₀ i, g.s₀ i) - CategoryTheory.Precoverage.ZeroHypercover.inter_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} [J.IsStableUnderBaseChange] [J.IsStableUnderComposition] (E : J.ZeroHypercover T) (F : J.ZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : (E.inter F).toPreZeroHypercover = E.inter F.toPreZeroHypercover - CategoryTheory.PreZeroHypercover.inter_def 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] : E.inter F = (E.bind fun i => CategoryTheory.PreZeroHypercover.pullback₁ (E.f i) F).reindex (Equiv.sigmaEquivProd E.I₀ F.1).symm - CategoryTheory.PreZeroHypercover.Hom.w₀_assoc 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} (self : E.Hom F) (i : E.I₀) {Z : C} (h : S ⟶ Z) : CategoryTheory.CategoryStruct.comp (self.h₀ i) (CategoryTheory.CategoryStruct.comp (F.f (self.s₀ i)) h) = CategoryTheory.CategoryStruct.comp (E.f i) h - CategoryTheory.PreZeroHypercover.sum_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) (F : CategoryTheory.PreZeroHypercover X) (x✝ : E.I₀ ⊕ F.I₀) : (E.sum F).f x✝ = match x✝ with | Sum.inl i => E.f i | Sum.inr i => F.f i - CategoryTheory.PreZeroHypercover.pullbackCoverOfLeft_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.f i) f) g] (i : E.I₀) : (E.pullbackCoverOfLeft f g).X i = CategoryTheory.Limits.pullback (CategoryTheory.CategoryStruct.comp (E.f i) f) g - CategoryTheory.PreZeroHypercover.pullbackCoverOfRight_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} (E : CategoryTheory.PreZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (CategoryTheory.CategoryStruct.comp (E.f i) g)] (i : E.I₀) : (E.pullbackCoverOfRight f g).X i = CategoryTheory.Limits.pullback f (CategoryTheory.CategoryStruct.comp (E.f i) g) - CategoryTheory.PreZeroHypercover.inj_sigmaOfIsColimit_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) (i : E.I₀) (r : PUnit.{w + 1}) : CategoryTheory.CategoryStruct.comp (c.inj i) ((E.sigmaOfIsColimit hc).f r) = E.f i - CategoryTheory.PreZeroHypercover.pullbackIso_hom_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (a : (CategoryTheory.PreZeroHypercover.pullback₁ f E).I₀) : (CategoryTheory.PreZeroHypercover.pullbackIso f E).hom.s₀ a = id a - CategoryTheory.PreZeroHypercover.pullbackIso_inv_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (a : (CategoryTheory.PreZeroHypercover.pullback₂ f E).I₀) : (CategoryTheory.PreZeroHypercover.pullbackIso f E).inv.s₀ a = id a - CategoryTheory.Precoverage.ZeroHypercover.pullbackCoverOfLeft_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {X : C} (E : J.ZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.fst f g)] : (E.pullbackCoverOfLeft f g).toPreZeroHypercover = E.pullbackCoverOfLeft f g - CategoryTheory.Precoverage.ZeroHypercover.pullbackCoverOfRight_toPreZeroHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {Y : C} (E : J.ZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.snd f g)] : (E.pullbackCoverOfRight f g).toPreZeroHypercover = E.pullbackCoverOfRight f g - CategoryTheory.PreZeroHypercover.inv_hom_h₀_comp_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E ≅ F) (i : E.I₀) : CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (e.hom.h₀ i)) (E.f i) = F.f (e.hom.s₀ i) - CategoryTheory.PreZeroHypercover.inv_inv_h₀_comp_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E ≅ F) (i : F.I₀) : CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (e.inv.h₀ i)) (F.f i) = E.f (e.inv.s₀ i) - CategoryTheory.PreZeroHypercover.pullbackCoverOfLeftIsoPullback₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.Limits.pullback.fst f g) (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.fst f g)] : E.pullbackCoverOfLeft f g ≅ CategoryTheory.PreZeroHypercover.pullback₁ (CategoryTheory.Limits.pullback.fst f g) E - CategoryTheory.PreZeroHypercover.pullbackCoverOfRightIsoPullback₂ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} (E : CategoryTheory.PreZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) (CategoryTheory.Limits.pullback.snd f g)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.Limits.pullback.snd f g) (E.f i)] : E.pullbackCoverOfRight f g ≅ CategoryTheory.PreZeroHypercover.pullback₂ (CategoryTheory.Limits.pullback.snd f g) E - CategoryTheory.PreZeroHypercover.inj_sigmaOfIsColimit_f_assoc 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) {c : CategoryTheory.Limits.Cofan E.X} (hc : CategoryTheory.Limits.IsColimit c) (i : E.I₀) (r : PUnit.{w + 1}) {Z : C} (h : S ⟶ Z) : CategoryTheory.CategoryStruct.comp (c.inj i) (CategoryTheory.CategoryStruct.comp ((E.sigmaOfIsColimit hc).f r) h) = CategoryTheory.CategoryStruct.comp (E.f i) h - CategoryTheory.Presieve.preZeroHypercover_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (R : CategoryTheory.Presieve S) (i : ↑R.uncurry) : R.preZeroHypercover.f i = (↑i).snd - CategoryTheory.PreZeroHypercover.shrink_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (i : ↑E.presieve₀.uncurry) : E.shrink.f i = (↑i).snd - CategoryTheory.PreZeroHypercover.pullbackCoverOfLeft_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) {Y Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (CategoryTheory.CategoryStruct.comp (E.f i) f) g] (i : E.I₀) : (E.pullbackCoverOfLeft f g).f i = CategoryTheory.Limits.pullback.map (CategoryTheory.CategoryStruct.comp (E.f i) f) g f g (E.f i) (CategoryTheory.CategoryStruct.id Y) (CategoryTheory.CategoryStruct.id Z) ⋯ ⋯ - CategoryTheory.PreZeroHypercover.pullbackCoverOfRight_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {Y : C} (E : CategoryTheory.PreZeroHypercover Y) {X Z : C} (f : X ⟶ Z) (g : Y ⟶ Z) [CategoryTheory.Limits.HasPullback f g] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (CategoryTheory.CategoryStruct.comp (E.f i) g)] (i : E.I₀) : (E.pullbackCoverOfRight f g).f i = CategoryTheory.Limits.pullback.map f (CategoryTheory.CategoryStruct.comp (E.f i) g) f g (CategoryTheory.CategoryStruct.id X) (E.f i) (CategoryTheory.CategoryStruct.id Z) ⋯ ⋯ - CategoryTheory.PreZeroHypercover.inv_hom_h₀_comp_f_assoc 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E ≅ F) (i : E.I₀) {Z : C} (h : S ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (e.hom.h₀ i)) (CategoryTheory.CategoryStruct.comp (E.f i) h) = CategoryTheory.CategoryStruct.comp (F.f (e.hom.s₀ i)) h - CategoryTheory.PreZeroHypercover.inv_inv_h₀_comp_f_assoc 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E ≅ F) (i : F.I₀) {Z : C} (h : S ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (e.inv.h₀ i)) (CategoryTheory.CategoryStruct.comp (F.f i) h) = CategoryTheory.CategoryStruct.comp (E.f (e.inv.s₀ i)) h - CategoryTheory.PreZeroHypercover.pullbackIso_hom_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (i : (CategoryTheory.PreZeroHypercover.pullback₁ f E).I₀) : (CategoryTheory.PreZeroHypercover.pullbackIso f E).hom.h₀ i = (CategoryTheory.Limits.pullbackSymmetry f (E.f i)).hom - CategoryTheory.PreZeroHypercover.pullbackIso_inv_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S T : C} (f : S ⟶ T) (E : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback f (E.f i)] [∀ (i : E.I₀), CategoryTheory.Limits.HasPullback (E.f i) f] (i : (CategoryTheory.PreZeroHypercover.pullback₂ f E).I₀) : (CategoryTheory.PreZeroHypercover.pullbackIso f E).inv.h₀ i = (CategoryTheory.Limits.pullbackSymmetry f (E.f i)).inv - CategoryTheory.PreZeroHypercover.bind_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) (F : (i : E.I₀) → CategoryTheory.PreZeroHypercover (E.X i)) (ij : (i : E.I₀) × (F i).I₀) : (E.bind F).f ij = CategoryTheory.CategoryStruct.comp ((F ij.fst).f ij.snd) (E.f ij.fst) - CategoryTheory.PreZeroHypercover.isoMk 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ ≃ F.I₀) (h₀ : (i : E.I₀) → E.X i ≅ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i).hom (F.f (s₀ i)) = E.f i := by cat_disch) : E ≅ F - CategoryTheory.PreZeroHypercover.isoMk_hom_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ ≃ F.I₀) (h₀ : (i : E.I₀) → E.X i ≅ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i).hom (F.f (s₀ i)) = E.f i := by cat_disch) (a : E.I₀) : (CategoryTheory.PreZeroHypercover.isoMk s₀ h₀ w₀).hom.s₀ a = s₀ a - CategoryTheory.PreZeroHypercover.isoMk_inv_s₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ ≃ F.I₀) (h₀ : (i : E.I₀) → E.X i ≅ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i).hom (F.f (s₀ i)) = E.f i := by cat_disch) (a : F.I₀) : (CategoryTheory.PreZeroHypercover.isoMk s₀ h₀ w₀).inv.s₀ a = s₀.symm a - CategoryTheory.PreZeroHypercover.isoMk_hom_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ ≃ F.I₀) (h₀ : (i : E.I₀) → E.X i ≅ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i).hom (F.f (s₀ i)) = E.f i := by cat_disch) (i : E.I₀) : (CategoryTheory.PreZeroHypercover.isoMk s₀ h₀ w₀).hom.h₀ i = (h₀ i).hom - CategoryTheory.PreZeroHypercover.isoMk_inv_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (s₀ : E.I₀ ≃ F.I₀) (h₀ : (i : E.I₀) → E.X i ≅ F.X (s₀ i)) (w₀ : ∀ (i : E.I₀), CategoryTheory.CategoryStruct.comp (h₀ i).hom (F.f (s₀ i)) = E.f i := by cat_disch) (i : F.I₀) : (CategoryTheory.PreZeroHypercover.isoMk s₀ h₀ w₀).inv.h₀ i = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (h₀ (s₀.symm i)).inv - CategoryTheory.PreZeroHypercover.inter_X 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) (F : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (a✝ : E.I₀ × F.1) : (E.inter F).X a✝ = CategoryTheory.Limits.pullback (E.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm a✝).fst) (F.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm a✝).snd) - CategoryTheory.PreZeroHypercover.interLift_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {E : CategoryTheory.PreZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} {G : CategoryTheory.PreZeroHypercover S} [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (f : G.Hom E) (g : G.Hom F) (i : G.I₀) : (CategoryTheory.PreZeroHypercover.interLift f g).h₀ i = CategoryTheory.Limits.pullback.lift (f.h₀ i) (g.h₀ i) ⋯ - CategoryTheory.PreZeroHypercover.interFst_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (x✝ : (E.inter F).I₀) : (E.interFst F).h₀ x✝ = CategoryTheory.Limits.pullback.fst (E.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm x✝).fst) (F.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm x✝).snd) - CategoryTheory.PreZeroHypercover.interSnd_h₀ 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) (F : CategoryTheory.PreZeroHypercover S) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (x✝ : (E.inter F).I₀) : (E.interSnd F).h₀ x✝ = CategoryTheory.Limits.pullback.snd (E.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm x✝).fst) (F.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm x✝).snd) - CategoryTheory.PreZeroHypercover.inter_f 📋 Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {T : C} (E : CategoryTheory.PreZeroHypercover T) (F : CategoryTheory.PreZeroHypercover T) [∀ (i : E.I₀) (j : F.I₀), CategoryTheory.Limits.HasPullback (E.f i) (F.f j)] (i : E.I₀ × F.1) : (E.inter F).f i = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (E.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm i).fst) (F.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm i).snd)) (E.f ((Equiv.sigmaEquivProd E.I₀ F.1).symm i).fst) - 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.PreZeroHypercover.refineOneHypercover 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (E : CategoryTheory.PreZeroHypercover X) [E.HasPullbacks] (F : (i j : E.I₀) → CategoryTheory.PreZeroHypercover (CategoryTheory.Limits.pullback (E.f i) (E.f j))) : CategoryTheory.PreOneHypercover X - CategoryTheory.PreZeroHypercover.toPreOneHypercover_Y 📋 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₀) (x✝ : PUnit.{u_2 + 1}) : E.toPreOneHypercover.Y x✝ = CategoryTheory.Limits.pullback (E.f i) (E.f j) - 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.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.PreZeroHypercover.toPreOneHypercover_p₁ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] (x✝ x✝¹ : E.I₀) (x✝² : PUnit.{u_2 + 1}) : E.toPreOneHypercover.p₁ x✝² = CategoryTheory.Limits.pullback.fst (E.f x✝) (E.f x✝¹) - CategoryTheory.PreZeroHypercover.toPreOneHypercover_p₂ 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (E : CategoryTheory.PreZeroHypercover S) [E.HasPullbacks] (x✝ x✝¹ : E.I₀) (x✝² : PUnit.{u_2 + 1}) : E.toPreOneHypercover.p₂ x✝² = CategoryTheory.Limits.pullback.snd (E.f x✝) (E.f x✝¹) - 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.PreZeroHypercover.refineOneHypercover_I₁ 📋 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).I₁ i j = (F i j).I₀ - 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.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.PreZeroHypercover.refineOneHypercover_Y 📋 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₀) (k : (F i j).I₀) : (E.refineOneHypercover F).Y k = (F i j).X k - 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.mk 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} (toPreZeroHypercover : CategoryTheory.PreZeroHypercover S) (I₁ : toPreZeroHypercover.I₀ → toPreZeroHypercover.I₀ → Type w) (Y : ⦃i₁ i₂ : toPreZeroHypercover.I₀⦄ → I₁ i₁ i₂ → C) (p₁ : ⦃i₁ i₂ : toPreZeroHypercover.I₀⦄ → (j : I₁ i₁ i₂) → Y j ⟶ toPreZeroHypercover.X i₁) (p₂ : ⦃i₁ i₂ : toPreZeroHypercover.I₀⦄ → (j : I₁ i₁ i₂) → Y j ⟶ toPreZeroHypercover.X i₂) (w : ∀ ⦃i₁ i₂ : toPreZeroHypercover.I₀⦄ (j : I₁ i₁ i₂), CategoryTheory.CategoryStruct.comp (p₁ j) (toPreZeroHypercover.f i₁) = CategoryTheory.CategoryStruct.comp (p₂ j) (toPreZeroHypercover.f i₂)) : CategoryTheory.PreOneHypercover S - CategoryTheory.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.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.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.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.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.PreZeroHypercover.refineOneHypercover_p₁ 📋 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₀) (k : (F i j).I₀) : (E.refineOneHypercover F).p₁ k = CategoryTheory.CategoryStruct.comp ((F i j).f k) (CategoryTheory.Limits.pullback.fst (E.f i) (E.f j)) - CategoryTheory.PreZeroHypercover.refineOneHypercover_p₂ 📋 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₀) (k : (F i j).I₀) : (E.refineOneHypercover F).p₂ k = CategoryTheory.CategoryStruct.comp ((F i j).f k) (CategoryTheory.Limits.pullback.snd (E.f i) (E.f j)) - 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.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.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.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.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.PreZeroHypercover.ext_of_isSeparatedFor 📋 Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.Functor Cᵒᵖ (Type u_2)} {S : C} (E : CategoryTheory.PreZeroHypercover S) (h : CategoryTheory.Presieve.IsSeparatedFor P E.presieve₀) {x y : P.obj (Opposite.op S)} (hi : ∀ (i : E.I₀), (CategoryTheory.ConcreteCategory.hom (P.map (E.f i).op)) x = (CategoryTheory.ConcreteCategory.hom (P.map (E.f i).op)) y) : x = y - 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.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.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.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.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.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.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.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.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.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.Precoverage.ZeroHypercover.morphismProperty 📋 Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : CategoryTheory.Precoverage C} {X : C} {E : K.ZeroHypercover X} (i : E.I₀) : K.morphismProperty (E.f i) - AlgebraicGeometry.Scheme.Cover.map_prop 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{X : AlgebraicGeometry.Scheme} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (i : 𝒰.I₀) : P (𝒰.f i) - AlgebraicGeometry.Scheme.AffineCover.cover_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.AffineCover P X) (j : 𝒰.I₀) : 𝒰.cover.f j = 𝒰.f j - AlgebraicGeometry.Scheme.Cover.changeProp 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} {Q : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] (𝒰 : AlgebraicGeometry.Scheme.Cover K X) (h : ∀ (j : 𝒰.I₀), Q (𝒰.f j)) : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage Q) X - AlgebraicGeometry.Scheme.coverOfIsIso_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.ContainsIdentities] [P.RespectsIso] {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : PUnit.{v + 1}) : (AlgebraicGeometry.Scheme.coverOfIsIso f).f x✝ = f - AlgebraicGeometry.Scheme.Cover.ulift_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{X : AlgebraicGeometry.Scheme} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (x : ↥X) : 𝒰.ulift.f x = 𝒰.f (𝒰.idx x) - AlgebraicGeometry.Scheme.Cover.pullbackHom 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.IsStableUnderBaseChange] [AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving P] {X W : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : W ⟶ X) (i : 𝒰.toPreZeroHypercover.1) [∀ (x : 𝒰.I₀), CategoryTheory.Limits.HasPullback f (𝒰.f x)] : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰).X i ⟶ 𝒰.X i - AlgebraicGeometry.Scheme.Cover.pullbackHom_map 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.IsStableUnderBaseChange] [AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving P] {X W : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : W ⟶ X) [∀ (x : 𝒰.I₀), CategoryTheory.Limits.HasPullback f (𝒰.f x)] (i : 𝒰.toPreZeroHypercover.1) : CategoryTheory.CategoryStruct.comp (𝒰.pullbackHom f i) (𝒰.f i) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰).f i) f - AlgebraicGeometry.Scheme.Cover.pullbackHom_map_assoc 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.IsStableUnderBaseChange] [AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving P] {X W : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : W ⟶ X) [∀ (x : 𝒰.I₀), CategoryTheory.Limits.HasPullback f (𝒰.f x)] (i : 𝒰.toPreZeroHypercover.1) {Z : AlgebraicGeometry.Scheme} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (𝒰.pullbackHom f i) (CategoryTheory.CategoryStruct.comp (𝒰.f i) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰).f i) (CategoryTheory.CategoryStruct.comp f h) - AlgebraicGeometry.Scheme.Cover.mkOfCovers_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{X : AlgebraicGeometry.Scheme} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (J : Type u_1) (obj : J → AlgebraicGeometry.Scheme) (map : (j : J) → obj j ⟶ X) (covers : ∀ (x : ↥X), ∃ j y, (map j) y = x) (map_prop : ∀ (j : J), P (map j) := by infer_instance) (j : J) : (AlgebraicGeometry.Scheme.Cover.mkOfCovers J obj map covers map_prop).f j = map j - AlgebraicGeometry.Scheme.presieve₀_mem_precoverage_iff 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{X : AlgebraicGeometry.Scheme} {P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (E : CategoryTheory.PreZeroHypercover X) : E.presieve₀ ∈ (AlgebraicGeometry.Scheme.precoverage P).coverings X ↔ (∀ (x : ↥X), ∃ i, x ∈ Set.range ⇑(E.f i)) ∧ ∀ (i : E.I₀), P (E.f i) - AlgebraicGeometry.Scheme.Cover.exists_eq 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] (𝒰 : AlgebraicGeometry.Scheme.Cover K X) (x : ↥X) : ∃ i y, (𝒰.f i) y = x - AlgebraicGeometry.Scheme.Cover.iUnion_range 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover K X) : ⋃ i, Set.range ⇑(𝒰.f i) = Set.univ - AlgebraicGeometry.Scheme.Cover.covers 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] (𝒰 : AlgebraicGeometry.Scheme.Cover K X) (x : ↥X) : x ∈ Set.range ⇑(𝒰.f (𝒰.idx x)) - AlgebraicGeometry.Scheme.Cover.copy 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (J : Type u_1) (obj : J → AlgebraicGeometry.Scheme) (map : (i : J) → obj i ⟶ X) (e₁ : J ≃ 𝒰.I₀) (e₂ : (i : J) → obj i ≅ 𝒰.X (e₁ i)) (h : ∀ (i : J), map i = CategoryTheory.CategoryStruct.comp (e₂ i).hom (𝒰.f (e₁ i))) : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X - AlgebraicGeometry.Scheme.Cover.copy_I₀ 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (J : Type u_1) (obj : J → AlgebraicGeometry.Scheme) (map : (i : J) → obj i ⟶ X) (e₁ : J ≃ 𝒰.I₀) (e₂ : (i : J) → obj i ≅ 𝒰.X (e₁ i)) (h : ∀ (i : J), map i = CategoryTheory.CategoryStruct.comp (e₂ i).hom (𝒰.f (e₁ i))) : (𝒰.copy J obj map e₁ e₂ h).I₀ = J - AlgebraicGeometry.Scheme.Cover.copy_X 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (J : Type u_1) (obj : J → AlgebraicGeometry.Scheme) (map : (i : J) → obj i ⟶ X) (e₁ : J ≃ 𝒰.I₀) (e₂ : (i : J) → obj i ≅ 𝒰.X (e₁ i)) (h : ∀ (i : J), map i = CategoryTheory.CategoryStruct.comp (e₂ i).hom (𝒰.f (e₁ i))) (a✝ : J) : (𝒰.copy J obj map e₁ e₂ h).X a✝ = obj a✝ - AlgebraicGeometry.Scheme.Cover.copy_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] {X : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (J : Type u_1) (obj : J → AlgebraicGeometry.Scheme) (map : (i : J) → obj i ⟶ X) (e₁ : J ≃ 𝒰.I₀) (e₂ : (i : J) → obj i ≅ 𝒰.X (e₁ i)) (h : ∀ (i : J), map i = CategoryTheory.CategoryStruct.comp (e₂ i).hom (𝒰.f (e₁ i))) (i : J) : (𝒰.copy J obj map e₁ e₂ h).f i = map i - AlgebraicGeometry.Scheme.Cover.pushforwardIso_f 📋 Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} [P.RespectsIso] [P.ContainsIdentities] [P.IsStableUnderComposition] {X Y : AlgebraicGeometry.Scheme} (𝒰 : AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X) (f : X ⟶ Y) [CategoryTheory.IsIso f] (x✝ : 𝒰.I₀) : (𝒰.pushforwardIso f).f x✝ = CategoryTheory.CategoryStruct.comp (𝒰.f x✝) f - AlgebraicGeometry.Scheme.instIsOpenImmersionF 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (i : 𝒰.I₀) : AlgebraicGeometry.IsOpenImmersion (𝒰.f i) - AlgebraicGeometry.Scheme.AffineOpenCover.openCover_f 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.AffineOpenCover) (j : 𝒰.I₀) : 𝒰.openCover.f j = 𝒰.f j - AlgebraicGeometry.Scheme.affineOpenCover_f 📋 Mathlib.AlgebraicGeometry.Cover.Open
(X : AlgebraicGeometry.Scheme) (i : X.affineCover.I₀) : X.affineOpenCover.f i = X.affineCover.f i - AlgebraicGeometry.Scheme.OpenCover.isOpenCover_opensRange 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) : TopologicalSpace.IsOpenCover fun i => AlgebraicGeometry.Scheme.Hom.opensRange (𝒰.f i) - AlgebraicGeometry.Scheme.OpenCover.iSup_opensRange 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) : ⨆ i, AlgebraicGeometry.Scheme.Hom.opensRange (𝒰.f i) = ⊤ - AlgebraicGeometry.Scheme.affineBasisCover_is_basis 📋 Mathlib.AlgebraicGeometry.Cover.Open
(X : AlgebraicGeometry.Scheme) : TopologicalSpace.IsTopologicalBasis {x | ∃ a, x = Set.range ⇑(X.affineBasisCover.f a)} - AlgebraicGeometry.Scheme.affineOpenCover_idx 📋 Mathlib.AlgebraicGeometry.Cover.Open
(X : AlgebraicGeometry.Scheme) (x : ↥X) : X.affineOpenCover.idx x = ⋯.choose - AlgebraicGeometry.Scheme.OpenCover.finiteSubcover_X 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) [H : CompactSpace ↥X] (x : ↥⋯.choose) : 𝒰.finiteSubcover.X x = 𝒰.X (AlgebraicGeometry.Scheme.Cover.idx 𝒰 ↑x) - AlgebraicGeometry.Scheme.OpenCover.finiteSubcover_f 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) [H : CompactSpace ↥X] (x : ↥⋯.choose) : 𝒰.finiteSubcover.f x = 𝒰.f (AlgebraicGeometry.Scheme.Cover.idx 𝒰 ↑x) - AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (𝒰 : Y.OpenCover) (i : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).I₀) : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).X i ≅ (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰 f i.fst) (𝒰.X i.fst).affineCover).X i.snd - AlgebraicGeometry.Scheme.OpenCover.ext_elem 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} {U : X.Opens} (f g : ↑(X.presheaf.obj (Opposite.op U))) (𝒰 : X.OpenCover) (h : ∀ (i : 𝒰.I₀), (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.app (𝒰.f i) U)) f = (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.app (𝒰.f i) U)) g) : f = g - AlgebraicGeometry.Scheme.zero_of_zero_cover 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} {U : X.Opens} (s : ↑(X.presheaf.obj (Opposite.op U))) (𝒰 : X.OpenCover) (h : ∀ (i : 𝒰.I₀), (CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.app (𝒰.f i) U)) s = 0) : s = 0 - AlgebraicGeometry.Scheme.isNilpotent_of_isNilpotent_cover 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X : AlgebraicGeometry.Scheme} {U : X.Opens} (s : ↑(X.presheaf.obj (Opposite.op U))) (𝒰 : X.OpenCover) [Finite 𝒰.I₀] (h : ∀ (i : 𝒰.I₀), IsNilpotent ((CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.app (𝒰.f i) U)) s)) : IsNilpotent s - AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso_inv_pullbackHom 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (𝒰 : Y.OpenCover) (i : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso f 𝒰 i).inv (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰.affineRefinement.openCover f i) = AlgebraicGeometry.Scheme.Cover.pullbackHom (𝒰.X i.fst).affineCover (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰 f i.fst) i.snd - AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso_inv_pullbackHom_assoc 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (𝒰 : Y.OpenCover) (i : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).I₀) {Z : AlgebraicGeometry.Scheme} (h : 𝒰.affineRefinement.openCover.X i ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso f 𝒰 i).inv (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰.affineRefinement.openCover f i) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Cover.pullbackHom (𝒰.X i.fst).affineCover (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰 f i.fst) i.snd) h - AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso_inv_map_assoc 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (𝒰 : Y.OpenCover) (i : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).I₀) {Z : AlgebraicGeometry.Scheme} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso f 𝒰 i).inv (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).f i) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰 f i.fst) (𝒰.X i.fst).affineCover).f i.snd) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰).f i.fst) h) - AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso_inv_map 📋 Mathlib.AlgebraicGeometry.Cover.Open
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (𝒰 : Y.OpenCover) (i : (CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).I₀) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.OpenCover.pullbackCoverAffineRefinementObjIso f 𝒰 i).inv ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰.affineRefinement.openCover).f i) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ (AlgebraicGeometry.Scheme.Cover.pullbackHom 𝒰 f i.fst) (𝒰.X i.fst).affineCover).f i.snd) ((CategoryTheory.Precoverage.ZeroHypercover.pullback₁ f 𝒰).f i.fst) - AlgebraicGeometry.Scheme.affineBasisCover_map_range 📋 Mathlib.AlgebraicGeometry.Cover.Open
(X : AlgebraicGeometry.Scheme) (x : ↥X) (r : ↑⋯.choose) : Set.range ⇑(X.affineBasisCover.f ⟨x, r⟩) = ⇑(X.affineCover.f x) '' (PrimeSpectrum.basicOpen r).carrier - AlgebraicGeometry.Scheme.openCoverOfIsOpenCover_f 📋 Mathlib.AlgebraicGeometry.Restrict
{s : Type u_1} (X : AlgebraicGeometry.Scheme) (U : s → X.Opens) (hU : TopologicalSpace.IsOpenCover U) (i : s) : (X.openCoverOfIsOpenCover U hU).f i = (U i).ι - AlgebraicGeometry.Scheme.OpenCover.restrict_X 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (U : X.Opens) (x✝ : 𝒰.I₀) : (𝒰.restrict U).X x✝ = ↑((TopologicalSpace.Opens.map (𝒰.f x✝).base).obj U) - AlgebraicGeometry.Scheme.OpenCover.restrict_f 📋 Mathlib.AlgebraicGeometry.Restrict
{X : AlgebraicGeometry.Scheme} (𝒰 : X.OpenCover) (U : X.Opens) (x✝ : 𝒰.I₀) : (𝒰.restrict U).f x✝ = 𝒰.f x✝ ∣_ U - CategoryTheory.MorphismProperty.IsLocalAtSource.of_zeroHypercover 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtSource K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover X) (h : ∀ (i : 𝒰.I₀), P (CategoryTheory.CategoryStruct.comp (𝒰.f i) f)) : P f - CategoryTheory.MorphismProperty.iff_of_zeroHypercover_source 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtSource K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover X) : P f ↔ ∀ (i : 𝒰.I₀), P (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) - CategoryTheory.MorphismProperty.IsLocalAtSource.iff_of_zeroHypercover 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtSource K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover X) : P f ↔ ∀ (i : 𝒰.I₀), P (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) - CategoryTheory.MorphismProperty.IsLocalAtSource.mk_of_iff_of_zeroHypercover 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.RespectsIso] (H : ∀ {X Y : C} (f : X ⟶ Y) (𝒰 : K.ZeroHypercover X), P f ↔ ∀ (i : 𝒰.I₀), P (CategoryTheory.CategoryStruct.comp (𝒰.f i) f)) : P.IsLocalAtSource K - CategoryTheory.MorphismProperty.of_zeroHypercover_source 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtSource K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover X) [𝒰.Small] (h : ∀ (i : 𝒰.I₀), P (CategoryTheory.CategoryStruct.comp (𝒰.f i) f)) : P f - CategoryTheory.MorphismProperty.IsLocalAtTarget.of_isPullback 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtTarget K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover Y) {X' : C} (i : 𝒰.I₀) {fst : X' ⟶ X} {snd : X' ⟶ 𝒰.X i} (h : CategoryTheory.IsPullback fst snd f (𝒰.f i)) (hf : P f) : P snd - CategoryTheory.MorphismProperty.IsLocalAtTarget.of_zeroHypercover 📋 Mathlib.CategoryTheory.MorphismProperty.Local
{C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.MorphismProperty C} {K : CategoryTheory.Precoverage C} [P.IsLocalAtTarget K] {X Y : C} {f : X ⟶ Y} (𝒰 : K.ZeroHypercover Y) [K.HasPullbacks] (h : ∀ (i : 𝒰.I₀), P (CategoryTheory.Limits.pullback.snd f (𝒰.f i))) : P f
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