Loogle!
Result
Found 319 declarations mentioning CategoryTheory.Precoverage. Of these, only the first 200 are shown.
- CategoryTheory.Precoverage π Mathlib.CategoryTheory.Sites.Precoverage
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] : Type (max u_1 v_1) - CategoryTheory.Precoverage.HasIsos π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.HasPullbacks π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.IsStableUnderBaseChange π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.IsStableUnderComposition π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.IsStableUnderSup π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.instBot π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : Bot (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instCompleteLattice π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : CompleteLattice (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instInfSet π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : InfSet (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instMax π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : Max (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instMin π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : Min (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instPartialOrder π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : PartialOrder (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instSupSet π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : SupSet (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.instTop π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : Top (CategoryTheory.Precoverage C) - CategoryTheory.Precoverage.coverings π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (self : CategoryTheory.Precoverage C) (X : C) : Set (CategoryTheory.Presieve X) - CategoryTheory.Precoverage.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (coverings : (X : C) β Set (CategoryTheory.Presieve X)) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.instHasPullbacksOfHasPullbacks π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) [CategoryTheory.Limits.HasPullbacks C] : J.HasPullbacks - CategoryTheory.Precoverage.PullbacksPreservedBy π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (J : CategoryTheory.Precoverage C) (F : CategoryTheory.Functor C D) : Prop - CategoryTheory.Precoverage.instCoeFunForallSetPresieve π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] : CoeFun (CategoryTheory.Precoverage C) fun x => (X : C) β Set (CategoryTheory.Presieve X) - CategoryTheory.Precoverage.comap π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (F : CategoryTheory.Functor C D) (J : CategoryTheory.Precoverage D) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.comap_id π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) : CategoryTheory.Precoverage.comap (CategoryTheory.Functor.id C) K = K - CategoryTheory.Precoverage.instHasIsosComap π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J : CategoryTheory.Precoverage D} [J.HasIsos] : (CategoryTheory.Precoverage.comap F J).HasIsos - CategoryTheory.Precoverage.instIsStableUnderCompositionComap π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J : CategoryTheory.Precoverage D} [J.IsStableUnderComposition] : (CategoryTheory.Precoverage.comap F J).IsStableUnderComposition - CategoryTheory.Precoverage.instHasIsosMin π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J K : CategoryTheory.Precoverage C) [J.HasIsos] [K.HasIsos] : (J β K).HasIsos - CategoryTheory.Precoverage.instIsStableUnderBaseChangeMin π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J K : CategoryTheory.Precoverage C) [J.IsStableUnderBaseChange] [K.IsStableUnderBaseChange] : (J β K).IsStableUnderBaseChange - CategoryTheory.Precoverage.instIsStableUnderCompositionMin π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J K : CategoryTheory.Precoverage C) [J.IsStableUnderComposition] [K.IsStableUnderComposition] : (J β K).IsStableUnderComposition - CategoryTheory.Precoverage.instIsStableUnderSupMin π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J K : CategoryTheory.Precoverage C) [J.IsStableUnderSup] [K.IsStableUnderSup] : (J β K).IsStableUnderSup - CategoryTheory.Precoverage.ext π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {instβ : CategoryTheory.Category.{v_1, u_1} C} {x y : CategoryTheory.Precoverage C} (coverings : x.coverings = y.coverings) : x = y - CategoryTheory.Precoverage.instPullbacksPreservedByOfPreservesLimitsOfShapeWalkingCospan π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (J : CategoryTheory.Precoverage C) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] : J.PullbacksPreservedBy F - CategoryTheory.Precoverage.ext_iff π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {instβ : CategoryTheory.Category.{v_1, u_1} C} {x y : CategoryTheory.Precoverage C} : x = y β x.coverings = y.coverings - CategoryTheory.Precoverage.instHasPullbacksComapOfCreatesLimitsOfShapeWalkingCospan π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J : CategoryTheory.Precoverage D} [CategoryTheory.CreatesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] [J.HasPullbacks] : (CategoryTheory.Precoverage.comap F J).HasPullbacks - CategoryTheory.Precoverage.instIsStableUnderBaseChangeComapOfPreservesLimitsOfShapeWalkingCospan π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J : CategoryTheory.Precoverage D} [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] [J.IsStableUnderBaseChange] : (CategoryTheory.Precoverage.comap F J).IsStableUnderBaseChange - CategoryTheory.Precoverage.comap_monotone π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} : Monotone (CategoryTheory.Precoverage.comap F) - CategoryTheory.Precoverage.hasPairwisePullbacks_of_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) [J.HasPullbacks] {X : C} {R : CategoryTheory.Presieve X} (hR : R β J.coverings X) : R.HasPairwisePullbacks - CategoryTheory.Precoverage.hasPullbacks_of_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.HasPullbacks] {X Y : C} {R : CategoryTheory.Presieve Y} (f : X βΆ Y) (hR : R β J.coverings Y) : R.HasPullbacks f - CategoryTheory.Precoverage.mem_coverings_of_isIso π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.HasIsos] {S T : C} (f : S βΆ T) [CategoryTheory.IsIso f] : CategoryTheory.Presieve.singleton f β J.coverings T - CategoryTheory.Precoverage.HasIsos.mem_coverings_of_isIso π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.HasIsos] {S T : C} (f : S βΆ T) [CategoryTheory.IsIso f] : CategoryTheory.Presieve.singleton f β J.coverings T - CategoryTheory.Precoverage.HasIsos.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (mem_coverings_of_isIso : β {S T : C} (f : S βΆ T) [CategoryTheory.IsIso f], CategoryTheory.Presieve.singleton f β J.coverings T) : J.HasIsos - CategoryTheory.Precoverage.HasPullbacks.hasPullbacks_of_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.HasPullbacks] {X Y : C} {R : CategoryTheory.Presieve Y} (f : X βΆ Y) (hR : R β J.coverings Y) : R.HasPullbacks f - CategoryTheory.Precoverage.HasPullbacks.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (hasPullbacks_of_mem : β {X Y : C} {R : CategoryTheory.Presieve Y} (f : X βΆ Y), R β J.coverings Y β R.HasPullbacks f) : J.HasPullbacks - CategoryTheory.Precoverage.comap_comp π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {E : Type u_2} [CategoryTheory.Category.{v_2, u_2} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) (J : CategoryTheory.Precoverage E) : CategoryTheory.Precoverage.comap (F.comp G) J = CategoryTheory.Precoverage.comap F (CategoryTheory.Precoverage.comap G J) - CategoryTheory.Precoverage.preservesPairwisePullbacks_of_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {D : Type u_2} {instβ : CategoryTheory.Category.{v_1, u_1} C} {instβΒΉ : CategoryTheory.Category.{v_2, u_2} D} {J : CategoryTheory.Precoverage C} {F : CategoryTheory.Functor C D} [self : J.PullbacksPreservedBy F] β¦X : Cβ¦ β¦R : CategoryTheory.Presieve Xβ¦ : R β J.coverings X β F.PreservesPairwisePullbacks R - CategoryTheory.Precoverage.PullbacksPreservedBy.preservesPairwisePullbacks_of_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {D : Type u_2} {instβ : CategoryTheory.Category.{v_1, u_1} C} {instβΒΉ : CategoryTheory.Category.{v_2, u_2} D} {J : CategoryTheory.Precoverage C} {F : CategoryTheory.Functor C D} [self : J.PullbacksPreservedBy F] β¦X : Cβ¦ β¦R : CategoryTheory.Presieve Xβ¦ : R β J.coverings X β F.PreservesPairwisePullbacks R - CategoryTheory.Precoverage.comap_inf π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J K : CategoryTheory.Precoverage D} : CategoryTheory.Precoverage.comap F (J β K) = CategoryTheory.Precoverage.comap F J β CategoryTheory.Precoverage.comap F K - CategoryTheory.Precoverage.PullbacksPreservedBy.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Precoverage C} {F : CategoryTheory.Functor C D} (preservesPairwisePullbacks_of_mem : β β¦X : Cβ¦ β¦R : CategoryTheory.Presieve Xβ¦, R β J.coverings X β F.PreservesPairwisePullbacks R := by infer_instance) : J.PullbacksPreservedBy F - CategoryTheory.Precoverage.pullbackArrows_mem π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {X Y : C} (f : X βΆ Y) {R : CategoryTheory.Presieve Y} (hR : R β J.coverings Y) [R.HasPullbacks f] : CategoryTheory.Presieve.pullbackArrows f R β J.coverings X - CategoryTheory.Precoverage.mem_comap_iff π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {J : CategoryTheory.Precoverage D} {X : C} {R : CategoryTheory.Presieve X} : R β (CategoryTheory.Precoverage.comap F J).coverings X β CategoryTheory.Presieve.map F R β J.coverings (F.obj X) - CategoryTheory.Precoverage.sup_mem_coverings π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.IsStableUnderSup] {X : C} {R S : CategoryTheory.Presieve X} (hR : R β J.coverings X) (hS : S β J.coverings X) : R β S β J.coverings X - CategoryTheory.Precoverage.IsStableUnderSup.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (sup_mem_coverings : β {X : C} {R S : CategoryTheory.Presieve X}, R β J.coverings X β S β J.coverings X β R β S β J.coverings X) : J.IsStableUnderSup - CategoryTheory.Precoverage.IsStableUnderSup.sup_mem_coverings π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.IsStableUnderSup] {X : C} {R S : CategoryTheory.Presieve X} (hR : R β J.coverings X) (hS : S β J.coverings X) : R β S β J.coverings X - CategoryTheory.Precoverage.mem_coverings_of_isPullback π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] {ΞΉ : Type w} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) (hR : CategoryTheory.Presieve.ofArrows X f β J.coverings S) {Y : C} (g : Y βΆ S) {P : ΞΉ β C} (pβ : (i : ΞΉ) β P i βΆ Y) (pβ : (i : ΞΉ) β P i βΆ X i) (h : β (i : ΞΉ), CategoryTheory.IsPullback (pβ i) (pβ i) g (f i)) : CategoryTheory.Presieve.ofArrows P pβ β J.coverings Y - CategoryTheory.Precoverage.IsStableUnderBaseChange.mem_coverings_of_isPullback π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.IsStableUnderBaseChange] {ΞΉ : Type (max u v)} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) (hR : CategoryTheory.Presieve.ofArrows X f β J.coverings S) {Y : C} (g : Y βΆ S) {P : ΞΉ β C} (pβ : (i : ΞΉ) β P i βΆ Y) (pβ : (i : ΞΉ) β P i βΆ X i) (h : β (i : ΞΉ), CategoryTheory.IsPullback (pβ i) (pβ i) g (f i)) : CategoryTheory.Presieve.ofArrows P pβ β J.coverings Y - CategoryTheory.Precoverage.IsStableUnderBaseChange.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (mem_coverings_of_isPullback : β {ΞΉ : Type (max u v)} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S), CategoryTheory.Presieve.ofArrows X f β J.coverings S β β {Y : C} (g : Y βΆ S) {P : ΞΉ β C} (pβ : (i : ΞΉ) β P i βΆ Y) (pβ : (i : ΞΉ) β P i βΆ X i), (β (i : ΞΉ), CategoryTheory.IsPullback (pβ i) (pβ i) g (f i)) β CategoryTheory.Presieve.ofArrows P pβ β J.coverings Y) : J.IsStableUnderBaseChange - CategoryTheory.Precoverage.comp_mem_coverings π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderComposition] {ΞΉ : Type w} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) (hf : CategoryTheory.Presieve.ofArrows X f β J.coverings S) {Ο : ΞΉ β Type w'} {Y : (i : ΞΉ) β Ο i β C} (g : (i : ΞΉ) β (j : Ο i) β Y i j βΆ X i) (hg : β (i : ΞΉ), CategoryTheory.Presieve.ofArrows (Y i) (g i) β J.coverings (X i)) : (CategoryTheory.Presieve.ofArrows (fun p => Y p.fst p.snd) fun x => CategoryTheory.CategoryStruct.comp (g x.fst x.snd) (f x.fst)) β J.coverings S - CategoryTheory.Precoverage.IsStableUnderComposition.comp_mem_coverings π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.IsStableUnderComposition] {ΞΉ : Type (max u v)} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) (hf : CategoryTheory.Presieve.ofArrows X f β J.coverings S) {Ο : ΞΉ β Type (max u v)} {Y : (i : ΞΉ) β Ο i β C} (g : (i : ΞΉ) β (j : Ο i) β Y i j βΆ X i) (hg : β (i : ΞΉ), CategoryTheory.Presieve.ofArrows (Y i) (g i) β J.coverings (X i)) : (CategoryTheory.Presieve.ofArrows (fun p => Y p.fst p.snd) fun x => CategoryTheory.CategoryStruct.comp (g x.fst x.snd) (f x.fst)) β J.coverings S - CategoryTheory.Precoverage.IsStableUnderComposition.mk π Mathlib.CategoryTheory.Sites.Precoverage
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (comp_mem_coverings : β {ΞΉ : Type (max u v)} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S), CategoryTheory.Presieve.ofArrows X f β J.coverings S β β {Ο : ΞΉ β Type (max u v)} {Y : (i : ΞΉ) β Ο i β C} (g : (i : ΞΉ) β (j : Ο i) β Y i j βΆ X i), (β (i : ΞΉ), CategoryTheory.Presieve.ofArrows (Y i) (g i) β J.coverings (X i)) β (CategoryTheory.Presieve.ofArrows (fun p => Y p.fst p.snd) fun x => CategoryTheory.CategoryStruct.comp (g x.fst x.snd) (f x.fst)) β J.coverings S) : J.IsStableUnderComposition - CategoryTheory.Pretopology.toPrecoverage π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (self : CategoryTheory.Pretopology C) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.toPretopology π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (J : CategoryTheory.Precoverage C) [J.HasIsos] [J.IsStableUnderBaseChange] [J.IsStableUnderComposition] : CategoryTheory.Pretopology C - CategoryTheory.Precoverage.toPretopology_toPrecoverage π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (J : CategoryTheory.Precoverage C) [J.HasIsos] [J.IsStableUnderBaseChange] [J.IsStableUnderComposition] : (CategoryTheory.Precoverage.toPretopology C J).toPrecoverage = J - CategoryTheory.Pretopology.mk π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (toPrecoverage : CategoryTheory.Precoverage C) (has_isos : β β¦X Y : Cβ¦ (f : Y βΆ X) [CategoryTheory.IsIso f], CategoryTheory.Presieve.singleton f β toPrecoverage.coverings X) (pullbacks : β β¦X Y : Cβ¦ (f : Y βΆ X), β S β toPrecoverage.coverings X, CategoryTheory.Presieve.pullbackArrows f S β toPrecoverage.coverings Y) (transitive : β β¦X : Cβ¦ (S : CategoryTheory.Presieve X) (Ti : β¦Y : Cβ¦ β (f : Y βΆ X) β S f β CategoryTheory.Presieve Y), S β toPrecoverage.coverings X β (β β¦Y : Cβ¦ (f : Y βΆ X) (H : S f), Ti f H β toPrecoverage.coverings Y) β S.bind Ti β toPrecoverage.coverings X) : CategoryTheory.Pretopology C - CategoryTheory.Precoverage.RespectsIso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.Small π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) : Prop - CategoryTheory.Precoverage.ZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) (S : C) : Type (max (max u v) (w + 1)) - CategoryTheory.Precoverage.instSmall π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) : K.Small - CategoryTheory.Precoverage.ZeroHypercover.Small π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) : Prop - CategoryTheory.Precoverage.ZeroHypercover.instCategory π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} : CategoryTheory.Category.{max v w, max (max (w + 1) u) v} (J.ZeroHypercover S) - CategoryTheory.Precoverage.instRespectsIsoOfIsStableUnderBaseChange π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] : J.RespectsIso - CategoryTheory.Precoverage.ZeroHypercover.toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (self : J.ZeroHypercover S) : CategoryTheory.PreZeroHypercover S - CategoryTheory.Precoverage.ZeroHypercover.Hom π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) {S : C} (E : J.ZeroHypercover S) (F : J.ZeroHypercover S) : Type (max (max v w) w') - CategoryTheory.Precoverage.ZeroHypercover.instSmall π 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 - CategoryTheory.Precoverage.ZeroHypercover.Small.Index π 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] : Type w' - CategoryTheory.Precoverage.instSmallOfSmall π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.Precoverage C) [J.Small] {S : C} (E : J.ZeroHypercover S) : E.Small - CategoryTheory.Precoverage.Small.mk π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (zeroHypercoverSmall : β {S : C} (E : J.ZeroHypercover S), E.Small) : J.Small - CategoryTheory.Precoverage.Small.zeroHypercoverSmall π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.Small] {S : C} (E : J.ZeroHypercover S) : E.Small - CategoryTheory.Precoverage.ZeroHypercover.restrictIndexOfSmall π 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] : J.ZeroHypercover S - CategoryTheory.Precoverage.ZeroHypercover.sum π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} [J.IsStableUnderSup] (E : J.ZeroHypercover S) (F : J.ZeroHypercover S) : J.ZeroHypercover S - CategoryTheory.Precoverage.instSmallComap π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} (J : CategoryTheory.Precoverage D) [J.Small] : (CategoryTheory.Precoverage.comap F J).Small - CategoryTheory.Precoverage.ZeroHypercover.instSmallOfSmallIβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [Small.{w', w} E.Iβ] : E.Small - CategoryTheory.Precoverage.ZeroHypercover.reindex π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} (E : J.ZeroHypercover T) {ΞΉ : Type w'} (e : ΞΉ β E.Iβ) : J.ZeroHypercover T - CategoryTheory.Precoverage.ZeroHypercover.Small.restrictFun π 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] : CategoryTheory.Precoverage.ZeroHypercover.Small.Index E β E.Iβ - CategoryTheory.Precoverage.ZeroHypercover.weaken π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {K L : CategoryTheory.Precoverage C} {X : C} (E : K.ZeroHypercover X) (h : K β€ L) : L.ZeroHypercover X - CategoryTheory.Precoverage.ZeroHypercover.mk π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (toPreZeroHypercover : CategoryTheory.PreZeroHypercover S) (memβ : toPreZeroHypercover.presieveβ β J.coverings S) : J.ZeroHypercover S - CategoryTheory.Precoverage.ZeroHypercover.instHasPullbacksPresieveβOfHasPullbacks π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) [K.HasPullbacks] {X Y : C} (E : K.ZeroHypercover X) (f : Y βΆ X) : E.presieveβ.HasPullbacks f - CategoryTheory.Precoverage.ZeroHypercover.memβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (self : J.ZeroHypercover S) : self.presieveβ β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.bind π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} [J.IsStableUnderComposition] (E : J.ZeroHypercover T) (F : (i : E.Iβ) β J.ZeroHypercover (E.X i)) : J.ZeroHypercover T - CategoryTheory.Precoverage.ZeroHypercover.singleton π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} (f : S βΆ T) (hf : CategoryTheory.Presieve.singleton f β J.coverings T) : J.ZeroHypercover T - CategoryTheory.Precoverage.ZeroHypercover.isoMk π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {E F : J.ZeroHypercover S} (e : E.toPreZeroHypercover β F.toPreZeroHypercover) : E β F - CategoryTheory.Precoverage.ZeroHypercover.reindex_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} (E : J.ZeroHypercover T) {ΞΉ : Type w'} (e : ΞΉ β E.Iβ) : (E.reindex e).toPreZeroHypercover = E.reindex e - CategoryTheory.Precoverage.ZeroHypercover.sum_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} [J.IsStableUnderSup] (E : J.ZeroHypercover S) (F : J.ZeroHypercover S) : (E.sum F).toPreZeroHypercover = E.sum F.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.weaken_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {K L : CategoryTheory.Precoverage C} {X : C} (E : K.ZeroHypercover X) (h : K β€ L) : (E.weaken h).toPreZeroHypercover = E.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.map π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {K : CategoryTheory.Precoverage D} (F : CategoryTheory.Functor C D) (E : J.ZeroHypercover S) (h : J β€ CategoryTheory.Precoverage.comap F K) : K.ZeroHypercover (F.obj S) - CategoryTheory.Precoverage.ZeroHypercover.restrictIndexOfSmall_toPreZeroHypercover π 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] : E.restrictIndexOfSmall.toPreZeroHypercover = E.restrictIndex (CategoryTheory.Precoverage.ZeroHypercover.Small.restrictFun E) - CategoryTheory.Precoverage.ZeroHypercover.presieveβ_mem_of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.RespectsIso] {S : C} {E : J.ZeroHypercover S} {F : CategoryTheory.PreZeroHypercover S} (e : E.toPreZeroHypercover β F) : F.presieveβ β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.pushforward π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderComposition] [J.HasIsos] {X Y : C} (f : X βΆ Y) (hf : CategoryTheory.Presieve.singleton f β J.coverings Y) (E : J.ZeroHypercover X) : J.ZeroHypercover Y - CategoryTheory.Precoverage.le_of_zeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J K : CategoryTheory.Precoverage C} (h : β β¦X : Cβ¦ β¦E : J.ZeroHypercover Xβ¦, E.presieveβ β K.coverings X) : J β€ K - CategoryTheory.Precoverage.ZeroHypercover.Small.memβ π 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] : (E.restrictIndex (CategoryTheory.Precoverage.ZeroHypercover.Small.restrictFun E)).presieveβ β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.singleton_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S T : C} (f : S βΆ T) (hf : CategoryTheory.Presieve.singleton f β J.coverings T) : (CategoryTheory.Precoverage.ZeroHypercover.singleton f hf).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.singleton f - CategoryTheory.Precoverage.ZeroHypercover.id_sβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (xβ : J.ZeroHypercover S) (a : xβ.Iβ) : (CategoryTheory.CategoryStruct.id xβ).sβ a = a - 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.presieveβ_mem_of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.RespectsIso] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E β F) (hE : E.presieveβ β J.coverings S) : F.presieveβ β J.coverings S - CategoryTheory.Precoverage.RespectsIso.mk π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} (of_iso : β {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E β F), E.presieveβ β J.coverings S β F.presieveβ β J.coverings S) : J.RespectsIso - CategoryTheory.Precoverage.RespectsIso.of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} [self : J.RespectsIso] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E β F) : E.presieveβ β J.coverings S β F.presieveβ β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.Small.exists_restrictIndex_mem π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [self : E.Small] : β ΞΉ f, (E.restrictIndex f).presieveβ β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.Small.mk π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {E : J.ZeroHypercover S} (exists_restrictIndex_mem : β ΞΉ f, (E.restrictIndex f).presieveβ β J.coverings S) : E.Small - CategoryTheory.PreZeroHypercover.presieveβ_mem_iff_of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.RespectsIso] {S : C} {E F : CategoryTheory.PreZeroHypercover S} (e : E β F) : E.presieveβ β J.coverings S β F.presieveβ β J.coverings S - CategoryTheory.PreZeroHypercover.mem_of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : CategoryTheory.Precoverage C} [K.IsStableUnderComposition] [K.HasIsos] {X : C} {E F : CategoryTheory.PreZeroHypercover X} (e : E β F) (hE : E.presieveβ β K.coverings X) : F.presieveβ β K.coverings X - 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.mem_iff_of_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : CategoryTheory.Precoverage C} [K.IsStableUnderComposition] [K.HasIsos] {X : C} {E F : CategoryTheory.PreZeroHypercover X} (e : E β F) : E.presieveβ β K.coverings X β F.presieveβ β K.coverings X - 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.Precoverage.ZeroHypercover.pushforward_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderComposition] [J.HasIsos] {X Y : C} (f : X βΆ Y) (hf : CategoryTheory.Presieve.singleton f β J.coverings Y) (E : J.ZeroHypercover X) : (CategoryTheory.Precoverage.ZeroHypercover.pushforward f hf E).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.pushforward f E.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.add π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) {T : C} (f : T βΆ S) (hf : E.presieveβ β CategoryTheory.Presieve.singleton f β J.coverings S) : J.ZeroHypercover S - CategoryTheory.Precoverage.ZeroHypercover.map_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {K : CategoryTheory.Precoverage D} (F : CategoryTheory.Functor C D) (E : J.ZeroHypercover S) (h : J β€ CategoryTheory.Precoverage.comap F K) : (CategoryTheory.Precoverage.ZeroHypercover.map F E h).toPreZeroHypercover = CategoryTheory.PreZeroHypercover.map F E.toPreZeroHypercover - CategoryTheory.Precoverage.ZeroHypercover.bind_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {T : C} [J.IsStableUnderComposition] (E : J.ZeroHypercover T) (F : (i : E.Iβ) β J.ZeroHypercover (E.X i)) : (E.bind F).toPreZeroHypercover = E.bind fun i => (F i).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 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.Precoverage.ZeroHypercover.id_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (xβ : J.ZeroHypercover S) (xβΒΉ : xβ.Iβ) : (CategoryTheory.CategoryStruct.id xβ).hβ xβΒΉ = CategoryTheory.CategoryStruct.id (xβ.X xβΒΉ) - 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.Precoverage.ZeroHypercover.isoMk_hom π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {E F : J.ZeroHypercover S} (e : E.toPreZeroHypercover β F.toPreZeroHypercover) : (CategoryTheory.Precoverage.ZeroHypercover.isoMk e).hom = e.hom - CategoryTheory.Precoverage.ZeroHypercover.isoMk_inv π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {E F : J.ZeroHypercover S} (e : E.toPreZeroHypercover β F.toPreZeroHypercover) : (CategoryTheory.Precoverage.ZeroHypercover.isoMk e).inv = e.inv - CategoryTheory.Precoverage.Small.inf π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J K : CategoryTheory.Precoverage C} [J.Small] (of_le : β β¦X : Cβ¦ β¦R S : CategoryTheory.Presieve Xβ¦, R β€ S β S β K.coverings X β R β K.coverings X) : (J β K).Small - CategoryTheory.Precoverage.ZeroHypercover.add_toPreZeroHypercover π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) {T : C} (f : T βΆ S) (hf : E.presieveβ β CategoryTheory.Presieve.singleton f β J.coverings S) : (E.add f hf).toPreZeroHypercover = E.add f - 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.Precoverage.RespectsIso.of_forall_exists_iso π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} [J.RespectsIso] {S : C} {R T : CategoryTheory.Presieve S} (hRT : β β¦Z : Cβ¦ (g : Z βΆ S), R g β β Y e, T (CategoryTheory.CategoryStruct.comp e.hom g)) (hTR : β β¦Z : Cβ¦ (g : Z βΆ S), T g β β Y e, R (CategoryTheory.CategoryStruct.comp e.hom g)) (hR : R β J.coverings S) : T β J.coverings S - CategoryTheory.Precoverage.ZeroHypercover.comp_sβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {Xβ Yβ Zβ : J.ZeroHypercover S} (f : Xβ.Hom Yβ.toPreZeroHypercover) (g : Yβ.Hom Zβ.toPreZeroHypercover) (aβ : Xβ.Iβ) : (CategoryTheory.CategoryStruct.comp f g).sβ aβ = g.sβ (f.sβ 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.Precoverage.ZeroHypercover.comp_hβ π Mathlib.CategoryTheory.Sites.Hypercover.Zero
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} {Xβ Yβ Zβ : J.ZeroHypercover S} (f : Xβ.Hom Yβ.toPreZeroHypercover) (g : Yβ.Hom Zβ.toPreZeroHypercover) (i : Xβ.Iβ) : (CategoryTheory.CategoryStruct.comp f g).hβ i = CategoryTheory.CategoryStruct.comp (f.hβ i) (g.hβ (f.sβ i)) - CategoryTheory.GrothendieckTopology.toPrecoverage π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] (J : CategoryTheory.GrothendieckTopology C) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.toGrothendieck π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] (J : CategoryTheory.Precoverage C) : CategoryTheory.GrothendieckTopology C - CategoryTheory.Precoverage.Saturate π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] (J : CategoryTheory.Precoverage C) (X : C) : CategoryTheory.Sieve X β Prop - CategoryTheory.GrothendieckTopology.toPrecoverage_monotone π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] : Monotone CategoryTheory.GrothendieckTopology.toPrecoverage - CategoryTheory.Precoverage.toGrothendieck_monotone π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] : Monotone CategoryTheory.Precoverage.toGrothendieck - CategoryTheory.Precoverage.le_toPrecoverage_toGrothendieck π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_3} [CategoryTheory.Category.{u_2, u_3} C] (J : CategoryTheory.Precoverage C) : J β€ J.toGrothendieck.toPrecoverage - CategoryTheory.Precoverage.galoisConnection_toGrothendieck_toPrecoverage π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
(C : Type u_2) [CategoryTheory.Category.{u_3, u_2} C] : GaloisConnection CategoryTheory.Precoverage.toGrothendieck CategoryTheory.GrothendieckTopology.toPrecoverage - CategoryTheory.Precoverage.Saturate.pullback π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {J : CategoryTheory.Precoverage C} (X : C) (S : CategoryTheory.Sieve X) : J.Saturate X S β β (Y : C) (f : Y βΆ X), J.Saturate Y (CategoryTheory.Sieve.pullback f S) - CategoryTheory.Precoverage.toGrothendieck_mono π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_3} [CategoryTheory.Category.{u_2, u_3} C] {J K : CategoryTheory.Precoverage C} (h : J β€ K) : J.toGrothendieck β€ K.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_toPretopology_eq_toGrothendieck π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_1, u_2} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderComposition] [J.IsStableUnderBaseChange] [CategoryTheory.Limits.HasPullbacks C] [J.HasIsos] : (CategoryTheory.Precoverage.toPretopology C J).toGrothendieck = J.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_le_iff_le_toPrecoverage π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] {K : CategoryTheory.Precoverage C} {J : CategoryTheory.GrothendieckTopology C} : K.toGrothendieck β€ J β K β€ J.toPrecoverage - CategoryTheory.Precoverage.Saturate.of π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {J : CategoryTheory.Precoverage C} (X : C) (S : CategoryTheory.Presieve X) (hS : S β J.coverings X) : J.Saturate X (CategoryTheory.Sieve.generate S) - CategoryTheory.Precoverage.mem_toGrothendieck_iff π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_1, u_2} C] {J : CategoryTheory.Precoverage C} {X : C} {S : CategoryTheory.Sieve X} : S β J.toGrothendieck X β J.Saturate X S - CategoryTheory.Presieve.IsSheaf.isSheafFor_of_mem_precoverage π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_3} [CategoryTheory.Category.{u_2, u_3} C] {J : CategoryTheory.Precoverage C} {P : CategoryTheory.Functor Cα΅α΅ (Type u_1)} (h : CategoryTheory.Presieve.IsSheaf J.toGrothendieck P) {S : C} {R : CategoryTheory.Presieve S} (hR : R β J.coverings S) : CategoryTheory.Presieve.IsSheafFor P R - CategoryTheory.Precoverage.Saturate.transitive π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {J : CategoryTheory.Precoverage C} (X : C) (S R : CategoryTheory.Sieve X) : J.Saturate X S β (β β¦Y : Cβ¦ β¦f : Y βΆ Xβ¦, S.arrows f β J.Saturate Y (CategoryTheory.Sieve.pullback f R)) β J.Saturate X R - CategoryTheory.Precoverage.generate_mem_toGrothendieck π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_1, u_2} C] {J : CategoryTheory.Precoverage C} {X : C} {R : CategoryTheory.Presieve X} (hR : R β J.coverings X) : CategoryTheory.Sieve.generate R β J.toGrothendieck X - CategoryTheory.Precoverage.isSheaf_toGrothendieck_iff π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_3} [CategoryTheory.Category.{u_2, u_3} C] {J : CategoryTheory.Precoverage C} (P : CategoryTheory.Functor Cα΅α΅ (Type u_1)) : CategoryTheory.Presieve.IsSheaf J.toGrothendieck P β β {X Y : C} {f : Y βΆ X}, β R β J.coverings X, CategoryTheory.Presieve.IsSheafFor P (CategoryTheory.Sieve.pullback f (CategoryTheory.Sieve.generate R)).arrows - CategoryTheory.GrothendieckTopology.toPrecoverage_top π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] : β€.toPrecoverage = β€ - CategoryTheory.Precoverage.toGrothendieck_bot π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_3, u_2} C] : β₯.toGrothendieck = β₯ - CategoryTheory.Precoverage.toGrothendieck_eq_sInf π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_1, u_2} C] (J : CategoryTheory.Precoverage C) : J.toGrothendieck = sInf {K | β β¦X : Cβ¦, β S β J.coverings X, CategoryTheory.Sieve.generate S β K X} - CategoryTheory.Precoverage.Saturate.top π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {J : CategoryTheory.Precoverage C} (X : C) : J.Saturate X β€ - CategoryTheory.Precoverage.mem_toGrothendieck_iff_of_isStableUnderComposition π Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck
{C : Type u_2} [CategoryTheory.Category.{u_1, u_2} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderComposition] [J.IsStableUnderBaseChange] [J.HasPullbacks] [J.HasIsos] {X : C} {S : CategoryTheory.Sieve X} : S β J.toGrothendieck X β β R β J.coverings X, R β€ S.arrows - CategoryTheory.Precoverage.ZeroHypercover.toOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [E.HasPullbacks] : J.toGrothendieck.OneHypercover S - CategoryTheory.Precoverage.ZeroHypercover.toOneHypercover_toPreOneHypercover π Mathlib.CategoryTheory.Sites.Hypercover.One
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Precoverage C} {S : C} (E : J.ZeroHypercover S) [E.HasPullbacks] : E.toOneHypercover.toPreOneHypercover = E.toPreOneHypercover - CategoryTheory.Coverage.toPrecoverage π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (self : CategoryTheory.Coverage C) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.toCoverage π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (J : CategoryTheory.Precoverage C) [J.HasPullbacks] [J.IsStableUnderBaseChange] : CategoryTheory.Coverage C - CategoryTheory.Precoverage.toCoverage_toPrecoverage π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (J : CategoryTheory.Precoverage C) [J.HasPullbacks] [J.IsStableUnderBaseChange] : J.toCoverage.toPrecoverage = J - CategoryTheory.Precoverage.toGrothendieck_toCoverage π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.Precoverage C} [J.HasPullbacks] [J.IsStableUnderBaseChange] : J.toCoverage.toGrothendieck = J.toGrothendieck - CategoryTheory.Precoverage.isSheaf_toGrothendieck_iff_of_isStableUnderBaseChange_of_small π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_2} [CategoryTheory.Category.{v_1, u_2} C] {J : CategoryTheory.Precoverage C} [J.IsStableUnderBaseChange] [J.HasPullbacks] [J.Small] (P : CategoryTheory.Functor Cα΅α΅ (Type u_1)) : CategoryTheory.Presieve.IsSheaf J.toGrothendieck P β β β¦X : Cβ¦ (E : J.ZeroHypercover X), CategoryTheory.Presieve.IsSheafFor P E.presieveβ - CategoryTheory.Precoverage.isSheaf_toGrothendieck_iff_of_isStableUnderBaseChange π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_2} [CategoryTheory.Category.{v_1, u_2} C] {J : CategoryTheory.Precoverage C} [J.HasPullbacks] [J.IsStableUnderBaseChange] (P : CategoryTheory.Functor Cα΅α΅ (Type u_1)) : CategoryTheory.Presieve.IsSheaf J.toGrothendieck P β β β¦X : Cβ¦, β R β J.coverings X, CategoryTheory.Presieve.IsSheafFor P R - CategoryTheory.Coverage.mk π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (toPrecoverage : CategoryTheory.Precoverage C) (pullback : β β¦X Y : Cβ¦ (f : Y βΆ X), β S β toPrecoverage.coverings X, β T β toPrecoverage.coverings Y, T.FactorsThruAlong S f) : CategoryTheory.Coverage C - CategoryTheory.Precoverage.toCoverage_le_toCoverage π Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {J : CategoryTheory.Precoverage C} [J.HasPullbacks] [J.IsStableUnderBaseChange] (K : CategoryTheory.GrothendieckTopology C) : (J.toCoverage β€ K.toCoverage) = β β¦X : Cβ¦, β S β J.coverings X, CategoryTheory.Sieve.generate S β K X - CategoryTheory.Functor.isContinuous_toGrothendieck_of_pullbacksPreservedBy π Mathlib.CategoryTheory.Sites.Continuous
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) (J : CategoryTheory.Precoverage C) (K : CategoryTheory.Precoverage D) [J.IsStableUnderBaseChange] [J.HasPullbacks] [K.IsStableUnderBaseChange] [K.HasPullbacks] [J.PullbacksPreservedBy F] (h : J β€ CategoryTheory.Precoverage.comap F K) : F.IsContinuous J.toGrothendieck K.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_comap_le_restrictedTopology π Mathlib.CategoryTheory.Sites.InducedTopology
{C : Type uβ} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} (K : CategoryTheory.Precoverage D) : (CategoryTheory.Precoverage.comap F K).toGrothendieck β€ F.restrictedTopology K.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_comap_le_inducedTopology π Mathlib.CategoryTheory.Sites.DenseSubsite.InducedTopology
{C : Type uβ} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} (K : CategoryTheory.Precoverage D) : (CategoryTheory.Precoverage.comap F K).toGrothendieck β€ F.restrictedTopology K.toGrothendieck - CategoryTheory.Precoverage.locallyCoverDense_of_map_functorPullback_mem π Mathlib.CategoryTheory.Sites.DenseSubsite.InducedTopology
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (F : CategoryTheory.Functor C D) (K : CategoryTheory.Precoverage D) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] (H : β {S : C} {R : CategoryTheory.Presieve (F.obj S)}, R β K.coverings (F.obj S) β CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F R) β K.coverings (F.obj S)) : F.LocallyCoverDense K.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_comap_eq_inducedTopology π Mathlib.CategoryTheory.Sites.DenseSubsite.InducedTopology
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (F : CategoryTheory.Functor C D) (K : CategoryTheory.Precoverage D) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [F.Faithful] [F.Full] (H : β {S : C} {R : CategoryTheory.Presieve (F.obj S)}, R β K.coverings (F.obj S) β CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F R) β K.coverings (F.obj S)) : (CategoryTheory.Precoverage.comap F K).toGrothendieck = F.restrictedTopology K.toGrothendieck - CategoryTheory.Precoverage.toGrothendieck_comap_eq_restrictedTopology π Mathlib.CategoryTheory.Sites.DenseSubsite.InducedTopology
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (F : CategoryTheory.Functor C D) (K : CategoryTheory.Precoverage D) [K.HasIsos] [K.IsStableUnderBaseChange] [K.IsStableUnderComposition] [K.HasPullbacks] [F.Faithful] [F.Full] (H : β {S : C} {R : CategoryTheory.Presieve (F.obj S)}, R β K.coverings (F.obj S) β CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F R) β K.coverings (F.obj S)) : (CategoryTheory.Precoverage.comap F K).toGrothendieck = F.restrictedTopology K.toGrothendieck - CategoryTheory.over_toGrothendieck_eq_toGrothendieck_comap_forget π Mathlib.CategoryTheory.Sites.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] (K : CategoryTheory.Precoverage C) [K.HasPullbacks] [K.IsStableUnderBaseChange] (X : C) : K.toGrothendieck.over X = (CategoryTheory.Precoverage.comap (CategoryTheory.Over.forget X) K).toGrothendieck - CategoryTheory.Types.jointlySurjectivePrecoverage π Mathlib.CategoryTheory.Sites.JointlySurjective
: CategoryTheory.Precoverage (Type u) - CategoryTheory.MorphismProperty.precoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.MorphismProperty C) : CategoryTheory.Precoverage C - CategoryTheory.Precoverage.morphismProperty π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (K : CategoryTheory.Precoverage C) : CategoryTheory.MorphismProperty C - CategoryTheory.Precoverage.instContainsIdentitiesMorphismPropertyOfHasIsos π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : CategoryTheory.Precoverage C} [K.HasIsos] : K.morphismProperty.ContainsIdentities - CategoryTheory.Precoverage.le_precoverage_morphismProperty π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : CategoryTheory.Precoverage C} : K β€ K.morphismProperty.precoverage - CategoryTheory.MorphismProperty.coverage_toPrecoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.MorphismProperty C) [P.IsStableUnderBaseChange] [P.HasPullbacks] : P.coverage.toPrecoverage = P.precoverage - CategoryTheory.MorphismProperty.pretopology_toPrecoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasPullbacks C] (P : CategoryTheory.MorphismProperty C) [P.IsMultiplicative] [P.IsStableUnderBaseChange] : P.pretopology.toPrecoverage = P.precoverage - CategoryTheory.MorphismProperty.comap_precoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (P : CategoryTheory.MorphismProperty D) (F : CategoryTheory.Functor C D) : CategoryTheory.Precoverage.comap F P.precoverage = (P.inverseImage F).precoverage - CategoryTheory.MorphismProperty.precoverage_top π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : β€.precoverage = β€ - CategoryTheory.Precoverage.morphismProperty_bot π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : β₯.morphismProperty = β₯ - 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) - CategoryTheory.Precoverage.monotone_morphismProperty π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : Monotone CategoryTheory.Precoverage.morphismProperty - CategoryTheory.Precoverage.galoisConnection_morphismProperty_precoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : GaloisConnection CategoryTheory.Precoverage.morphismProperty CategoryTheory.MorphismProperty.precoverage - CategoryTheory.Precoverage.morphismProperty_sup π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K L : CategoryTheory.Precoverage C} : (K β L).morphismProperty = K.morphismProperty β L.morphismProperty - CategoryTheory.MorphismProperty.precoverage_inf π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) : (P β Q).precoverage = P.precoverage β Q.precoverage - CategoryTheory.Precoverage.morphismProperty_le_iff_le_precoverage π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {K : CategoryTheory.Precoverage C} {P : CategoryTheory.MorphismProperty C} : K.morphismProperty β€ P β K β€ P.precoverage - CategoryTheory.MorphismProperty.precoverage_monotone π Mathlib.CategoryTheory.Sites.MorphismProperty
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {P Q : CategoryTheory.MorphismProperty C} (hPQ : P β€ Q) : P.precoverage β€ Q.precoverage - AlgebraicGeometry.Scheme.jointlySurjectivePrecoverage π Mathlib.AlgebraicGeometry.Sites.MorphismProperty
: CategoryTheory.Precoverage AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.zariskiPrecoverage π Mathlib.AlgebraicGeometry.Sites.MorphismProperty
: CategoryTheory.Precoverage AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.precoverage π Mathlib.AlgebraicGeometry.Sites.MorphismProperty
(P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme) : CategoryTheory.Precoverage AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.precoverage_mono π Mathlib.AlgebraicGeometry.Sites.MorphismProperty
{P Q : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} (h : P β€ Q) : AlgebraicGeometry.Scheme.precoverage P β€ AlgebraicGeometry.Scheme.precoverage Q - AlgebraicGeometry.Scheme.JointlySurjective π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
(K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme) : Prop - AlgebraicGeometry.Scheme.Cover π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
(K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme) (S : AlgebraicGeometry.Scheme) : Type (max (u + 1) (v + 1)) - AlgebraicGeometry.Scheme.Cover.Hom π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} (π° π± : AlgebraicGeometry.Scheme.Cover K X) : Type (max u v) - AlgebraicGeometry.Scheme.Cover.idx π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] (π° : AlgebraicGeometry.Scheme.Cover K X) (x : β₯X) : π°.Iβ - AlgebraicGeometry.Scheme.Cover.nonempty_of_nonempty π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} {X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.Scheme.JointlySurjective K] [Nonempty β₯X] (π° : AlgebraicGeometry.Scheme.Cover K X) : Nonempty π°.Iβ - 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.JointlySurjective.exists_eq π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} [self : AlgebraicGeometry.Scheme.JointlySurjective K] {X : AlgebraicGeometry.Scheme} (S : CategoryTheory.Presieve X) (hS : S β K.coverings X) (x : β₯X) : β Y g, S g β§ x β Set.range βg - AlgebraicGeometry.Scheme.JointlySurjective.mk π Mathlib.AlgebraicGeometry.Cover.MorphismProperty
{K : CategoryTheory.Precoverage AlgebraicGeometry.Scheme} (exists_eq : β {X : AlgebraicGeometry.Scheme}, β S β K.coverings X, β (x : β₯X), β Y g, S g β§ x β Set.range βg) : AlgebraicGeometry.Scheme.JointlySurjective K - 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
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