Loogle!
Result
Found 479 declarations mentioning CategoryTheory.Presieve. Of these, only the first 200 are shown.
- CategoryTheory.Presieve π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : Type (max uβ vβ) - CategoryTheory.instCompleteLatticePresieve π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] (X : C) : CompleteLattice (CategoryTheory.Presieve X) - CategoryTheory.instInhabitedPresieve π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] (X : C) : Inhabited (CategoryTheory.Presieve X) - CategoryTheory.Presieve.HasPairwisePullbacks π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : Prop - CategoryTheory.Presieve.category π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Presieve X) : Type (max uβ vβ) - CategoryTheory.Presieve.instHasPairwisePullbacksOfHasPullbacks π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) [CategoryTheory.Limits.HasPullbacks C] : R.HasPairwisePullbacks - CategoryTheory.Presieve.singleton π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : CategoryTheory.Presieve X - CategoryTheory.Presieve.HasPullbacks π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) {Y : C} (f : Y βΆ X) : Prop - CategoryTheory.Presieve.uncurry π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (s : CategoryTheory.Presieve X) : Set ((Y : C) Γ (Y βΆ X)) - CategoryTheory.Presieve.ofArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} (Y : ΞΉ β C) (f : (i : ΞΉ) β Y i βΆ X) : CategoryTheory.Presieve X - CategoryTheory.Presieve.pullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) (R : CategoryTheory.Presieve Y) : CategoryTheory.Presieve X - CategoryTheory.Presieve.pushforward π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve Y - CategoryTheory.Presieve.categoryMk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Presieve X) {Y : C} (f : Y βΆ X) (hf : P f) : P.category - CategoryTheory.Presieve.pullback_id π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.pullback (CategoryTheory.CategoryStruct.id X) R = R - CategoryTheory.Presieve.pushforward_id π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.pushforward (CategoryTheory.CategoryStruct.id X) R = R - CategoryTheory.Presieve.bindOfArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {X : C} (Y : ΞΉ β C) (f : (i : ΞΉ) β Y i βΆ X) (R : (i : ΞΉ) β CategoryTheory.Presieve (Y i)) : CategoryTheory.Presieve X - CategoryTheory.Presieve.instHasPullbacksOfHasPullbacks π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasPullbacks C] (R : CategoryTheory.Presieve X) {Y : C} (f : Y βΆ X) : R.HasPullbacks f - CategoryTheory.Presieve.bind π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y) : CategoryTheory.Presieve X - CategoryTheory.Presieve.pullbackArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) (R : CategoryTheory.Presieve X) [R.HasPullbacks f] : CategoryTheory.Presieve Y - CategoryTheory.Presieve.ofArrows_pUnit π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : (CategoryTheory.Presieve.ofArrows (fun x => Y) fun x => f) = CategoryTheory.Presieve.singleton f - CategoryTheory.Presieve.BindStruct π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y) {Z : C} (h : Z βΆ X) : Type (max uβ vβ) - CategoryTheory.Presieve.diagram π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) : CategoryTheory.Functor S.category C - CategoryTheory.Presieve.BindStruct.Y π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : C - CategoryTheory.Presieve.cocone π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) : CategoryTheory.Limits.Cocone S.diagram - CategoryTheory.Presieve.hasPullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} {instβ : CategoryTheory.Category.{vβ, uβ} C} {X : C} {R : CategoryTheory.Presieve X} {Y : C} (f : Y βΆ X) [self : R.HasPullbacks f] {Z : C} {h : Z βΆ X} : R h β CategoryTheory.Limits.HasPullback h f - CategoryTheory.Presieve.HasPullbacks.hasPullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} {instβ : CategoryTheory.Category.{vβ, uβ} C} {X : C} {R : CategoryTheory.Presieve X} {Y : C} (f : Y βΆ X) [self : R.HasPullbacks f] {Z : C} {h : Z βΆ X} : R h β CategoryTheory.Limits.HasPullback h f - CategoryTheory.Presieve.HasPullbacks.mk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {R : CategoryTheory.Presieve X} {Y : C} {f : Y βΆ X} (hasPullback : β {Z : C} {h : Z βΆ X}, R h β CategoryTheory.Limits.HasPullback h f) : R.HasPullbacks f - CategoryTheory.Presieve.HasPairwisePullbacks.has_pullbacks π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} {instβ : CategoryTheory.Category.{vβ, uβ} C} {X : C} {R : CategoryTheory.Presieve X} [self : R.HasPairwisePullbacks] {Y Z : C} {f : Y βΆ X} : R f β β {g : Z βΆ X}, R g β CategoryTheory.Limits.HasPullback f g - CategoryTheory.Presieve.HasPairwisePullbacks.mk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {R : CategoryTheory.Presieve X} (has_pullbacks : β {Y Z : C} {f : Y βΆ X}, R f β β {g : Z βΆ X}, R g β CategoryTheory.Limits.HasPullback f g) : R.HasPairwisePullbacks - CategoryTheory.Presieve.ofArrows_of_unique π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} [Unique ΞΉ] {Y : ΞΉ β C} (f : (i : ΞΉ) β Y i βΆ X) : CategoryTheory.Presieve.ofArrows Y f = CategoryTheory.Presieve.singleton (f default) - CategoryTheory.Presieve.pushforward_apply_comp π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} {f : X βΆ Y} {R : CategoryTheory.Presieve X} {g : Z βΆ X} (hg : R g) : CategoryTheory.Presieve.pushforward f R (CategoryTheory.CategoryStruct.comp g f) - CategoryTheory.Presieve.pullback_iff π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {f : Y βΆ X} {R : CategoryTheory.Presieve X} {Z : C} {g : Z βΆ Y} : CategoryTheory.Presieve.pullback f R g β R (CategoryTheory.CategoryStruct.comp g f) - CategoryTheory.Presieve.BindStruct.bind π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (b : S.BindStruct R h) : S.bind R h - CategoryTheory.Presieve.bind.bindStruct π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (H : S.bind R h) : S.BindStruct R h - CategoryTheory.Presieve.exists_eq_ofArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : β ΞΉ Y f, R = CategoryTheory.Presieve.ofArrows Y f - CategoryTheory.Presieve.ofArrows_comp_eq_of_surjective π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} {Ο : Type u_2} {Y : ΞΉ β C} (f : (i : ΞΉ) β Y i βΆ X) {a : Ο β ΞΉ} (ha : Function.Surjective a) : (CategoryTheory.Presieve.ofArrows (Y β a) fun i => f (a i)) = CategoryTheory.Presieve.ofArrows Y f - CategoryTheory.Presieve.pushforward_singleton π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : X βΆ Y) (g : Y βΆ Z) : CategoryTheory.Presieve.pushforward g (CategoryTheory.Presieve.singleton f) = CategoryTheory.Presieve.singleton (CategoryTheory.CategoryStruct.comp f g) - CategoryTheory.Presieve.singleton_le_iff π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) {R : CategoryTheory.Presieve X} : CategoryTheory.Presieve.singleton f β€ R β R f - CategoryTheory.Presieve.BindStruct.f π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : self.Y βΆ X - CategoryTheory.Presieve.BindStruct.g π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : Z βΆ self.Y - CategoryTheory.Presieve.le_pullback_pushforward π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) (R : CategoryTheory.Presieve Y) : R β€ CategoryTheory.Presieve.pullback f (CategoryTheory.Presieve.pushforward f R) - CategoryTheory.Presieve.pushforward_pullback_le π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.pushforward f (CategoryTheory.Presieve.pullback f R) β€ R - CategoryTheory.Presieve.bindOfArrows.mk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {X : C} {Y : ΞΉ β C} {f : (i : ΞΉ) β Y i βΆ X} {R : (i : ΞΉ) β CategoryTheory.Presieve (Y i)} (i : ΞΉ) {Z : C} (g : Z βΆ Y i) (hg : R i g) : CategoryTheory.Presieve.bindOfArrows Y f R (CategoryTheory.CategoryStruct.comp g (f i)) - CategoryTheory.Presieve.pullback_comp π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : Y βΆ X) (R : CategoryTheory.Presieve Z) (g : X βΆ Z) : CategoryTheory.Presieve.pullback (CategoryTheory.CategoryStruct.comp f g) R = CategoryTheory.Presieve.pullback f (CategoryTheory.Presieve.pullback g R) - CategoryTheory.Presieve.pushforward_comp π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : Y βΆ X) (R : CategoryTheory.Presieve Y) (g : X βΆ Z) : CategoryTheory.Presieve.pushforward (CategoryTheory.CategoryStruct.comp f g) R = CategoryTheory.Presieve.pushforward g (CategoryTheory.Presieve.pushforward f R) - CategoryTheory.Presieve.BindStruct.hf π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : S self.f - CategoryTheory.Presieve.pushforward_ofArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {U : ΞΉ β C} {X Y : C} (g : (i : ΞΉ) β U i βΆ X) (f : X βΆ Y) : CategoryTheory.Presieve.pushforward f (CategoryTheory.Presieve.ofArrows U g) = CategoryTheory.Presieve.ofArrows U fun x => CategoryTheory.CategoryStruct.comp (g x) f - CategoryTheory.Presieve.ofArrows_le_iff π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} {Y : ΞΉ β C} {f : (i : ΞΉ) β Y i βΆ X} {R : CategoryTheory.Presieve X} : CategoryTheory.Presieve.ofArrows Y f β€ R β β (i : ΞΉ), R (f i) - CategoryTheory.Presieve.monotone_pullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : Monotone (CategoryTheory.Presieve.pullback f) - CategoryTheory.Presieve.monotone_pushforward π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : Monotone (CategoryTheory.Presieve.pushforward f) - CategoryTheory.Presieve.bind_comp π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : Y βΆ X) {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {g : Z βΆ Y} (hβ : S f) (hβ : R hβ g) : S.bind R (CategoryTheory.CategoryStruct.comp g f) - CategoryTheory.Presieve.ofArrows_comp_le π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} {Ο : Type u_2} {Y : ΞΉ β C} (f : (i : ΞΉ) β Y i βΆ X) (a : Ο β ΞΉ) : (CategoryTheory.Presieve.ofArrows (Y β a) fun i => f (a i)) β€ CategoryTheory.Presieve.ofArrows Y f - CategoryTheory.Presieve.galoisConnection_pushforward_pullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : GaloisConnection (CategoryTheory.Presieve.pushforward f) (CategoryTheory.Presieve.pullback f) - CategoryTheory.Presieve.pullback_singleton π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : Y βΆ X) (g : Z βΆ X) [CategoryTheory.Limits.HasPullback g f] : CategoryTheory.Presieve.pullbackArrows f (CategoryTheory.Presieve.singleton g) = CategoryTheory.Presieve.singleton (CategoryTheory.Limits.pullback.snd g f) - CategoryTheory.Presieve.BindStruct.hg π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : R β― self.g - CategoryTheory.Presieve.pullbackArrows.mk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {f : Y βΆ X} {R : CategoryTheory.Presieve X} [R.HasPullbacks f] (Z : C) (h : Z βΆ X) (hRh : R h) : CategoryTheory.Presieve.pullbackArrows f R (CategoryTheory.Limits.pullback.snd h f) - CategoryTheory.Presieve.BindStruct.fac π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) : CategoryTheory.CategoryStruct.comp self.g self.f = h - CategoryTheory.Presieve.ofArrows_category π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {S : C} (R : CategoryTheory.Presieve S) : (CategoryTheory.Presieve.ofArrows (fun f => f.obj.left) fun f => f.obj.hom) = R - CategoryTheory.Presieve.BindStruct.mk π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (Y : C) (g : Z βΆ Y) (f : Y βΆ X) (hf : S f) (hg : R hf g) (fac : CategoryTheory.CategoryStruct.comp g f = h) : S.BindStruct R h - CategoryTheory.Presieve.pushforward_le_iff_le_pullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) (R : CategoryTheory.Presieve Y) (T : CategoryTheory.Presieve X) : CategoryTheory.Presieve.pushforward f R β€ T β R β€ CategoryTheory.Presieve.pullback f T - CategoryTheory.top_apply π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : β€ f - CategoryTheory.Presieve.ofArrows_pullback π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) {ΞΉ : Type u_1} (Z : ΞΉ β C) (g : (i : ΞΉ) β Z i βΆ X) [β (i : ΞΉ), CategoryTheory.Limits.HasPullback (g i) f] : (CategoryTheory.Presieve.ofArrows (fun i => CategoryTheory.Limits.pullback (g i) f) fun x => CategoryTheory.Limits.pullback.snd (g x) f) = CategoryTheory.Presieve.pullbackArrows f (CategoryTheory.Presieve.ofArrows Z g) - CategoryTheory.bot_apply π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) : β₯ f β False - CategoryTheory.Presieve.ofArrows_of_isEmpty π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} [IsEmpty ΞΉ] {Y : ΞΉ β C} (f : (i : ΞΉ) β Y i βΆ X) : CategoryTheory.Presieve.ofArrows Y f = β₯ - CategoryTheory.Presieve.BindStruct.fac_assoc π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Presieve X} {R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Presieve Y} {Z : C} {h : Z βΆ X} (self : S.BindStruct R h) {Zβ : C} (hβ : X βΆ Zβ) : CategoryTheory.CategoryStruct.comp self.g (CategoryTheory.CategoryStruct.comp self.f hβ) = CategoryTheory.CategoryStruct.comp h hβ - CategoryTheory.Presieve.bindOfArrows_ofArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) {Ο : ΞΉ β Type u_2} {Y : (i : ΞΉ) β Ο i β C} (g : (i : ΞΉ) β (j : Ο i) β Y i j βΆ X i) : (CategoryTheory.Presieve.bindOfArrows X f fun i => CategoryTheory.Presieve.ofArrows (Y i) (g i)) = CategoryTheory.Presieve.ofArrows (fun p => Y p.fst p.snd) fun p => CategoryTheory.CategoryStruct.comp (g p.fst p.snd) (f p.fst) - CategoryTheory.Presieve.uncurry_pullbackArrows π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (s : CategoryTheory.Presieve X) [CategoryTheory.Limits.HasPullbacks C] {B : C} (b : B βΆ X) : (CategoryTheory.Presieve.pullbackArrows b s).uncurry = (fun f => β¨CategoryTheory.Limits.pullback f.snd b, CategoryTheory.Limits.pullback.snd f.snd bβ©) '' s.uncurry - CategoryTheory.Presieve.uncurry_bind π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (s : CategoryTheory.Presieve X) (t : β¦Y : Cβ¦ β (f : Y βΆ X) β s f β CategoryTheory.Presieve Y) : (s.bind t).uncurry = β i, β (h : i β s.uncurry), (Sigma.map id fun Z g => CategoryTheory.CategoryStruct.comp g i.snd) '' (t i.snd h).uncurry - CategoryTheory.Presieve.ofArrows_bind π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {ΞΉ : Type u_1} (Z : ΞΉ β C) (g : (i : ΞΉ) β Z i βΆ X) (j : β¦Y : Cβ¦ β (f : Y βΆ X) β CategoryTheory.Presieve.ofArrows Z g f β Type u_2) (W : β¦Y : Cβ¦ β (f : Y βΆ X) β (H : CategoryTheory.Presieve.ofArrows Z g f) β j f H β C) (k : β¦Y : Cβ¦ β (f : Y βΆ X) β (H : CategoryTheory.Presieve.ofArrows Z g f) β (i : j f H) β W f H i βΆ Y) : ((CategoryTheory.Presieve.ofArrows Z g).bind fun x f H => CategoryTheory.Presieve.ofArrows (W f H) (k f H)) = CategoryTheory.Presieve.ofArrows (fun i => W (g i.fst) β― i.snd) fun ij => CategoryTheory.CategoryStruct.comp (k (g ij.fst) β― ij.snd) (g ij.fst) - CategoryTheory.Presieve.ofArrows_eq_ofArrows_uncurry π Mathlib.CategoryTheory.Sites.Sieves.Presieve
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {S : C} {X : ΞΉ β C} (f : (i : ΞΉ) β X i βΆ S) : CategoryTheory.Presieve.ofArrows X f = CategoryTheory.Presieve.ofArrows (fun i => X (CategoryTheory.Presieve.ofArrows.idx β―)) fun i => f (CategoryTheory.Presieve.ofArrows.idx β―) - CategoryTheory.Sieve.arrows π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (self : CategoryTheory.Sieve X) : CategoryTheory.Presieve X - CategoryTheory.Sieve.generate π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Sieve X - CategoryTheory.Sieve.instCoeFunPresieve π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CoeFun (CategoryTheory.Sieve X) fun x => CategoryTheory.Presieve X - CategoryTheory.Sieve.bind π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Sieve Y) : CategoryTheory.Sieve X - CategoryTheory.Sieve.arrows_ext π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {R S : CategoryTheory.Sieve X} : R.arrows = S.arrows β R = S - CategoryTheory.Sieve.BindStruct π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Sieve Y) {Z : C} (h : Z βΆ X) : Type (max uβ vβ) - CategoryTheory.Sieve.generate_pushforward π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) (R : CategoryTheory.Presieve X) : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.pushforward f R) = CategoryTheory.Sieve.pushforward f (CategoryTheory.Sieve.generate R) - CategoryTheory.Sieve.pullback_arrows π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) (S : CategoryTheory.Sieve Y) : (CategoryTheory.Sieve.pullback f S).arrows = CategoryTheory.Presieve.pullback f S.arrows - CategoryTheory.Sieve.pushforward_arrows π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) (S : CategoryTheory.Sieve X) : (CategoryTheory.Sieve.pushforward f S).arrows = CategoryTheory.Presieve.pushforward f S.arrows - CategoryTheory.Sieve.le_generate π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : R β€ (CategoryTheory.Sieve.generate R).arrows - CategoryTheory.Sieve.mk π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (arrows : CategoryTheory.Presieve X) (downward_closed : β {Y Z : C} {f : Y βΆ X}, arrows f β β (g : Z βΆ Y), arrows (CategoryTheory.CategoryStruct.comp g f)) : CategoryTheory.Sieve X - CategoryTheory.Sieve.pullbackArrows_comm π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : Y βΆ X) (R : CategoryTheory.Presieve X) [R.HasPullbacks f] : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.pullbackArrows f R) = CategoryTheory.Sieve.pullback f (CategoryTheory.Sieve.generate R) - CategoryTheory.Sieve.arrows_mono π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Monotone CategoryTheory.Sieve.arrows - CategoryTheory.Sieve.generate_mono π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Monotone CategoryTheory.Sieve.generate - CategoryTheory.Sieve.giGenerate π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : GaloisInsertion CategoryTheory.Sieve.generate CategoryTheory.Sieve.arrows - CategoryTheory.Sieve.bind_apply π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Sieve Y) : (CategoryTheory.Sieve.bind S R).arrows = S.bind fun x x_1 h => (R h).arrows - CategoryTheory.Sieve.generate_le_iff π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) (S : CategoryTheory.Sieve X) : CategoryTheory.Sieve.generate R β€ S β R β€ S.arrows - CategoryTheory.Sieve.le_pullback_bind π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Sieve Y) (f : Y βΆ X) (h : S f) : R h β€ CategoryTheory.Sieve.pullback f (CategoryTheory.Sieve.bind S R) - CategoryTheory.Sieve.pushforward_le_bind_of_mem π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (S : CategoryTheory.Presieve X) (R : β¦Y : Cβ¦ β β¦f : Y βΆ Xβ¦ β S f β CategoryTheory.Sieve Y) (f : Y βΆ X) (h : S f) : CategoryTheory.Sieve.pushforward f (R h) β€ CategoryTheory.Sieve.bind S R - CategoryTheory.Sieve.ofArrows_category' π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {S : C} (R : CategoryTheory.Presieve S) : (CategoryTheory.Sieve.ofArrows (fun f => f.obj.left) fun f => f.obj.hom) = CategoryTheory.Sieve.generate R - CategoryTheory.Sieve.generate_apply π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) (Z : C) (f : Z βΆ X) : (CategoryTheory.Sieve.generate R).arrows f = β Y h g, R g β§ CategoryTheory.CategoryStruct.comp h g = f - CategoryTheory.Sieve.generate_of_contains_isSplitEpi π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {R : CategoryTheory.Presieve X} (f : Y βΆ X) [CategoryTheory.IsSplitEpi f] (hf : R f) : CategoryTheory.Sieve.generate R = β€ - CategoryTheory.Presieve.bind_ofArrows_le_bindOfArrows π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {ΞΉ : Type u_1} {X : C} (Z : ΞΉ β C) (f : (i : ΞΉ) β Z i βΆ X) (R : (i : ΞΉ) β CategoryTheory.Presieve (Z i)) : (CategoryTheory.Sieve.bind (CategoryTheory.Sieve.ofArrows Z f).arrows fun x x_1 hg => CategoryTheory.Sieve.pullback (CategoryTheory.Sieve.ofArrows.h hg) (CategoryTheory.Sieve.generate (R (CategoryTheory.Sieve.ofArrows.i hg)))) β€ CategoryTheory.Sieve.generate (CategoryTheory.Presieve.bindOfArrows Z f R) - CategoryTheory.Sieve.arrows_bot π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : β₯.arrows = β₯ - CategoryTheory.Sieve.arrows_top π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : β€.arrows = β€ - CategoryTheory.Sieve.generate_bot π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Sieve.generate β₯ = β₯ - CategoryTheory.Sieve.generate_top π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Sieve.generate β€ = β€ - CategoryTheory.Sieve.arrows_eq_bot_iff π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Sieve X} : S.arrows = β₯ β S = β₯ - CategoryTheory.Sieve.arrows_eq_top_iff π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {S : CategoryTheory.Sieve X} : S.arrows = β€ β S = β€ - CategoryTheory.Sieve.generate_eq_bot_iff π Mathlib.CategoryTheory.Sites.Sieves.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Sieve.generate R = β₯ β R = β₯ - CategoryTheory.GrothendieckTopology.bindOfArrows π Mathlib.CategoryTheory.Sites.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {ΞΉ : Type u_1} {X : C} {Z : ΞΉ β C} {f : (i : ΞΉ) β Z i βΆ X} {R : (i : ΞΉ) β CategoryTheory.Presieve (Z i)} (h : CategoryTheory.Sieve.ofArrows Z f β J X) (hR : β (i : ΞΉ), CategoryTheory.Sieve.generate (R i) β J (Z i)) : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.bindOfArrows Z f R) β J X - CategoryTheory.Presieve.functorPullback_id π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.functorPullback (CategoryTheory.Functor.id C) R = R - CategoryTheory.Presieve.functorPullback π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Presieve (F.obj X)) : CategoryTheory.Presieve X - CategoryTheory.Presieve.functorPushforward π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (S : CategoryTheory.Presieve X) : CategoryTheory.Presieve (F.obj X) - CategoryTheory.Presieve.map π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (s : CategoryTheory.Presieve X) : CategoryTheory.Presieve (F.obj X) - CategoryTheory.Presieve.map_id π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.map (CategoryTheory.Functor.id C) R = R - CategoryTheory.Presieve.FunctorPushforwardStructure π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (S : CategoryTheory.Presieve X) {Y : D} (f : Y βΆ F.obj X) : Type (max (max uβ vβ) vβ) - CategoryTheory.Presieve.FunctorPushforwardStructure.preobj π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (self : CategoryTheory.Presieve.FunctorPushforwardStructure F S f) : C - CategoryTheory.Sieve.functorPushforward_extend_eq π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} {R : CategoryTheory.Presieve X} : CategoryTheory.Presieve.functorPushforward F (CategoryTheory.Sieve.generate R).arrows = CategoryTheory.Presieve.functorPushforward F R - CategoryTheory.Presieve.getFunctorPushforwardStructure π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X : C} {F : CategoryTheory.Functor C D} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (h : CategoryTheory.Presieve.functorPushforward F S f) : CategoryTheory.Presieve.FunctorPushforwardStructure F S f - CategoryTheory.Presieve.image_mem_functorPushforward π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X Y : C} (R : CategoryTheory.Presieve X) {f : Y βΆ X} (h : R f) : CategoryTheory.Presieve.functorPushforward F R (F.map f) - CategoryTheory.Presieve.map_map π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X Y : C} {f : Y βΆ X} {R : CategoryTheory.Presieve X} (hf : R f) : CategoryTheory.Presieve.map F R (F.map f) - CategoryTheory.Presieve.map.of π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {s : CategoryTheory.Presieve X} {Y : C} {u : Y βΆ X} (h : s u) : CategoryTheory.Presieve.map F s (F.map u) - CategoryTheory.Presieve.functorPullback_arrows π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (S : CategoryTheory.Sieve (F.obj X)) : CategoryTheory.Presieve.functorPullback F S.arrows = (CategoryTheory.Sieve.functorPullback F S).arrows - CategoryTheory.Presieve.functorPullback_map_functorPullback π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve (F.obj X)) : CategoryTheory.Presieve.functorPullback F (CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F R)) = CategoryTheory.Presieve.functorPullback F R - CategoryTheory.Presieve.map_functorPullback_map π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F (CategoryTheory.Presieve.map F R)) = CategoryTheory.Presieve.map F R - CategoryTheory.Sieve.functorPullback_apply π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Sieve (F.obj X)) : (CategoryTheory.Sieve.functorPullback F R).arrows = CategoryTheory.Presieve.functorPullback F R.arrows - CategoryTheory.Sieve.functorPullback_arrows π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Sieve (F.obj X)) : (CategoryTheory.Sieve.functorPullback F R).arrows = CategoryTheory.Presieve.functorPullback F R.arrows - CategoryTheory.Sieve.functorPushforward_apply π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Sieve X) : (CategoryTheory.Sieve.functorPushforward F R).arrows = CategoryTheory.Presieve.functorPushforward F R.arrows - CategoryTheory.Sieve.generate_map_eq_functorPushforward π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} {s : CategoryTheory.Presieve X} : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.map F s) = CategoryTheory.Sieve.functorPushforward F (CategoryTheory.Sieve.generate s) - CategoryTheory.Presieve.functorPullback_mem π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Presieve (F.obj X)) {Y : C} (f : Y βΆ X) : CategoryTheory.Presieve.functorPullback F R f β R (F.map f) - CategoryTheory.Presieve.le_functorPullback_map π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve X) : R β€ CategoryTheory.Presieve.functorPullback F (CategoryTheory.Presieve.map F R) - CategoryTheory.Presieve.FunctorPushforwardStructure.premap π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (self : CategoryTheory.Presieve.FunctorPushforwardStructure F S f) : self.preobj βΆ X - CategoryTheory.Sieve.arrows_generate_map_eq_functorPushforward π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} {s : CategoryTheory.Presieve X} : (CategoryTheory.Sieve.generate (CategoryTheory.Presieve.map F s)).arrows = CategoryTheory.Presieve.functorPushforward F s - CategoryTheory.Presieve.FunctorPushforwardStructure.cover π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (self : CategoryTheory.Presieve.FunctorPushforwardStructure F S f) : S self.premap - CategoryTheory.Presieve.FunctorPushforwardStructure.lift π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (self : CategoryTheory.Presieve.FunctorPushforwardStructure F S f) : Y βΆ F.obj self.preobj - CategoryTheory.Presieve.map_singleton π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X Y : C} (f : X βΆ Y) : CategoryTheory.Presieve.map F (CategoryTheory.Presieve.singleton f) = CategoryTheory.Presieve.singleton (F.map f) - CategoryTheory.Presieve.functorPushforward_comp π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (G : CategoryTheory.Functor D E) (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.functorPushforward (F.comp G) R = CategoryTheory.Presieve.functorPushforward G (CategoryTheory.Presieve.functorPushforward F R) - CategoryTheory.Sieve.generate_functorPullback_le π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Presieve (F.obj X)) : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.functorPullback F R) β€ CategoryTheory.Sieve.functorPullback F (CategoryTheory.Sieve.generate R) - CategoryTheory.Presieve.map_ofArrows π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {ΞΉ : Type u_1} {Y : ΞΉ β C} (f : (i : ΞΉ) β Y i βΆ X) : CategoryTheory.Presieve.map F (CategoryTheory.Presieve.ofArrows Y f) = CategoryTheory.Presieve.ofArrows (fun i => F.obj (Y i)) fun i => F.map (f i) - CategoryTheory.Presieve.functorPullback_monotone π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} : Monotone (CategoryTheory.Presieve.functorPullback F) - CategoryTheory.Presieve.functorPushforward_monotone π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} : Monotone (CategoryTheory.Presieve.functorPushforward F) - CategoryTheory.Presieve.map_monotone π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} : Monotone (CategoryTheory.Presieve.map F) - CategoryTheory.Presieve.map_le_functorPushforward π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) {X : C} (S : CategoryTheory.Presieve X) : CategoryTheory.Presieve.map F S β€ CategoryTheory.Presieve.functorPushforward F S - CategoryTheory.Presieve.galoisConnection_map_functorPullback π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) (X : C) : GaloisConnection (CategoryTheory.Presieve.map F) (CategoryTheory.Presieve.functorPullback F) - CategoryTheory.Presieve.map_functorPullback π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve (F.obj X)) : CategoryTheory.Presieve.map F (CategoryTheory.Presieve.functorPullback F R) β€ R - CategoryTheory.Presieve.functorPushforward_overForget π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {S : C} {X : CategoryTheory.Over S} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.functorPushforward (CategoryTheory.Over.forget S) R = (CategoryTheory.Sieve.generate (CategoryTheory.Presieve.map (CategoryTheory.Over.forget S) R)).arrows - CategoryTheory.Presieve.FunctorPushforwardStructure.mk π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (preobj : C) (premap : preobj βΆ X) (lift : Y βΆ F.obj preobj) (cover : S premap) (fac : f = CategoryTheory.CategoryStruct.comp lift (F.map premap)) : CategoryTheory.Presieve.FunctorPushforwardStructure F S f - CategoryTheory.Presieve.FunctorPushforwardStructure.fac π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {S : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} (self : CategoryTheory.Presieve.FunctorPushforwardStructure F S f) : f = CategoryTheory.CategoryStruct.comp self.lift (F.map self.premap) - CategoryTheory.Presieve.map_le_iff_le_functorPullback π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {R : CategoryTheory.Presieve X} {S : CategoryTheory.Presieve (F.obj X)} : CategoryTheory.Presieve.map F R β€ S β R β€ CategoryTheory.Presieve.functorPullback F S - CategoryTheory.Presieve.map_iff π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} {R : CategoryTheory.Presieve X} {Y : D} {f : Y βΆ F.obj X} : CategoryTheory.Presieve.map F R f β β Z, β (h : F.obj Z = Y), β g, R g β§ F.map g = CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom h) f - CategoryTheory.Presieve.map_bot π Mathlib.CategoryTheory.Sites.Sieves.Functoriality
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {X : C} : CategoryTheory.Presieve.map F β₯ = β₯ - 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.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.Functor.PreservesPairwisePullbacks π 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] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Presieve X) : Prop - 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.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.instPreservesPairwisePullbacksOfPreservesLimitsOfShapeWalkingCospan π 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] (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] {X : C} (R : CategoryTheory.Presieve X) : F.PreservesPairwisePullbacks R - 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.Presieve.HasPairwisePullbacks.map_of_preservesPairwisePullbacks π 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] (F : CategoryTheory.Functor C D) {X : C} (R : CategoryTheory.Presieve X) [F.PreservesPairwisePullbacks R] [R.HasPairwisePullbacks] : (CategoryTheory.Presieve.map F 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.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.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.Functor.preservesLimit_cospan_of_mem_presieve π 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} {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve X) [self : F.PreservesPairwisePullbacks R] β¦Y Z : Cβ¦ β¦f : Y βΆ Xβ¦ β¦g : Z βΆ Xβ¦ : R f β R g β CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan f g) F - CategoryTheory.Functor.PreservesPairwisePullbacks.preservesLimit π 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} {F : CategoryTheory.Functor C D} {X : C} (R : CategoryTheory.Presieve X) [self : F.PreservesPairwisePullbacks R] β¦Y Z : Cβ¦ β¦f : Y βΆ Xβ¦ β¦g : Z βΆ Xβ¦ : R f β R g β CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan f g) F - CategoryTheory.Functor.PreservesPairwisePullbacks.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] {F : CategoryTheory.Functor C D} {X : C} {R : CategoryTheory.Presieve X} (preservesLimit : β β¦Y Z : Cβ¦ β¦f : Y βΆ Xβ¦ β¦g : Z βΆ Xβ¦, R f β R g β CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan f g) F := by infer_instance) : F.PreservesPairwisePullbacks R - 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.instCoeFunForallSetPresieve π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] : CoeFun (CategoryTheory.Pretopology C) fun x => (X : C) β Set (CategoryTheory.Presieve X) - CategoryTheory.Pretopology.ext π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {instβΒΉ : CategoryTheory.Limits.HasPullbacks C} {x y : CategoryTheory.Pretopology C} (coverings : x.coverings = y.coverings) : x = y - CategoryTheory.Pretopology.ext_iff π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} {instβ : CategoryTheory.Category.{v, u} C} {instβΒΉ : CategoryTheory.Limits.HasPullbacks C} {x y : CategoryTheory.Pretopology C} : x = y β x.coverings = y.coverings - CategoryTheory.Pretopology.has_isos π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (self : CategoryTheory.Pretopology C) β¦X Y : Cβ¦ (f : Y βΆ X) [CategoryTheory.IsIso f] : CategoryTheory.Presieve.singleton f β self.coverings X - CategoryTheory.Pretopology.le_def π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Kβ Kβ : CategoryTheory.Pretopology C} : Kβ β€ Kβ β Kβ.coverings β€ Kβ.coverings - CategoryTheory.GrothendieckTopology.mem_toPretopology π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (t : CategoryTheory.GrothendieckTopology C) {X : C} (S : CategoryTheory.Presieve X) : S β t.toPretopology.coverings X β CategoryTheory.Sieve.generate S β t X - CategoryTheory.Pretopology.pullbacks π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (self : CategoryTheory.Pretopology C) β¦X Y : Cβ¦ (f : Y βΆ X) (S : CategoryTheory.Presieve X) : S β self.coverings X β CategoryTheory.Presieve.pullbackArrows f S β self.coverings Y - CategoryTheory.Pretopology.mem_sInf π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (T : Set (CategoryTheory.Pretopology C)) {X : C} (S : CategoryTheory.Presieve X) : S β (sInf T).coverings X β β t β T, S β t.coverings X - CategoryTheory.Pretopology.mem_inf π Mathlib.CategoryTheory.Sites.Pretopology
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (tβ tβ : CategoryTheory.Pretopology C) {X : C} (S : CategoryTheory.Presieve X) : S β (tβ β tβ).coverings X β S β tβ.coverings X β§ S β tβ.coverings X - CategoryTheory.Pretopology.transitive π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (self : CategoryTheory.Pretopology C) β¦X : Cβ¦ (S : CategoryTheory.Presieve X) (Ti : β¦Y : Cβ¦ β (f : Y βΆ X) β S f β CategoryTheory.Presieve Y) : S β self.coverings X β (β β¦Y : Cβ¦ (f : Y βΆ X) (H : S f), Ti f H β self.coverings Y) β S.bind Ti β self.coverings X - CategoryTheory.Pretopology.mem_toGrothendieck π Mathlib.CategoryTheory.Sites.Pretopology
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] (K : CategoryTheory.Pretopology C) (X : C) (S : CategoryTheory.Sieve X) : S β K.toGrothendieck X β β R β K.coverings X, R β€ S.arrows - 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.Presieve.FamilyOfElements π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Functor Cα΅α΅ (Type w)) (R : CategoryTheory.Presieve X) : Type (max (max uβ w) vβ) - CategoryTheory.Presieve.IsSeparatedFor π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Functor Cα΅α΅ (Type w)) (R : CategoryTheory.Presieve X) : Prop - CategoryTheory.Presieve.IsSheafFor π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Functor Cα΅α΅ (Type w)) (R : CategoryTheory.Presieve X) : Prop - CategoryTheory.Presieve.FamilyOfElements.Compatible π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (x : CategoryTheory.Presieve.FamilyOfElements P R) : Prop - CategoryTheory.Presieve.FamilyOfElements.PullbackCompatible π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (x : CategoryTheory.Presieve.FamilyOfElements P R) [R.HasPairwisePullbacks] : Prop - CategoryTheory.Presieve.IsSheafFor.isSeparatedFor π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} : CategoryTheory.Presieve.IsSheafFor P R β CategoryTheory.Presieve.IsSeparatedFor P R - CategoryTheory.Presieve.FamilyOfElements.IsAmalgamation π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (x : CategoryTheory.Presieve.FamilyOfElements P R) (t : P.obj (Opposite.op X)) : Prop - CategoryTheory.Presieve.FamilyOfElements.sieveExtend π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (x : CategoryTheory.Presieve.FamilyOfElements P R) : CategoryTheory.Presieve.FamilyOfElements P (CategoryTheory.Sieve.generate R).arrows - CategoryTheory.Presieve.isSeparatedFor_iff_generate π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} : CategoryTheory.Presieve.IsSeparatedFor P R β CategoryTheory.Presieve.IsSeparatedFor P (CategoryTheory.Sieve.generate R).arrows - CategoryTheory.Presieve.isSheafFor_iff_generate π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} (R : CategoryTheory.Presieve X) : CategoryTheory.Presieve.IsSheafFor P R β CategoryTheory.Presieve.IsSheafFor P (CategoryTheory.Sieve.generate R).arrows - CategoryTheory.Presieve.pullbackCompatible_iff π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (x : CategoryTheory.Presieve.FamilyOfElements P R) [R.HasPairwisePullbacks] : x.Compatible β x.PullbackCompatible - CategoryTheory.Presieve.IsSheafFor.amalgamate π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (t : CategoryTheory.Presieve.IsSheafFor P R) (x : CategoryTheory.Presieve.FamilyOfElements P R) (hx : x.Compatible) : P.obj (Opposite.op X) - CategoryTheory.Presieve.FamilyOfElements.Compatible.sieveExtend π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} {x : CategoryTheory.Presieve.FamilyOfElements P R} (hx : x.Compatible) : x.sieveExtend.Compatible - CategoryTheory.Presieve.IsSheafFor.isAmalgamation π Mathlib.CategoryTheory.Sites.IsSheafFor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P : CategoryTheory.Functor Cα΅α΅ (Type w)} {X : C} {R : CategoryTheory.Presieve X} (t : CategoryTheory.Presieve.IsSheafFor P R) {x : CategoryTheory.Presieve.FamilyOfElements P R} (hx : x.Compatible) : x.IsAmalgamation (t.amalgamate x hx)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59