Loogle!
Result
Found 201 declarations mentioning Shrink. Of these, only the first 200 are shown.
- Shrink 📋 Mathlib.Logic.Small.Defs
(α : Type v) [Small.{w, v} α] : Type w - equivShrink 📋 Mathlib.Logic.Small.Defs
(α : Type v) [Small.{w, v} α] : α ≃ Shrink.{w, v} α - instNontrivialShrink 📋 Mathlib.Logic.Small.Defs
{α : Type u} [Small.{v, u} α] [Nontrivial α] : Nontrivial (Shrink.{v, u} α) - Shrink.rec 📋 Mathlib.Logic.Small.Defs
{α : Type u_1} [Small.{w, u_1} α] {F : Shrink.{w, u_1} α → Sort v} (h : (X : α) → F ((equivShrink α) X)) (X : Shrink.{w, u_1} α) : F X - Shrink.ext 📋 Mathlib.Logic.Small.Defs
{α : Type v} [Small.{w, v} α] {x y : Shrink.{w, v} α} (w : (equivShrink α).symm x = (equivShrink α).symm y) : x = y - Shrink.ext_iff 📋 Mathlib.Logic.Small.Defs
{α : Type v} [Small.{w, v} α] {x y : Shrink.{w, v} α} : x = y ↔ (equivShrink α).symm x = (equivShrink α).symm y - Shrink.rec_equivShrink 📋 Mathlib.Logic.Small.Defs
{α : Type u_1} [Small.{w, u_1} α] {F : Shrink.{w, u_1} α → Sort v} {f : (a : α) → F ((equivShrink α) a)} (a : α) : Shrink.rec f ((equivShrink α) a) = f a - Cardinal.lift_mk_shrink'' 📋 Mathlib.SetTheory.Cardinal.Basic
(α : Type (max u v)) [Small.{v, max u v} α] : Cardinal.lift.{u, v} (Cardinal.mk (Shrink.{v, max u v} α)) = Cardinal.mk α - Cardinal.lift_mk_shrink 📋 Mathlib.SetTheory.Cardinal.Basic
(α : Type u) [Small.{v, u} α] : Cardinal.lift.{max u w, v} (Cardinal.mk (Shrink.{v, u} α)) = Cardinal.lift.{max v w, u} (Cardinal.mk α) - Cardinal.lift_mk_shrink' 📋 Mathlib.SetTheory.Cardinal.Basic
(α : Type u) [Small.{v, u} α] : Cardinal.lift.{u, v} (Cardinal.mk (Shrink.{v, u} α)) = Cardinal.lift.{v, u} (Cardinal.mk α) - Shrink.instAdd 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] : Add (Shrink.{v, u_2} α) - Shrink.instAddCommGroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddCommGroup α] : AddCommGroup (Shrink.{v, u_2} α) - Shrink.instAddCommMonoid 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddCommMonoid α] : AddCommMonoid (Shrink.{v, u_2} α) - Shrink.instAddCommSemigroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddCommSemigroup α] : AddCommSemigroup (Shrink.{v, u_2} α) - Shrink.instAddGroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddGroup α] : AddGroup (Shrink.{v, u_2} α) - Shrink.instAddMonoid 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddMonoid α] : AddMonoid (Shrink.{v, u_2} α) - Shrink.instAddSemigroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddSemigroup α] : AddSemigroup (Shrink.{v, u_2} α) - Shrink.instAddZeroClass 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [AddZeroClass α] : AddZeroClass (Shrink.{v, u_2} α) - Shrink.instCommGroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [CommGroup α] : CommGroup (Shrink.{v, u_2} α) - Shrink.instCommMonoid 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [CommMonoid α] : CommMonoid (Shrink.{v, u_2} α) - Shrink.instCommSemigroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [CommSemigroup α] : CommSemigroup (Shrink.{v, u_2} α) - Shrink.instDiv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Div α] : Div (Shrink.{v, u_2} α) - Shrink.instGroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Group α] : Group (Shrink.{v, u_2} α) - Shrink.instInv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Inv α] : Inv (Shrink.{v, u_2} α) - Shrink.instMonoid 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Monoid α] : Monoid (Shrink.{v, u_2} α) - Shrink.instMul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] : Mul (Shrink.{v, u_2} α) - Shrink.instMulOneClass 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [MulOneClass α] : MulOneClass (Shrink.{v, u_2} α) - Shrink.instNeg 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Neg α] : Neg (Shrink.{v, u_2} α) - Shrink.instOne 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [One α] : One (Shrink.{v, u_2} α) - Shrink.instSemigroup 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Semigroup α] : Semigroup (Shrink.{v, u_2} α) - Shrink.instSub 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Sub α] : Sub (Shrink.{v, u_2} α) - Shrink.instZero 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Zero α] : Zero (Shrink.{v, u_2} α) - Shrink.instNSMul 📋 Mathlib.Algebra.Group.Shrink
{M : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [SMul M α] : SMul M (Shrink.{v, u_2} α) - Shrink.instPow 📋 Mathlib.Algebra.Group.Shrink
{M : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [Pow α M] : Pow (Shrink.{v, u_2} α) M - Shrink.addEquiv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] : Shrink.{v, u_2} α ≃+ α - Shrink.mulEquiv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] : Shrink.{v, u_2} α ≃* α - Shrink.instAddAction 📋 Mathlib.Algebra.Group.Shrink
{M : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [AddMonoid M] [AddAction M α] : AddAction M (Shrink.{v, u_2} α) - Shrink.instIsCancelAdd 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] [IsCancelAdd α] : IsCancelAdd (Shrink.{v, u_2} α) - Shrink.instIsCancelMul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] [IsCancelMul α] : IsCancelMul (Shrink.{v, u_2} α) - Shrink.instIsLeftCancelAdd 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] [IsLeftCancelAdd α] : IsLeftCancelAdd (Shrink.{v, u_2} α) - Shrink.instIsLeftCancelMul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] [IsLeftCancelMul α] : IsLeftCancelMul (Shrink.{v, u_2} α) - Shrink.instIsRightCancelAdd 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] [IsRightCancelAdd α] : IsRightCancelAdd (Shrink.{v, u_2} α) - Shrink.instIsRightCancelMul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] [IsRightCancelMul α] : IsRightCancelMul (Shrink.{v, u_2} α) - Shrink.instMulAction 📋 Mathlib.Algebra.Group.Shrink
{M : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [Monoid M] [MulAction M α] : MulAction M (Shrink.{v, u_2} α) - equivShrink_symm_one 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [One α] : (equivShrink α).symm 1 = 1 - equivShrink_symm_zero 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Zero α] : (equivShrink α).symm 0 = 0 - equivShrink_inv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Inv α] (x : α) : (equivShrink α) x⁻¹ = ((equivShrink α) x)⁻¹ - equivShrink_neg 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Neg α] (x : α) : (equivShrink α) (-x) = -(equivShrink α) x - equivShrink_symm_inv 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Inv α] (x : Shrink.{v, u_2} α) : (equivShrink α).symm x⁻¹ = ((equivShrink α).symm x)⁻¹ - equivShrink_symm_neg 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Neg α] (x : Shrink.{v, u_2} α) : (equivShrink α).symm (-x) = -(equivShrink α).symm x - Shrink.addEquiv_apply 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] (a✝ : Shrink.{v, u_2} α) : Shrink.addEquiv a✝ = (equivShrink α).symm a✝ - Shrink.mulEquiv_apply 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] (a✝ : Shrink.{v, u_2} α) : Shrink.mulEquiv a✝ = (equivShrink α).symm a✝ - Shrink.addEquiv_symm_apply 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] (a✝ : α) : Shrink.addEquiv.symm a✝ = (equivShrink α) a✝ - Shrink.mulEquiv_symm_apply 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] (a✝ : α) : Shrink.mulEquiv.symm a✝ = (equivShrink α) a✝ - equivShrink_smul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] {M : Type u_3} [SMul M α] (m : M) (x : α) : (equivShrink α) (m • x) = m • (equivShrink α) x - equivShrink_symm_smul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] {M : Type u_3} [SMul M α] (m : M) (x : Shrink.{v, u_2} α) : (equivShrink α).symm (m • x) = m • (equivShrink α).symm x - equivShrink_add 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] (x y : α) : (equivShrink α) (x + y) = (equivShrink α) x + (equivShrink α) y - equivShrink_div 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Div α] (x y : α) : (equivShrink α) (x / y) = (equivShrink α) x / (equivShrink α) y - equivShrink_mul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] (x y : α) : (equivShrink α) (x * y) = (equivShrink α) x * (equivShrink α) y - equivShrink_sub 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Sub α] (x y : α) : (equivShrink α) (x - y) = (equivShrink α) x - (equivShrink α) y - equivShrink_symm_add 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Add α] (x y : Shrink.{v, u_2} α) : (equivShrink α).symm (x + y) = (equivShrink α).symm x + (equivShrink α).symm y - equivShrink_symm_div 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Div α] (x y : Shrink.{v, u_2} α) : (equivShrink α).symm (x / y) = (equivShrink α).symm x / (equivShrink α).symm y - equivShrink_symm_mul 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Mul α] (x y : Shrink.{v, u_2} α) : (equivShrink α).symm (x * y) = (equivShrink α).symm x * (equivShrink α).symm y - equivShrink_symm_sub 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [Sub α] (x y : Shrink.{v, u_2} α) : (equivShrink α).symm (x - y) = (equivShrink α).symm x - (equivShrink α).symm y - Shrink.instModule 📋 Mathlib.Algebra.Module.Shrink
{R : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [Semiring R] [AddCommMonoid α] [Module R α] : Module R (Shrink.{v, u_2} α) - Shrink.linearEquiv 📋 Mathlib.Algebra.Module.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [Semiring R] [AddCommMonoid α] [Module R α] : Shrink.{v, u_2} α ≃ₗ[R] α - Shrink.linearEquiv_apply 📋 Mathlib.Algebra.Module.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [Semiring R] [AddCommMonoid α] [Module R α] (a✝ : Shrink.{v, u_2} α) : (Shrink.linearEquiv R α) a✝ = (equivShrink α).symm a✝ - Shrink.linearEquiv_symm_apply 📋 Mathlib.Algebra.Module.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [Semiring R] [AddCommMonoid α] [Module R α] (a✝ : α) : (Shrink.linearEquiv R α).symm a✝ = (equivShrink α) a✝ - Module.Finite.shrink 📋 Mathlib.RingTheory.Finiteness.Basic
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] [Module.Finite R M] [Small.{u, u_3} M] : Module.Finite R (Shrink.{u, u_3} M) - Module.Finite.Module.finite_shrink 📋 Mathlib.RingTheory.Finiteness.Basic
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] [Module.Finite R M] [Small.{u, u_3} M] : Module.Finite R (Shrink.{u, u_3} M) - instBotShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Bot α] : Bot (Shrink.{u, u_1} α) - instLinearOrderShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [LinearOrder α] : LinearOrder (Shrink.{u, u_1} α) - instPartialOrderShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [PartialOrder α] : PartialOrder (Shrink.{u, u_1} α) - instPreorderShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] : Preorder (Shrink.{u, u_1} α) - instTopShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Top α] : Top (Shrink.{u, u_1} α) - instPredOrderShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [PredOrder α] : PredOrder (Shrink.{u, u_1} α) - instSuccOrderShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [SuccOrder α] : SuccOrder (Shrink.{u, u_1} α) - orderIsoShrink 📋 Mathlib.Order.Shrink
(α : Type u_1) [Small.{u, u_1} α] [Preorder α] : α ≃o Shrink.{u, u_1} α - instOrderBotShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [OrderBot α] : OrderBot (Shrink.{u, u_1} α) - instOrderTopShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [OrderTop α] : OrderTop (Shrink.{u, u_1} α) - instWellFoundedGTShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [WellFoundedGT α] : WellFoundedGT (Shrink.{u, u_1} α) - instWellFoundedLTShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] [WellFoundedLT α] : WellFoundedLT (Shrink.{u, u_1} α) - equivShrink_bot 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Bot α] : (equivShrink α) ⊥ = ⊥ - equivShrink_top 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Top α] : (equivShrink α) ⊤ = ⊤ - equivShrink_symm_bot 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Bot α] : (equivShrink α).symm ⊥ = ⊥ - equivShrink_symm_top 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Top α] : (equivShrink α).symm ⊤ = ⊤ - orderIsoShrink_apply 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] (a : α) : (orderIsoShrink α) a = (equivShrink α) a - equivShrink_le_equivShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] {x y : α} : (equivShrink α) x ≤ (equivShrink α) y ↔ x ≤ y - equivShrink_lt_equivShrink 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] {x y : α} : (equivShrink α) x < (equivShrink α) y ↔ x < y - orderIsoShrink_symm_apply 📋 Mathlib.Order.Shrink
{α : Type u_1} [Small.{u, u_1} α] [Preorder α] (a : Shrink.{u, u_1} α) : (orderIsoShrink α).symm a = (equivShrink α).symm a - Module.Free.shrink 📋 Mathlib.LinearAlgebra.FreeModule.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [Module.Free R M] [Small.{w, v} M] : Module.Free R (Shrink.{w, v} M) - Module.Free.Module.free_shrink 📋 Mathlib.LinearAlgebra.FreeModule.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [Module.Free R M] [Small.{w, v} M] : Module.Free R (Shrink.{w, v} M) - Module.instProjectiveShrink 📋 Mathlib.Algebra.Module.Projective
{R : Type u_1} [Semiring R] {M : Type u_3} [AddCommMonoid M] [Module R M] [Small.{w, u_3} M] [Module.Projective R M] : Module.Projective R (Shrink.{w, u_3} M) - Module.Projective.of_shrink 📋 Mathlib.Algebra.Module.Projective
{R : Type u_1} [Semiring R] {M : Type u_3} [AddCommMonoid M] [Module R M] [Small.{w, u_3} M] [Module.Projective R (Shrink.{w, u_3} M)] : Module.Projective R M - Shrink.instAddGroupWithOne 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [AddGroupWithOne α] : AddGroupWithOne (Shrink.{v, u_1} α) - Shrink.instAddMonoidWithOne 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [AddMonoidWithOne α] : AddMonoidWithOne (Shrink.{v, u_1} α) - Shrink.instCommRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [CommRing α] : CommRing (Shrink.{v, u_1} α) - Shrink.instCommSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [CommSemiring α] : CommSemiring (Shrink.{v, u_1} α) - Shrink.instNonAssocRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonAssocRing α] : NonAssocRing (Shrink.{v, u_1} α) - Shrink.instNonAssocSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonAssocSemiring α] : NonAssocSemiring (Shrink.{v, u_1} α) - Shrink.instNonUnitalCommRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalCommRing α] : NonUnitalCommRing (Shrink.{v, u_1} α) - Shrink.instNonUnitalCommSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalCommSemiring α] : NonUnitalCommSemiring (Shrink.{v, u_1} α) - Shrink.instNonUnitalNonAssocRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalNonAssocRing α] : NonUnitalNonAssocRing (Shrink.{v, u_1} α) - Shrink.instNonUnitalNonAssocSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalNonAssocSemiring α] : NonUnitalNonAssocSemiring (Shrink.{v, u_1} α) - Shrink.instNonUnitalRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalRing α] : NonUnitalRing (Shrink.{v, u_1} α) - Shrink.instNonUnitalSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NonUnitalSemiring α] : NonUnitalSemiring (Shrink.{v, u_1} α) - Shrink.instRing 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [Ring α] : Ring (Shrink.{v, u_1} α) - Shrink.instSemiring 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [Semiring α] : Semiring (Shrink.{v, u_1} α) - Shrink.instIsDomain 📋 Mathlib.Algebra.Ring.Shrink
{α : Type u_1} [Small.{v, u_1} α] [Semiring α] [IsDomain α] : IsDomain (Shrink.{v, u_1} α) - Shrink.ringEquiv 📋 Mathlib.Algebra.Ring.Shrink
(α : Type u_1) [Small.{v, u_1} α] [Add α] [Mul α] : Shrink.{v, u_1} α ≃+* α - Shrink.instAlgebra 📋 Mathlib.Algebra.Algebra.Shrink
{R : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [CommSemiring R] [Semiring α] [Algebra R α] : Algebra R (Shrink.{v, u_2} α) - Shrink.algEquiv 📋 Mathlib.Algebra.Algebra.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [CommSemiring R] [Semiring α] [Algebra R α] : Shrink.{v, u_2} α ≃ₐ[R] α - Shrink.algEquiv_apply 📋 Mathlib.Algebra.Algebra.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [CommSemiring R] [Semiring α] [Algebra R α] (a✝ : Shrink.{v, u_2} α) : (Shrink.algEquiv R α) a✝ = (equivShrink α).symm a✝ - Shrink.algEquiv_symm_apply 📋 Mathlib.Algebra.Algebra.Shrink
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [CommSemiring R] [Semiring α] [Algebra R α] (a✝ : α) : (Shrink.algEquiv R α).symm a✝ = (equivShrink α) a✝ - Module.Flat.of_shrink 📋 Mathlib.RingTheory.Flat.Basic
{R : Type u} {M : Type v} [CommSemiring R] [AddCommMonoid M] [Module R M] [Small.{v', v} M] [Module.Flat R (Shrink.{v', v} M)] : Module.Flat R M - Module.Flat.shrink 📋 Mathlib.RingTheory.Flat.Basic
{R : Type u} {M : Type v} [CommSemiring R] [AddCommMonoid M] [Module R M] [Small.{v', v} M] [Module.Flat R M] : Module.Flat R (Shrink.{v', v} M) - CategoryTheory.Shrink.instCategoryShrink 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] : CategoryTheory.Category.{v, w} (Shrink.{w, u} C) - CategoryTheory.Shrink.equivalence 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] : C ≌ Shrink.{w, u} C - CategoryTheory.Shrink.instLocallySmallShrink 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w', u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, w'} (Shrink.{w', u} C) - CategoryTheory.ShrinkHoms.functor_map 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : (CategoryTheory.ShrinkHoms.functor C).map f = (equivShrink (X ⟶ Y)) f - CategoryTheory.ShrinkHoms.id_def 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : CategoryTheory.ShrinkHoms.{u} C) : CategoryTheory.CategoryStruct.id X = (equivShrink (X.fromShrinkHoms ⟶ X.fromShrinkHoms)) (CategoryTheory.CategoryStruct.id X.fromShrinkHoms) - CategoryTheory.ShrinkHoms.inverse_map 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : CategoryTheory.ShrinkHoms.{u} C} (f : X ⟶ Y) : (CategoryTheory.ShrinkHoms.inverse C).map f = (equivShrink (X.fromShrinkHoms ⟶ Y.fromShrinkHoms)).symm f - CategoryTheory.ShrinkHoms.comp_def 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X✝ Y✝ Z✝ : CategoryTheory.ShrinkHoms.{u} C} (f : Shrink.{w, v} (X✝.fromShrinkHoms ⟶ Y✝.fromShrinkHoms)) (g : Shrink.{w, v} (Y✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)) : CategoryTheory.CategoryStruct.comp f g = (equivShrink (X✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)) (CategoryTheory.CategoryStruct.comp ((equivShrink (X✝.fromShrinkHoms ⟶ Y✝.fromShrinkHoms)).symm f) ((equivShrink (Y✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)).symm g)) - CategoryTheory.Limits.Types.Small.limitCone_pt 📋 Mathlib.CategoryTheory.Limits.Types.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J (Type u)) [Small.{u, max u v} ↑F.sections] : (CategoryTheory.Limits.Types.Small.limitCone F).pt = Shrink.{u, max u v} ↑F.sections - CategoryTheory.Limits.Types.Small.limitCone_π_app 📋 Mathlib.CategoryTheory.Limits.Types.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J (Type u)) [Small.{u, max u v} ↑F.sections] (j : J) : (CategoryTheory.Limits.Types.Small.limitCone F).π.app j = TypeCat.ofHom fun u => ↑((equivShrink ↑F.sections).symm u) j - CategoryTheory.Limits.Types.Small.limitCone_pt_ext 📋 Mathlib.CategoryTheory.Limits.Types.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J (Type u)) [Small.{u, max u v} ↑F.sections] {x y : (CategoryTheory.Limits.Types.Small.limitCone F).pt} (w : (equivShrink ↑F.sections).symm x = (equivShrink ↑F.sections).symm y) : x = y - CategoryTheory.Limits.Types.Small.limitCone_pt_ext_iff 📋 Mathlib.CategoryTheory.Limits.Types.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] {F : CategoryTheory.Functor J (Type u)} [Small.{u, max u v} ↑F.sections] {x y : (CategoryTheory.Limits.Types.Small.limitCone F).pt} : x = y ↔ (equivShrink ↑F.sections).symm x = (equivShrink ↑F.sections).symm y - CategoryTheory.Limits.Types.Small.limitConeIsLimit_lift 📋 Mathlib.CategoryTheory.Limits.Types.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J (Type u)) [Small.{u, max u v} ↑F.sections] (s : CategoryTheory.Limits.Cone F) : (CategoryTheory.Limits.Types.Small.limitConeIsLimit F).lift s = TypeCat.ofHom fun v => (equivShrink ↑F.sections) ⟨fun j => (CategoryTheory.ConcreteCategory.hom (s.π.app j)) v, ⋯⟩ - CategoryTheory.FunctorToTypes.shrink_obj 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w')) [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} F] (X : C) : (CategoryTheory.FunctorToTypes.shrink.{w, w', v, u} F).obj X = Shrink.{w, w'} (F.obj X) - CategoryTheory.FunctorToTypes.shrinkCompUliftFunctorIso_hom_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w')) [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} F] [CategoryTheory.FunctorToTypes.Small.{max w w'', w', v, u} F] (X : C) : (CategoryTheory.FunctorToTypes.shrinkCompUliftFunctorIso F).hom.app X = ((Equiv.ulift.trans (equivShrink (F.obj X)).symm).trans (equivShrink (F.obj X))).toIso.hom - CategoryTheory.FunctorToTypes.shrinkCompUliftFunctorIso_inv_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w')) [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} F] [CategoryTheory.FunctorToTypes.Small.{max w w'', w', v, u} F] (X : C) : (CategoryTheory.FunctorToTypes.shrinkCompUliftFunctorIso F).inv.app X = ((Equiv.ulift.trans (equivShrink (F.obj X)).symm).trans (equivShrink (F.obj X))).toIso.inv - CategoryTheory.FunctorToTypes.shrink_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w')) [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} F] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) : (CategoryTheory.FunctorToTypes.shrink.{w, w', v, u} F).map f = TypeCat.ofHom (⇑(equivShrink (F.obj Y✝)) ∘ ⇑(CategoryTheory.ConcreteCategory.hom (F.map f)) ∘ ⇑(equivShrink (F.obj X✝)).symm) - CategoryTheory.FunctorToTypes.shrinkMap_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C (Type w')} (τ : F ⟶ G) [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} F] [CategoryTheory.FunctorToTypes.Small.{w, w', v, u} G] (X : C) : (CategoryTheory.FunctorToTypes.shrinkMap τ).app X = TypeCat.ofHom (⇑(equivShrink (G.obj X)) ∘ ⇑(CategoryTheory.ConcreteCategory.hom (τ.app X)) ∘ ⇑(equivShrink (F.obj X)).symm) - AddCommGrpCat.Colimits.colimitCocone_pt 📋 Mathlib.Algebra.Category.Grp.Colimits
{J : Type u} [CategoryTheory.Category.{v, u} J] (F : CategoryTheory.Functor J AddCommGrpCat) [DecidableEq J] [Small.{w, max w u} (AddCommGrpCat.Colimits.Quot F)] : (AddCommGrpCat.Colimits.colimitCocone F).pt = AddCommGrpCat.of (Shrink.{w, max u w} (AddCommGrpCat.Colimits.Quot F)) - AddCommGrpCat.Colimits.Quot.desc_colimitCocone 📋 Mathlib.Algebra.Category.Grp.Colimits
{J : Type u} [CategoryTheory.Category.{v, u} J] [DecidableEq J] (F : CategoryTheory.Functor J AddCommGrpCat) [Small.{w, max u w} (AddCommGrpCat.Colimits.Quot F)] : AddCommGrpCat.Colimits.Quot.desc F (AddCommGrpCat.Colimits.colimitCocone F) = Shrink.addEquiv.symm.toAddMonoidHom - AddCommGrpCat.Colimits.colimitCocone_ι_app 📋 Mathlib.Algebra.Category.Grp.Colimits
{J : Type u} [CategoryTheory.Category.{v, u} J] (F : CategoryTheory.Functor J AddCommGrpCat) [DecidableEq J] [Small.{w, max w u} (AddCommGrpCat.Colimits.Quot F)] (j : J) : (AddCommGrpCat.Colimits.colimitCocone F).ι.app j = AddCommGrpCat.ofHom (Shrink.addEquiv.symm.toAddMonoidHom.comp (AddCommGrpCat.Colimits.Quot.ι F j)) - CategoryTheory.Limits.Types.Small.productIso 📋 Mathlib.CategoryTheory.Limits.Types.Products
{J : Type v} (F : J → Type u) [Small.{u, v} J] : ∏ᶜ F ≅ Shrink.{u, max u v} ((j : J) → F j) - CategoryTheory.Limits.Types.Small.productIso_inv_comp_π 📋 Mathlib.CategoryTheory.Limits.Types.Products
{J : Type v} (F : J → Type u) [Small.{u, v} J] (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Types.Small.productIso F).inv (CategoryTheory.Limits.Pi.π F j) = TypeCat.ofHom fun f => (equivShrink ((j : J) → F j)).symm f j - CategoryTheory.Limits.Types.Small.productIso_hom_comp_eval 📋 Mathlib.CategoryTheory.Limits.Types.Products
{J : Type v} (F : J → Type u) [Small.{u, v} J] (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.Types.Small.productIso F).hom (TypeCat.ofHom fun f => (equivShrink ((j : J) → F j)).symm f j) = CategoryTheory.Limits.Pi.π F j - CategoryTheory.Limits.Types.Small.productIso_inv_comp_π_apply 📋 Mathlib.CategoryTheory.Limits.Types.Products
{J : Type v} (F : J → Type u) [Small.{u, v} J] (j : J) (x : Shrink.{u, max u v} ((j : J) → F j)) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.Pi.π F j)) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.Types.Small.productIso F).inv) x) = (equivShrink ((j : J) → F j)).symm x j - CategoryTheory.Limits.Types.Small.productIso_hom_comp_eval_apply 📋 Mathlib.CategoryTheory.Limits.Types.Products
{J : Type v} (F : J → Type u) [Small.{u, v} J] (j : J) (x : ∏ᶜ F) : (equivShrink ((j : J) → F j)).symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.Types.Small.productIso F).hom) x) j = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.Pi.π F j)) x - CategoryTheory.Subobject.wideCospan 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Functor (CategoryTheory.Limits.WidePullbackShape ↑(⇑(equivShrink (CategoryTheory.Subobject A)) '' s)) C - CategoryTheory.Subobject.leInfCone 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, f ≤ g) : CategoryTheory.Limits.Cone (CategoryTheory.Subobject.wideCospan s) - CategoryTheory.Subobject.smallCoproductDesc 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] [CategoryTheory.Limits.HasCoproducts C] {A : C} (s : Set (CategoryTheory.Subobject A)) : (∐ fun j => CategoryTheory.Subobject.underlying.obj ((equivShrink (CategoryTheory.Subobject A)).symm ↑j)) ⟶ A - CategoryTheory.Subobject.wideCospan_map_term 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (j : ↑(⇑(equivShrink (CategoryTheory.Subobject A)) '' s)) : (CategoryTheory.Subobject.wideCospan s).map (CategoryTheory.Limits.WidePullbackShape.Hom.term j) = ((equivShrink (CategoryTheory.Subobject A)).symm ↑j).arrow - CategoryTheory.Subobject.leInfCone_π_app_none 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, f ≤ g) : (CategoryTheory.Subobject.leInfCone s f k).π.app none = f.arrow - CategoryTheory.CountableCategory.instLocallySmallObjAsType 📋 Mathlib.CategoryTheory.Countable
(α : Type u) [CategoryTheory.Category.{v, u} α] [CategoryTheory.CountableCategory α] : CategoryTheory.LocallySmall.{0, v, 0} (CategoryTheory.CountableCategory.ObjAsType α) - CategoryTheory.CountableCategory.instObjAsType 📋 Mathlib.CategoryTheory.Countable
(α : Type u) [CategoryTheory.Category.{v, u} α] [CategoryTheory.CountableCategory α] : CategoryTheory.CountableCategory (CategoryTheory.CountableCategory.ObjAsType α) - CategoryTheory.CountableCategory.objAsTypeEquiv 📋 Mathlib.CategoryTheory.Countable
(α : Type u) [CategoryTheory.Category.{v, u} α] [CategoryTheory.CountableCategory α] : CategoryTheory.CountableCategory.ObjAsType α ≌ α - CategoryTheory.CountableCategory.instCountableHomObjAsType 📋 Mathlib.CategoryTheory.Countable
(α : Type u) [CategoryTheory.Category.{v, u} α] [CategoryTheory.CountableCategory α] {i j : CategoryTheory.CountableCategory.ObjAsType α} : Countable (i ⟶ j) - GrpCat.shrinkFunctor_obj_coe 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] (X : C) : ↑((GrpCat.shrinkFunctor.{w, w', v, u} F).obj X) = Shrink.{w, w'} ↑(F.obj X) - GrpCat.shrinkFunctor_map 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] {X Y : C} (f : X ⟶ Y) : (GrpCat.shrinkFunctor.{w, w', v, u} F).map f = GrpCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (GrpCat.Hom.hom (F.map f))).comp Shrink.mulEquiv.toMonoidHom) - GrpCat.shrinkFunctorMap_app 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C GrpCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] (X : C) : (GrpCat.shrinkFunctorMap τ).app X = GrpCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (GrpCat.Hom.hom (τ.app X))).comp Shrink.mulEquiv.toMonoidHom) - ModuleCat.isSeparator 📋 Mathlib.Algebra.Category.ModuleCat.AB
(R : Type u) [Ring R] [Small.{v, u} R] : CategoryTheory.IsSeparator (ModuleCat.of R (Shrink.{v, u} R)) - Shrink.instFinite 📋 Mathlib.Data.Fintype.Shrink
{α : Type u} [Finite α] : Finite (Shrink.{v, u} α) - Shrink.instFintype 📋 Mathlib.Data.Fintype.Shrink
{α : Type u} [Fintype α] : Fintype (Shrink.{v, u} α) - Fintype.card_shrink 📋 Mathlib.Data.Fintype.Shrink
{α : Type u} [Fintype α] [Fintype (Shrink.{v, u} α)] : Fintype.card (Shrink.{v, u} α) = Fintype.card α - ModuleCat.injective_of_subsingleton_ext_quotient_one 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) (h : ∀ (I : Ideal R), Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M 1)) : CategoryTheory.Injective M - ModuleCat.injective_iff_subsingleton_ext_quotient_one 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) : CategoryTheory.Injective M ↔ ∀ (I : Ideal R), Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M 1) - ModuleCat.hasInjectiveDimensionLT_of_quotients 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) (n : ℕ) (h : ∀ (I : Ideal R), Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M n)) : CategoryTheory.HasInjectiveDimensionLT M n - ModuleCat.hasInjectiveDimensionLT_iff_quotients 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) (n : ℕ) : CategoryTheory.HasInjectiveDimensionLT M n ↔ ∀ (I : Ideal R), Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M n) - ModuleCat.hasInjectiveDimensionLE_of_quotients 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) (n : ℕ) (h : ∀ (I : Ideal R), Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M (n + 1))) : CategoryTheory.HasInjectiveDimensionLE M n - ModuleCat.ext_quotient_one_subsingleton_iff 📋 Mathlib.Algebra.Category.ModuleCat.Ext.Baer
{R : Type u} [CommRing R] [Small.{v, u} R] (M : ModuleCat R) (I : Ideal R) : Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M 1) ↔ ∀ (g : ↥I →ₗ[R] ↑M), ∃ g', ∀ (x : R) (mem : x ∈ I), g' x = g ⟨x, mem⟩ - instFreeCarrierX₂ModuleCatProjectiveShortComplex 📋 Mathlib.Algebra.Category.ModuleCat.Ext.DimensionShifting
{R : Type u} [Ring R] [Small.{v, u} R] (M : ModuleCat R) : Module.Free R ↑M.projectiveShortComplex.X₂ - CategoryTheory.Equalizer.Presieve.Arrows.compatible_iff_of_small 📋 Mathlib.CategoryTheory.Sites.EqualizerSheafCondition
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.Functor Cᵒᵖ (Type w)) {B : C} {I : Type t} [Small.{w, t} I] (X : I → C) (π : (i : I) → X i ⟶ B) [(CategoryTheory.Presieve.ofArrows X π).HasPairwisePullbacks] (x : CategoryTheory.Equalizer.Presieve.Arrows.FirstObj P X) : CategoryTheory.Presieve.Arrows.Compatible P π ((equivShrink ((i : I) → P.obj (Opposite.op (X i)))).symm ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.Types.Small.productIso fun i => P.obj (Opposite.op (X i))).hom) x)) ↔ (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Equalizer.Presieve.Arrows.firstMap P X π)) x = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Equalizer.Presieve.Arrows.secondMap P X π)) x - MonCat.shrinkFunctor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] (X : C) : ↑((MonCat.shrinkFunctor.{w, w', v, u} F).obj X) = Shrink.{w, w'} ↑(F.obj X) - MonCat.shrinkFunctor_map 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] {X Y : C} (f : X ⟶ Y) : (MonCat.shrinkFunctor.{w, w', v, u} F).map f = MonCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (MonCat.Hom.hom (F.map f))).comp Shrink.mulEquiv.toMonoidHom) - MonCat.shrinkFunctorMap_app 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C MonCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] (X : C) : (MonCat.shrinkFunctorMap τ).app X = MonCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (MonCat.Hom.hom (τ.app X))).comp Shrink.mulEquiv.toMonoidHom) - CategoryTheory.Arrow.shrinkEquiv 📋 Mathlib.CategoryTheory.Comma.CardinalArrow
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] : CategoryTheory.Arrow (Shrink.{w, u} C) ≃ CategoryTheory.Arrow C - CategoryTheory.hasCardinalLT_arrow_shrink_iff 📋 Mathlib.CategoryTheory.Comma.CardinalArrow
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w', u} C] (κ : Cardinal.{w}) : HasCardinalLT (CategoryTheory.Arrow (Shrink.{w', u} C)) κ ↔ HasCardinalLT (CategoryTheory.Arrow C) κ - Shrink.instDivisionRing 📋 Mathlib.Algebra.Field.Shrink
{α : Type u_1} [Small.{v, u_1} α] [DivisionRing α] : DivisionRing (Shrink.{v, u_1} α) - Shrink.instField 📋 Mathlib.Algebra.Field.Shrink
{α : Type u_1} [Small.{v, u_1} α] [Field α] : Field (Shrink.{v, u_1} α) - Shrink.instNNRatCast 📋 Mathlib.Algebra.Field.Shrink
{α : Type u_1} [Small.{v, u_1} α] [NNRatCast α] : NNRatCast (Shrink.{v, u_1} α) - Shrink.instRatCast 📋 Mathlib.Algebra.Field.Shrink
{α : Type u_1} [Small.{v, u_1} α] [RatCast α] : RatCast (Shrink.{v, u_1} α) - instMulZeroClassShrink 📋 Mathlib.Algebra.GroupWithZero.Shrink
{α : Type u_2} [Small.{v, u_2} α] [MulZeroClass α] : MulZeroClass (Shrink.{v, u_2} α) - instMulZeroOneClassShrink 📋 Mathlib.Algebra.GroupWithZero.Shrink
{α : Type u_2} [Small.{v, u_2} α] [MulZeroOneClass α] : MulZeroOneClass (Shrink.{v, u_2} α) - instSemigroupWithZeroShrink 📋 Mathlib.Algebra.GroupWithZero.Shrink
{α : Type u_2} [Small.{v, u_2} α] [SemigroupWithZero α] : SemigroupWithZero (Shrink.{v, u_2} α) - instDistribMulActionShrink 📋 Mathlib.Algebra.GroupWithZero.Shrink
{M : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [Monoid M] [AddCommMonoid α] [DistribMulAction M α] : DistribMulAction M (Shrink.{v, u_2} α) - Module.IsStablyFree.of_shrink 📋 Mathlib.Algebra.Module.StablyFree.Basic
(R : Type u) [Ring R] (M : Type v) [AddCommGroup M] [Module R M] [Small.{w, v} M] [Module.IsStablyFree R (Shrink.{w, v} M)] : Module.IsStablyFree R M - Module.IsStablyFree.shrink 📋 Mathlib.Algebra.Module.StablyFree.Basic
(R : Type u) [Ring R] (M : Type v) [AddCommGroup M] [Module R M] [Small.{w, v} M] [Module.IsStablyFree R M] : Module.IsStablyFree R (Shrink.{w, v} M) - CommRing.Pic.mk_eq_iff 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} {M : Type v} [CommSemiring R] [AddCommMonoid M] [Module R M] [Module.Invertible R M] {N : CommRing.Pic R} : CommRing.Pic.mk R M = N ↔ Nonempty (M ≃ₗ[R] N.AsModule) - CommRing.Pic.mk.linearEquiv 📋 Mathlib.RingTheory.PicardGroup
(R : Type u) (M : Type v) [CommSemiring R] [AddCommMonoid M] [Module R M] [Module.Invertible R M] : (CommRing.Pic.mk R M).AsModule ≃ₗ[R] M - CommRing.Pic.instFreeAsModuleOfNat 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} [CommSemiring R] : Module.Free R (CommRing.Pic.AsModule 1) - CommRing.Pic.mk_eq_self 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} [CommSemiring R] {M : CommRing.Pic R} : CommRing.Pic.mk R M.AsModule = M - CommRing.Pic.ext_iff 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} [CommSemiring R] {M N : CommRing.Pic R} : M = N ↔ Nonempty (M.AsModule ≃ₗ[R] N.AsModule) - Submodule.unitsToPicEquiv 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} {A : Type u_4} [CommSemiring R] [Semiring A] [Algebra R A] [FaithfulSMul R A] (I : (Submodule R A)ˣ) : ((Submodule.unitsToPic R A) I).AsModule ≃ₗ[R] ↥↑I - CommRing.Pic.mapAlgebra_apply 📋 Mathlib.RingTheory.PicardGroup
(R : Type u) [CommSemiring R] (A : Type u_5) [CommSemiring A] [Algebra R A] (M : CommRing.Pic R) : (CommRing.Pic.mapAlgebra R A) M = CommRing.Pic.mk A (TensorProduct R A M.AsModule) - CommRing.Pic.inv_eq_dual 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} [CommSemiring R] (M : CommRing.Pic R) : M⁻¹ = CommRing.Pic.mk R (Module.Dual R M.AsModule) - CommRing.Pic.mul_eq_tensor 📋 Mathlib.RingTheory.PicardGroup
{R : Type u} [CommSemiring R] (M N : CommRing.Pic R) : M * N = CommRing.Pic.mk R (TensorProduct R M.AsModule N.AsModule) - AlgebraicGeometry.Scheme.IsLocallyDirected.glueDataι_naturality 📋 Mathlib.AlgebraicGeometry.Gluing
{J : Type w} [CategoryTheory.Category.{v, w} J] (F : CategoryTheory.Functor J AlgebraicGeometry.Scheme) [∀ {i j : J} (f : i ⟶ j), AlgebraicGeometry.IsOpenImmersion (F.map f)] [(F.comp AlgebraicGeometry.Scheme.forget).IsLocallyDirected] [Quiver.IsThin J] [Small.{u, w} J] {i j : Shrink.{u, w} J} (f : (equivShrink J).symm i ⟶ (equivShrink J).symm j) : CategoryTheory.CategoryStruct.comp (F.map f) ((AlgebraicGeometry.Scheme.IsLocallyDirected.glueData F).ι j) = (AlgebraicGeometry.Scheme.IsLocallyDirected.glueData F).ι i - Shrink.instNormedAddCommGroup 📋 Mathlib.Analysis.Normed.Module.Shrink
{α : Type u_2} [Small.{v, u_2} α] [NormedAddCommGroup α] : NormedAddCommGroup (Shrink.{v, u_2} α) - Shrink.instSeminormedAddCommGroup 📋 Mathlib.Analysis.Normed.Module.Shrink
{α : Type u_2} [Small.{v, u_2} α] [SeminormedAddCommGroup α] : SeminormedAddCommGroup (Shrink.{v, u_2} α) - Shrink.instNormedSpace 📋 Mathlib.Analysis.Normed.Module.Shrink
{𝕜 : Type u_1} {α : Type u_2} [Small.{v, u_2} α] [NormedField 𝕜] [SeminormedAddCommGroup α] [NormedSpace 𝕜 α] : NormedSpace 𝕜 (Shrink.{v, u_2} α) - Shrink.instTopologicalSpace 📋 Mathlib.Topology.Instances.Shrink
(X : Type u) [TopologicalSpace X] [Small.{v, u} X] : TopologicalSpace (Shrink.{v, u} X) - Shrink.homeomorph 📋 Mathlib.Topology.Instances.Shrink
(X : Type u) [TopologicalSpace X] [Small.{v, u} X] : X ≃ₜ Shrink.{v, u} X - Shrink.toEquiv_homeomorph 📋 Mathlib.Topology.Instances.Shrink
(X : Type u) [TopologicalSpace X] [Small.{v, u} X] : (Shrink.homeomorph X).toEquiv = (equivShrink X).symm.homeomorph.symm - Shrink.continuousLinearEquiv 📋 Mathlib.Topology.Algebra.Module.TransferInstance
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [AddCommMonoid α] [TopologicalSpace α] [Semiring R] [Module R α] : Shrink.{v, u_2} α ≃L[R] α - Shrink.continuousLinearEquiv_apply 📋 Mathlib.Topology.Algebra.Module.TransferInstance
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [AddCommMonoid α] [TopologicalSpace α] [Semiring R] [Module R α] (a✝ : Shrink.{v, u_2} α) : (Shrink.continuousLinearEquiv R α) a✝ = (equivShrink α).symm a✝ - Shrink.continuousLinearEquiv_symm_apply 📋 Mathlib.Topology.Algebra.Module.TransferInstance
(R : Type u_1) (α : Type u_2) [Small.{v, u_2} α] [AddCommMonoid α] [TopologicalSpace α] [Semiring R] [Module R α] (a✝ : α) : (Shrink.continuousLinearEquiv R α).symm a✝ = (equivShrink α) a✝ - ModuleCat.exists_isRegular_tfae 📋 Mathlib.RingTheory.Depth.Rees
{R : Type u} [CommRing R] [Small.{v, u} R] [IsNoetherianRing R] (I : Ideal R) (n : ℕ) (M : ModuleCat R) [Module.Finite R ↑M] (smul_lt : I • ⊤ < ⊤) : [∀ (N : ModuleCat R), Nontrivial ↑N → Module.Finite R ↑N → Module.support R ↑N ⊆ PrimeSpectrum.zeroLocus ↑I → ∀ i < n, Subsingleton (CategoryTheory.Abelian.Ext N M i), ∀ i < n, Subsingleton (CategoryTheory.Abelian.Ext (ModuleCat.of R (Shrink.{v, u} (R ⧸ I))) M i), ∃ N, Nontrivial ↑N ∧ Module.Finite R ↑N ∧ Module.support R ↑N = PrimeSpectrum.zeroLocus ↑I ∧ ∀ i < n, Subsingleton (CategoryTheory.Abelian.Ext N M i), ∃ rs, rs.length = n ∧ (∀ r ∈ rs, r ∈ I) ∧ RingTheory.Sequence.IsRegular (↑M) rs].TFAE
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