Loogle!
Result
Found 1710 declarations mentioning One. Of these, 216 match your pattern(s). Of these, only the first 200 are shown.
- AddOpposite.instOne 📋 Mathlib.Algebra.Opposites
{α : Type u_1} [One α] : One αᵃᵒᵖ - MulOpposite.instOne 📋 Mathlib.Algebra.Opposites
{α : Type u_1} [One α] : One αᵐᵒᵖ - Pi.instOne 📋 Mathlib.Algebra.Notation.Pi.Defs
{ι : Type u_1} {M : ι → Type u_5} [(i : ι) → One (M i)] : One ((i : ι) → M i) - Pi.one_apply 📋 Mathlib.Algebra.Notation.Pi.Defs
{ι : Type u_1} {M : ι → Type u_5} [(i : ι) → One (M i)] (i : ι) : 1 i = 1 - Pi.one_def 📋 Mathlib.Algebra.Notation.Pi.Defs
{ι : Type u_1} {M : ι → Type u_5} [(i : ι) → One (M i)] : 1 = fun x => 1 - Pi.mulSingle 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] (i : ι) (x : M i) (j : ι) : M j - Pi.mulSingle_injective 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] (i : ι) : Function.Injective (Pi.mulSingle i) - Pi.mulSingle_eq_same 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] (i : ι) (x : M i) : Pi.mulSingle i x i = x - Pi.mulSingle_eq_of_ne 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] {i i' : ι} (h : i' ≠ i) (x : M i) : Pi.mulSingle i x i' = 1 - Pi.mulSingle_eq_of_ne' 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] {i i' : ι} (h : i ≠ i') (x : M i) : Pi.mulSingle i x i' = 1 - Pi.mulSingle_inj 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] (i : ι) {x y : M i} : Pi.mulSingle i x = Pi.mulSingle i y ↔ x = y - Pi.mulSingle_one 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] (i : ι) : Pi.mulSingle i 1 = 1 - Pi.mulSingle_eq_one_iff 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] {i : ι} {x : M i} : Pi.mulSingle i x = 1 ↔ x = 1 - Pi.mulSingle_ne_one_iff 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} [(i : ι) → One (M i)] [DecidableEq ι] {i : ι} {x : M i} : Pi.mulSingle i x ≠ 1 ↔ x ≠ 1 - Pi.apply_mulSingle 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} {N : ι → Type u_7} [(i : ι) → One (M i)] [(i : ι) → One (N i)] [DecidableEq ι] (f' : (i : ι) → M i → N i) (hf' : ∀ (i : ι), f' i 1 = 1) (i : ι) (x : M i) (j : ι) : f' j (Pi.mulSingle i x j) = Pi.mulSingle i (f' i x) j - Pi.mulSingle_op 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} {N : ι → Type u_7} [(i : ι) → One (M i)] [(i : ι) → One (N i)] [DecidableEq ι] (op : (i : ι) → M i → N i) (h : ∀ (i : ι), op i 1 = 1) (i : ι) (x : M i) : Pi.mulSingle i (op i x) = fun j => op j (Pi.mulSingle i x j) - Pi.apply_mulSingle₂ 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} {N : ι → Type u_7} {O : ι → Type u_8} [(i : ι) → One (M i)] [(i : ι) → One (N i)] [(i : ι) → One (O i)] [DecidableEq ι] (f' : (i : ι) → M i → N i → O i) (hf' : ∀ (i : ι), f' i 1 1 = 1) (i : ι) (x : M i) (y : N i) (j : ι) : f' j (Pi.mulSingle i x j) (Pi.mulSingle i y j) = Pi.mulSingle i (f' i x y) j - Pi.mulSingle_op₂ 📋 Mathlib.Algebra.Notation.Pi.Basic
{ι : Type u_1} {M : ι → Type u_6} {N : ι → Type u_7} {O : ι → Type u_8} [(i : ι) → One (M i)] [(i : ι) → One (N i)] [(i : ι) → One (O i)] [DecidableEq ι] (op : (i : ι) → M i → N i → O i) (h : ∀ (i : ι), op i 1 1 = 1) (i : ι) (x : M i) (y : N i) : Pi.mulSingle i (op i x y) = fun j => op j (Pi.mulSingle i x j) (Pi.mulSingle i y j) - AddMonoid.End.instOne 📋 Mathlib.Algebra.Group.Hom.Defs
(M : Type u_4) [AddZero M] : One (AddMonoid.End M) - Monoid.End.instOne 📋 Mathlib.Algebra.Group.Hom.Defs
(M : Type u_4) [MulOne M] : One (Monoid.End M) - instOneOneHom 📋 Mathlib.Algebra.Group.Hom.Defs
{M : Type u_4} {N : Type u_5} [One M] [One N] : One (OneHom M N) - instOneMultiplicativeOfZero 📋 Mathlib.Algebra.Group.TypeTags.Basic
{α : Type u} [Zero α] : One (Multiplicative α) - Prod.instOne 📋 Mathlib.Algebra.Notation.Prod
{M : Type u_3} {N : Type u_4} [One M] [One N] : One (M × N) - Units.instOne 📋 Mathlib.Algebra.Group.Units.Defs
{α : Type u} [Monoid α] : One αˣ - Equiv.Perm.instOne 📋 Mathlib.Algebra.Group.End
{α : Type u_4} : One (Equiv.Perm α) - MonoidWithZeroHom.one 📋 Mathlib.Algebra.GroupWithZero.Hom
(M₀ : Type u_7) (N₀ : Type u_8) [MulZeroOneClass M₀] [MulZeroOneClass N₀] [DecidablePred fun x => x = 0] [Nontrivial M₀] [NoZeroDivisors M₀] : One (M₀ →*₀ N₀) - RingHom.instOne 📋 Mathlib.Algebra.Ring.Hom.Defs
{α : Type u_2} {x✝ : NonAssocSemiring α} : One (α →+* α) - Pi.instZeroLEOneClass 📋 Mathlib.Algebra.Order.ZeroLEOne
{ι : Type u_2} {R : ι → Type u_3} [(i : ι) → Zero (R i)] [(i : ι) → One (R i)] [(i : ι) → LE (R i)] [∀ (i : ι), ZeroLEOneClass (R i)] : ZeroLEOneClass ((i : ι) → R i) - Colex.instOne 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [One α] : One (Colex α) - Lex.instOne 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [One α] : One (Lex α) - OrderDual.instOne 📋 Mathlib.Algebra.Order.Group.Synonym
{α : Type u_1} [One α] : One αᵒᵈ - WithOne.instOne 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} : One (WithOne α) - WithZero.one 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [One α] : One (WithZero α) - WithBot.one 📋 Mathlib.Algebra.Order.Monoid.Unbundled.WithTop
{α : Type u} [One α] : One (WithBot α) - WithTop.one 📋 Mathlib.Algebra.Order.Monoid.Unbundled.WithTop
{α : Type u} [One α] : One (WithTop α) - AddConstMap.instOne 📋 Mathlib.Algebra.AddConstMap.Basic
{G : Type u_1} [Add G] {a : G} : One (AddConstMap G G a a) - AddConstEquiv.instOne 📋 Mathlib.Algebra.AddConstMap.Equiv
{G : Type u_1} [Add G] {a : G} : One (AddConstEquiv G G a a) - Set.one 📋 Mathlib.Algebra.Group.Pointwise.Set.Basic
{α : Type u_2} [One α] : One (Set α) - ConjClasses.instOne 📋 Mathlib.Algebra.Group.Conj
{α : Type u} [Monoid α] : One (ConjClasses α) - OneHom.mulSingle 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} (f : I → Type v) [DecidableEq I] [(i : I) → One (f i)] (i : I) : OneHom (f i) ((i : I) → f i) - Pi.mulSingle_mono 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} (i : I) [DecidableEq I] [(i : I) → Preorder (f i)] [(i : I) → One (f i)] : Monotone (Pi.mulSingle i) - Pi.mulSingle_strictMono 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} (i : I) [DecidableEq I] [(i : I) → Preorder (f i)] [(i : I) → One (f i)] : StrictMono (Pi.mulSingle i) - Function.update_one 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} [(i : I) → One (f i)] [DecidableEq I] (i : I) : Function.update 1 i 1 = 1 - OneHom.coe_mulSingle 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} [DecidableEq I] [(i : I) → One (f i)] (i : I) : ⇑(OneHom.mulSingle f i) = Pi.mulSingle i - OneHom.mulSingle_apply 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} [DecidableEq I] [(i : I) → One (f i)] (i : I) (x : f i) : (OneHom.mulSingle f i) x = Pi.mulSingle i x - Pi.mulSingle_inf 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} [DecidableEq I] [(i : I) → SemilatticeInf (f i)] [(i : I) → One (f i)] (i : I) (x y : f i) : Pi.mulSingle i (x ⊓ y) = Pi.mulSingle i x ⊓ Pi.mulSingle i y - Pi.mulSingle_sup 📋 Mathlib.Algebra.Group.Pi.Lemmas
{I : Type u} {f : I → Type v} [DecidableEq I] [(i : I) → SemilatticeSup (f i)] [(i : I) → One (f i)] (i : I) (x y : f i) : Pi.mulSingle i (x ⊔ y) = Pi.mulSingle i x ⊔ Pi.mulSingle i y - Sigma.uncurry_one 📋 Mathlib.Algebra.Group.Pi.Lemmas
{α : Type u_5} {β : α → Type u_6} {γ : (a : α) → β a → Type u_7} [(a : α) → (b : β a) → One (γ a b)] : Sigma.uncurry 1 = 1 - Sigma.uncurry_mulSingle_mulSingle 📋 Mathlib.Algebra.Group.Pi.Lemmas
{α : Type u_5} {β : α → Type u_6} {γ : (a : α) → β a → Type u_7} [DecidableEq α] [(a : α) → DecidableEq (β a)] [(a : α) → (b : β a) → One (γ a b)] (a : α) (b : β a) (x : γ a b) : Sigma.uncurry (Pi.mulSingle a (Pi.mulSingle b x)) = Pi.mulSingle ⟨a, b⟩ x - Sigma.curry_one 📋 Mathlib.Algebra.Group.Pi.Lemmas
{α : Type u_5} {β : α → Type u_6} {γ : (a : α) → β a → Type u_7} [(a : α) → (b : β a) → One (γ a b)] : Sigma.curry 1 = 1 - Sigma.curry_mulSingle 📋 Mathlib.Algebra.Group.Pi.Lemmas
{α : Type u_5} {β : α → Type u_6} {γ : (a : α) → β a → Type u_7} [DecidableEq α] [(a : α) → DecidableEq (β a)] [(a : α) → (b : β a) → One (γ a b)] (i : (a : α) × β a) (x : γ i.fst i.snd) : Sigma.curry (Pi.mulSingle i x) = Pi.mulSingle i.fst (Pi.mulSingle i.snd x) - FreeGroup.instOne 📋 Mathlib.GroupTheory.FreeGroup.Basic
{α : Type u} : One (FreeGroup α) - Con.one 📋 Mathlib.GroupTheory.Congruence.Defs
{M : Type u_1} [Mul M] [One M] (c : Con M) : One c.Quotient - FreeAbelianGroup.one 📋 Mathlib.GroupTheory.FreeAbelianGroup
(α : Type u) [One α] : One (FreeAbelianGroup α) - OreLocalization.instOne 📋 Mathlib.GroupTheory.OreLocalization.Basic
{R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {X : Type u_2} [MulAction R X] [One X] : One (OreLocalization S X) - OrderMonoidHom.instOne 📋 Mathlib.Algebra.Order.Hom.Monoid
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulOneClass α] [MulOneClass β] : One (α →*o β) - Part.instOne 📋 Mathlib.Data.Part
{α : Type u_1} [One α] : One (Part α) - DistribMulActionHom.instZeroId 📋 Mathlib.GroupTheory.GroupAction.Hom
{M : Type u_1} [Monoid M] {A : Type u_4} [AddMonoid A] [DistribMulAction M A] : One (A →+[M] A) - MulDistribMulActionHom.instOneId 📋 Mathlib.GroupTheory.GroupAction.Hom
{M : Type u_1} [Monoid M] {A : Type u_4} [Monoid A] [MulDistribMulAction M A] : One (A →*[M] A) - DomMulAct.instOneOfMulOpposite 📋 Mathlib.GroupTheory.GroupAction.DomAct.Basic
{M : Type u_1} [One Mᵐᵒᵖ] : One Mᵈᵐᵃ - Module.End.instOne 📋 Mathlib.Algebra.Module.LinearMap.End
{R : Type u_1} {M : Type u_4} [Semiring R] [AddCommMonoid M] [Module R M] : One (Module.End R M) - ULift.one 📋 Mathlib.Algebra.Group.ULift
{α : Type u} [One α] : One (ULift.{u_1, u} α) - Associates.instOne 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] : One (Associates M) - Fin.insertNth_one_right 📋 Mathlib.Algebra.Group.Fin.Tuple
{n : ℕ} {α : Fin (n + 1) → Type u_1} [(j : Fin (n + 1)) → One (α j)] (i : Fin (n + 1)) (x : α i) : i.insertNth x 1 = Pi.mulSingle i x - RingCon.instOneQuotient 📋 Mathlib.RingTheory.Congruence.Defs
{R : Type u_1} [Add R] [MulOneClass R] (c : RingCon R) : One c.Quotient - Ideal.Quotient.one 📋 Mathlib.RingTheory.Ideal.Quotient.Defs
{R : Type u} [Ring R] (I : Ideal R) : One (R ⧸ I) - Shrink.instOne 📋 Mathlib.Algebra.Group.Shrink
{α : Type u_2} [Small.{v, u_2} α] [One α] : One (Shrink.{v, u_2} α) - AddMonoidAlgebra.zero 📋 Mathlib.Algebra.MonoidAlgebra.Defs
{R : Type u_1} {M : Type u_4} [Semiring R] [Zero M] : One (AddMonoidAlgebra R M) - MonoidAlgebra.one 📋 Mathlib.Algebra.MonoidAlgebra.Defs
{R : Type u_1} {M : Type u_4} [Semiring R] [One M] : One (MonoidAlgebra R M) - AddChar.instOne 📋 Mathlib.Algebra.Group.AddChar
{A : Type u_1} {M : Type u_3} [AddMonoid A] [Monoid M] : One (AddChar A M) - Finset.one 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [One α] : One (Finset α) - Polynomial.instOne 📋 Mathlib.Algebra.Polynomial.Basic
{R : Type u} [Semiring R] : One (Polynomial R) - NonUnitalAlgHom.instOneId 📋 Mathlib.Algebra.Algebra.NonUnitalHom
{R : Type u} [Monoid R] {A : Type v} [NonUnitalNonAssocSemiring A] [DistribMulAction R A] : One (A →ₙₐ[R] A) - SetSemiring.instOne 📋 Mathlib.Data.Set.Semiring
{α : Type u_1} [One α] : One (SetSemiring α) - Submodule.one 📋 Mathlib.Algebra.Algebra.Operations
{R : Type u} [Semiring R] {A : Type v} [Semiring A] [Module R A] : One (Submodule R A) - Matrix.one 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [Zero α] [One α] : One (Matrix n n α) - Algebra.TensorProduct.instOneTensorProduct 📋 Mathlib.RingTheory.TensorProduct.Basic
{R : Type uR} {A : Type uA} {B : Type uB} [CommSemiring R] [AddCommMonoidWithOne A] [Module R A] [AddCommMonoidWithOne B] [Module R B] : One (TensorProduct R A B) - Unitization.instOne 📋 Mathlib.Algebra.Algebra.Unitization
{R : Type u_1} {A : Type u_2} [One R] [Zero A] : One (Unitization R A) - PreQuasiregular.instOne 📋 Mathlib.Algebra.Algebra.Spectrum.Quasispectrum
{R : Type u_1} [NonUnitalSemiring R] : One (PreQuasiregular R) - FreeAlgebra.Pre.hasOne 📋 Mathlib.Algebra.FreeAlgebra
(R : Type u_1) (X : Type u_2) [CommSemiring R] : One (FreeAlgebra.Pre R X) - FreeAlgebra.instOne 📋 Mathlib.Algebra.FreeAlgebra
(R : Type u_1) (X : Type u_2) [CommSemiring R] : One (FreeAlgebra R X) - Pi.mulSingle_le_mulSingle 📋 Mathlib.Algebra.Order.Pi
{ι : Type u_6} {α : ι → Type u_7} [DecidableEq ι] [(i : ι) → One (α i)] [(i : ι) → Preorder (α i)] {i : ι} {a b : α i} : Pi.mulSingle i a ≤ Pi.mulSingle i b ↔ a ≤ b - Pi.one_lt_mulSingle 📋 Mathlib.Algebra.Order.Pi
{ι : Type u_6} {α : ι → Type u_7} [DecidableEq ι] [(i : ι) → One (α i)] [(i : ι) → Preorder (α i)] {i : ι} {a : α i} : 1 < Pi.mulSingle i a ↔ 1 < a - Pi.mulSingle_le_one 📋 Mathlib.Algebra.Order.Pi
{ι : Type u_6} {α : ι → Type u_7} [DecidableEq ι] [(i : ι) → One (α i)] [(i : ι) → Preorder (α i)] {i : ι} {a : α i} : Pi.mulSingle i a ≤ 1 ↔ a ≤ 1 - Pi.one_le_mulSingle 📋 Mathlib.Algebra.Order.Pi
{ι : Type u_6} {α : ι → Type u_7} [DecidableEq ι] [(i : ι) → One (α i)] [(i : ι) → Preorder (α i)] {i : ι} {a : α i} : 1 ≤ Pi.mulSingle i a ↔ 1 ≤ a - DirectLimit.instOne 📋 Mathlib.Algebra.Colimit.DirectLimit
{ι : Type u_2} [Preorder ι] {G : ι → Type u_3} {T : ⦃i j : ι⦄ → i ≤ j → Type u_6} {f : (x x_1 : ι) → (h : x ≤ x_1) → T h} [(i j : ι) → (h : i ≤ j) → FunLike (T h) (G i) (G j)] [DirectedSystem G fun x1 x2 x3 => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] [(i : ι) → One (G i)] : One (DirectLimit G f) - DirectLimit.map₀_one 📋 Mathlib.Algebra.Colimit.DirectLimit
{ι : Type u_2} [Preorder ι] {G : ι → Type u_3} {T : ⦃i j : ι⦄ → i ≤ j → Type u_6} {f : (x x_1 : ι) → (h : x ≤ x_1) → T h} [(i j : ι) → (h : i ≤ j) → FunLike (T h) (G i) (G j)] [DirectedSystem G fun x1 x2 x3 => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] [(i : ι) → One (G i)] [∀ (i j : ι) (h : i ≤ j), OneHomClass (T h) (G i) (G j)] : DirectLimit.map₀ f 1 = 1 - DirectLimit.one_def 📋 Mathlib.Algebra.Colimit.DirectLimit
{ι : Type u_2} [Preorder ι] {G : ι → Type u_3} {T : ⦃i j : ι⦄ → i ≤ j → Type u_6} {f : (x x_1 : ι) → (h : x ≤ x_1) → T h} [(i j : ι) → (h : i ≤ j) → FunLike (T h) (G i) (G j)] [DirectedSystem G fun x1 x2 x3 => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] [(i : ι) → One (G i)] [∀ (i j : ι) (h : i ≤ j), OneHomClass (T h) (G i) (G j)] (i : ι) : 1 = ⟦⟨i, 1⟩⟧ - DirectLimit.lift_one 📋 Mathlib.Algebra.Colimit.DirectLimit
{ι : Type u_2} [Preorder ι] {G : ι → Type u_3} {H : ι → Type u_4} {C : Type u_5} {T : ⦃i j : ι⦄ → i ≤ j → Type u_6} {f : (x x_1 : ι) → (h : x ≤ x_1) → T h} [(i j : ι) → (h : i ≤ j) → FunLike (T h) (G i) (G j)] [(i : ι) → FunLike (H i) (G i) C] [DirectedSystem G fun x1 x2 x3 => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] [(i : ι) → One (G i)] [One C] [∀ (i : ι), OneHomClass (H i) (G i) C] [∀ (i j : ι) (h : i ≤ j), OneHomClass (T h) (G i) (G j)] (g : (i : ι) → H i) (h : ∀ (i j : ι) (h : i ≤ j) (x : G i), (g i) x = (g j) ((f i j h) x)) : DirectLimit.lift f (fun x => ⇑(g x)) h 1 = 1 - DirectLimit.exists_eq_one 📋 Mathlib.Algebra.Colimit.DirectLimit
{ι : Type u_2} [Preorder ι] {G : ι → Type u_3} {T : ⦃i j : ι⦄ → i ≤ j → Type u_6} {f : (x x_1 : ι) → (h : x ≤ x_1) → T h} [(i j : ι) → (h : i ≤ j) → FunLike (T h) (G i) (G j)] [DirectedSystem G fun x1 x2 x3 => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] [(i : ι) → One (G i)] [∀ (i j : ι) (h : i ≤ j), OneHomClass (T h) (G i) (G j)] (x : (i : ι) × G i) : ⟦x⟧ = 1 ↔ ∃ i, ∃ (h : x.fst ≤ i), (f x.fst i h) x.snd = 1 - MonCat.instOneHom 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : MonCat) : One (X ⟶ Y) - CategoryTheory.End.one 📋 Mathlib.CategoryTheory.Endomorphism
{C : Type u} [CategoryTheory.CategoryStruct.{v, u} C] (X : C) : One (CategoryTheory.End X) - CommGrpCat.instOneHom 📋 Mathlib.Algebra.Category.Grp.Basic
(G H : CommGrpCat) : One (G ⟶ H) - GrpCat.instOneHom 📋 Mathlib.Algebra.Category.Grp.Basic
(G H : GrpCat) : One (G ⟶ H) - MonCat.FilteredColimits.colimitOne 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : One (MonCat.FilteredColimits.M F) - TrivSqZeroExt.one 📋 Mathlib.Algebra.TrivSqZeroExt.Basic
{R : Type u} {M : Type v} [One R] [Zero M] : One (TrivSqZeroExt R M) - LinearMap.convOne 📋 Mathlib.RingTheory.Coalgebra.Convolution
{R : Type u_1} {A : Type u_3} {C : Type u_5} [CommSemiring R] [Semiring A] [Algebra R A] [AddCommMonoid C] [Module R C] [Coalgebra R C] : One (WithConv (C →ₗ[R] A)) - AlgHom.instOneWithConv 📋 Mathlib.RingTheory.Bialgebra.Convolution
{R : Type u_1} {A : Type u_2} {C : Type u_4} [CommSemiring R] [CommSemiring A] [Semiring C] [Bialgebra R C] [Algebra R A] : One (WithConv (C →ₐ[R] A)) - BialgHom.instOneWithConv 📋 Mathlib.RingTheory.Bialgebra.Convolution
{R : Type u_1} {A : Type u_2} {C : Type u_4} [CommSemiring R] [CommSemiring A] [Semiring C] [Bialgebra R A] [Bialgebra R C] : One (WithConv (C →ₐc[R] A)) - continuous_mulSingle 📋 Mathlib.Topology.Constructions
{ι : Type u_5} {A : ι → Type u_6} [T : (i : ι) → TopologicalSpace (A i)] [(i : ι) → One (A i)] [DecidableEq ι] (i : ι) : Continuous fun x => Pi.mulSingle i x - SeparationQuotient.instOne 📋 Mathlib.Topology.Inseparable
{X : Type u_1} [TopologicalSpace X] [One X] : One (SeparationQuotient X) - Filter.instOne 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} [One α] : One (Filter α) - ContinuousMonoidHom.instOne 📋 Mathlib.Topology.Algebra.ContinuousMonoidHom
(A : Type u_2) (B : Type u_3) [Monoid A] [Monoid B] [TopologicalSpace A] [TopologicalSpace B] : One (A →ₜ* B) - Set.image_mulSingle_uIcc 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Lattice (α i)] [DecidableEq ι] [(i : ι) → One (α i)] (i : ι) (a b : α i) : Pi.mulSingle i '' Set.uIcc a b = Set.uIcc (Pi.mulSingle i a) (Pi.mulSingle i b) - Set.image_mulSingle_Icc 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a b : α i) : Pi.mulSingle i '' Set.Icc a b = Set.Icc (Pi.mulSingle i a) (Pi.mulSingle i b) - Set.image_mulSingle_Ico 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a b : α i) : Pi.mulSingle i '' Set.Ico a b = Set.Ico (Pi.mulSingle i a) (Pi.mulSingle i b) - Set.image_mulSingle_Ioc 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a b : α i) : Pi.mulSingle i '' Set.Ioc a b = Set.Ioc (Pi.mulSingle i a) (Pi.mulSingle i b) - Set.image_mulSingle_Ioo 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a b : α i) : Pi.mulSingle i '' Set.Ioo a b = Set.Ioo (Pi.mulSingle i a) (Pi.mulSingle i b) - Set.image_mulSingle_uIcc_left 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Lattice (α i)] [DecidableEq ι] [(i : ι) → One (α i)] (i : ι) (a : α i) : Pi.mulSingle i '' Set.uIcc a 1 = Set.uIcc (Pi.mulSingle i a) 1 - Set.image_mulSingle_uIcc_right 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Lattice (α i)] [DecidableEq ι] [(i : ι) → One (α i)] (i : ι) (b : α i) : Pi.mulSingle i '' Set.uIcc 1 b = Set.uIcc 1 (Pi.mulSingle i b) - Set.image_mulSingle_Icc_left 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a : α i) : Pi.mulSingle i '' Set.Icc a 1 = Set.Icc (Pi.mulSingle i a) 1 - Set.image_mulSingle_Icc_right 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (b : α i) : Pi.mulSingle i '' Set.Icc 1 b = Set.Icc 1 (Pi.mulSingle i b) - Set.image_mulSingle_Ico_left 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a : α i) : Pi.mulSingle i '' Set.Ico a 1 = Set.Ico (Pi.mulSingle i a) 1 - Set.image_mulSingle_Ico_right 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (b : α i) : Pi.mulSingle i '' Set.Ico 1 b = Set.Ico 1 (Pi.mulSingle i b) - Set.image_mulSingle_Ioc_left 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a : α i) : Pi.mulSingle i '' Set.Ioc a 1 = Set.Ioc (Pi.mulSingle i a) 1 - Set.image_mulSingle_Ioc_right 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (b : α i) : Pi.mulSingle i '' Set.Ioc 1 b = Set.Ioc 1 (Pi.mulSingle i b) - Set.image_mulSingle_Ioo_left 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (a : α i) : Pi.mulSingle i '' Set.Ioo a 1 = Set.Ioo (Pi.mulSingle i a) 1 - Set.image_mulSingle_Ioo_right 📋 Mathlib.Order.Interval.Set.Pi
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → PartialOrder (α i)] [(i : ι) → One (α i)] (i : ι) (b : α i) : Pi.mulSingle i '' Set.Ioo 1 b = Set.Ioo 1 (Pi.mulSingle i b) - Matrix.SpecialLinearGroup.hasOne 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] : One (Matrix.SpecialLinearGroup n R) - GradedMonoid.GOne.toOne 📋 Mathlib.Algebra.GradedMonoid
{ι : Type u_1} (A : ι → Type u_2) [Zero ι] [GradedMonoid.GOne A] : One (GradedMonoid A) - DirectSum.instOne 📋 Mathlib.Algebra.DirectSum.Ring
{ι : Type u_1} [DecidableEq ι] (A : ι → Type u_2) [Zero ι] [GradedMonoid.GOne A] [(i : ι) → AddCommMonoid (A i)] : One (DirectSum ι fun i => A i) - ContinuousLinearMap.one 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Basic
{R₁ : Type u_1} [Semiring R₁] {M₁ : Type u_4} [TopologicalSpace M₁] [AddCommMonoid M₁] [Module R₁ M₁] : One (M₁ →L[R₁] M₁) - Ring.instOneDirectLimit 📋 Mathlib.Algebra.Colimit.Ring
{ι : Type u_1} [Preorder ι] (G : ι → Type u_2) [(i : ι) → CommRing (G i)] (f : (i j : ι) → i ≤ j → G i → G j) : One (Ring.DirectLimit G f) - QuaternionAlgebra.instOne 📋 Mathlib.Algebra.Quaternion
{R : Type u_3} {c₁ c₂ c₃ : R} [Zero R] [One R] : One (QuaternionAlgebra R c₁ c₂ c₃) - Expr.instOne 📋 Mathlib.Algebra.Expr
{u : Lean.Level} (α : Q(Type u)) : Q(One «$α») → One Q(«$α») - LieEquiv.instOne 📋 Mathlib.Algebra.Lie.Basic
{R : Type u} {L₁ : Type v} [CommRing R] [LieRing L₁] [LieAlgebra R L₁] : One (L₁ ≃ₗ⁅R⁆ L₁) - LieHom.instOne 📋 Mathlib.Algebra.Lie.Basic
{R : Type u} {L₁ : Type v} [CommRing R] [LieRing L₁] [LieAlgebra R L₁] : One (L₁ →ₗ⁅R⁆ L₁) - LieModuleEquiv.instOne 📋 Mathlib.Algebra.Lie.Basic
{R : Type u} {L : Type v} {M : Type w} [CommRing R] [LieRing L] [AddCommGroup M] [Module R M] [LieRingModule L M] : One (M ≃ₗ⁅R,L⁆ M) - LieModuleHom.instOne 📋 Mathlib.Algebra.Lie.Basic
{R : Type u} {L : Type v} {M : Type w} [CommRing R] [LieRing L] [AddCommGroup M] [Module R M] [LieRingModule L M] : One (M →ₗ⁅R,L⁆ M) - Valuation.one 📋 Mathlib.RingTheory.Valuation.Basic
(R : Type u_3) (Γ₀ : Type u_4) [Ring R] [LinearOrderedCommMonoidWithZero Γ₀] [Nontrivial R] [NoZeroDivisors R] [DecidablePred fun x => x = 0] : One (Valuation R Γ₀) - ValuationRing.instOneValueGroup 📋 Mathlib.RingTheory.Valuation.ValuationRing
(A : Type u) [CommRing A] (K : Type v) [Field K] [Algebra A K] : One (ValuationRing.ValueGroup A K) - CauSeq.instOne 📋 Mathlib.Algebra.Order.CauSeq.Basic
{α : Type u_1} {β : Type u_2} [Field α] [LinearOrder α] [IsStrictOrderedRing α] [Ring β] {abv : β → α} [IsAbsoluteValue abv] : One (CauSeq β abv) - CauSeq.Completion.instOneCauchy 📋 Mathlib.Algebra.Order.CauSeq.Completion
{α : Type u_1} [Field α] [LinearOrder α] [IsStrictOrderedRing α] {β : Type u_2} [Ring β] {abv : β → α} [IsAbsoluteValue abv] : One (CauSeq.Completion.Cauchy abv) - FractionalIdeal.instOne 📋 Mathlib.RingTheory.FractionalIdeal.Basic
{R : Type u_1} [CommRing R] {S : Submonoid R} {P : Type u_2} [CommRing P] [Algebra R P] : One (FractionalIdeal S P) - AddGroupNorm.instOne 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [AddGroup E] [DecidableEq E] : One (AddGroupNorm E) - AddGroupNorm.toOne 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [AddGroup E] [DecidableEq E] : One (AddGroupNorm E) - AddGroupSeminorm.toOne 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [AddGroup E] [DecidableEq E] : One (AddGroupSeminorm E) - GroupNorm.toOne 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [Group E] [DecidableEq E] : One (GroupNorm E) - GroupSeminorm.toOne 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [Group E] [DecidableEq E] : One (GroupSeminorm E) - NonarchAddGroupNorm.instOneOfDecidableEq 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [AddGroup E] [DecidableEq E] : One (NonarchAddGroupNorm E) - NonarchAddGroupSeminorm.instOneOfDecidableEq 📋 Mathlib.Analysis.Normed.Group.Seminorm
{E : Type u_3} [AddGroup E] [DecidableEq E] : One (NonarchAddGroupSeminorm E) - Pi.normOneClass 📋 Mathlib.Analysis.Normed.Ring.Basic
{ι : Type u_5} {α : ι → Type u_6} [Nonempty ι] [Fintype ι] [(i : ι) → SeminormedAddCommGroup (α i)] [(i : ι) → One (α i)] [∀ (i : ι), NormOneClass (α i)] : NormOneClass ((i : ι) → α i) - ContinuousAlgHom.instOne 📋 Mathlib.Topology.Algebra.Algebra
(R : Type u_1) [CommSemiring R] (A : Type u_2) [Semiring A] [TopologicalSpace A] [Algebra R A] : One (A →A[R] A) - MeasureTheory.SimpleFunc.instOne 📋 Mathlib.MeasureTheory.Function.SimpleFunc
{α : Type u_1} {β : Type u_2} [MeasurableSpace α] [One β] : One (MeasureTheory.SimpleFunc α β) - instOneUniformFun 📋 Mathlib.Topology.Algebra.UniformConvergence
{α : Type u_1} {β : Type u_2} [One β] : One (UniformFun α β) - instOneUniformOnFun 📋 Mathlib.Topology.Algebra.UniformConvergence
{α : Type u_1} {β : Type u_2} {𝔖 : Set (Set α)} [One β] : One (UniformOnFun α β 𝔖) - Filter.Germ.instOne 📋 Mathlib.Order.Filter.Germ.Basic
{α : Type u_1} {l : Filter α} {M : Type u_5} [One M] : One (l.Germ M) - ContinuousMap.instOne 📋 Mathlib.Topology.ContinuousMap.Algebra
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] [One β] : One C(α, β) - MeasureTheory.AEEqFun.instOne 📋 Mathlib.MeasureTheory.Function.AEEqFun
{α : Type u_1} {β : Type u_2} [MeasurableSpace α] {μ : MeasureTheory.Measure α} [TopologicalSpace β] [One β] : One (α →ₘ[μ] β) - BoundedContinuousFunction.instOne 📋 Mathlib.Topology.ContinuousMap.Bounded.Basic
{α : Type u} {β : Type v} [TopologicalSpace α] [PseudoMetricSpace β] [One β] : One (BoundedContinuousFunction α β) - ArithmeticFunction.one 📋 Mathlib.NumberTheory.ArithmeticFunction.Defs
{R : Type u_1} [Zero R] [One R] : One (ArithmeticFunction R) - OrderHom.instOne 📋 Mathlib.Algebra.Order.Group.End
{α : Type u_1} [Preorder α] : One (α →o α) - HahnSeries.instOne 📋 Mathlib.RingTheory.HahnSeries.Multiplication
{Γ : Type u_1} {R : Type u_3} [Zero Γ] [PartialOrder Γ] [Zero R] [One R] : One (HahnSeries Γ R) - QuadraticAlgebra.instOne 📋 Mathlib.Algebra.QuadraticAlgebra.Defs
{R : Type u_1} {a b : R} [Zero R] [One R] : One (QuadraticAlgebra R a b) - CentroidHom.instOne 📋 Mathlib.Algebra.Ring.CentroidHom
{α : Type u_5} [NonUnitalNonAssocSemiring α] : One (CentroidHom α) - RingQuot.instOne 📋 Mathlib.Algebra.RingQuot
{R : Type uR} [Semiring R] (r : R → R → Prop) : One (RingQuot r) - SymAlg.instOne 📋 Mathlib.Algebra.Symmetrized
{α : Type u_1} [One α] : One αˢʸᵐ - Tropical.instOneTropical 📋 Mathlib.Algebra.Tropical.Basic
{R : Type u} [Zero R] : One (Tropical R) - TopCat.instOneHomObjTopCommRingCatForget₂SubtypeRingHomαContinuousCoeContinuousMapCarrier 📋 Mathlib.Topology.Sheaves.CommRingCat
(X : TopCat) (R : TopCommRingCat) : One (X ⟶ (CategoryTheory.forget₂ TopCommRingCat TopCat).obj R) - AlgebraicGeometry.Scheme.IdealSheafData.instOne 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : One X.IdealSheafData - WeierstrassCurve.VariableChange.instOne 📋 Mathlib.AlgebraicGeometry.EllipticCurve.VariableChange
{R : Type u} [CommRing R] : One (WeierstrassCurve.VariableChange R) - ValuativeRel.instOneValueGroupWithZero 📋 Mathlib.RingTheory.Valuation.ValuativeRel.Basic
{R : Type u_1} [Semiring R] [ValuativeRel R] : One (ValuativeRel.ValueGroupWithZero R) - UniformSpace.Completion.one 📋 Mathlib.Topology.Algebra.UniformRing
(α : Type u_1) [Ring α] [UniformSpace α] : One (UniformSpace.Completion α) - WithVal.instOne 📋 Mathlib.Topology.Algebra.Valued.WithVal
{R : Type u_1} {Γ₀ : Type u_2} [LinearOrderedCommGroupWithZero Γ₀] [Ring R] (v : Valuation R Γ₀) : One (WithVal v) - MvPowerSeries.instOne 📋 Mathlib.RingTheory.MvPowerSeries.Basic
{σ : Type u_1} {R : Type u_2} [Semiring R] : One (MvPowerSeries σ R) - RatFunc.instOne 📋 Mathlib.FieldTheory.RatFunc.Basic
{K : Type u} [CommRing K] : One (RatFunc K) - GradedRingHom.instOne 📋 Mathlib.RingTheory.GradedAlgebra.RingHom
{ι : Type u_1} {A : Type u_2} {σ : Type u_6} [Semiring A] [SetLike σ A] {𝒜 : ι → σ} : One (𝒜 →+*ᵍ 𝒜) - HomogeneousLocalization.NumDenSameDeg.instOne 📋 Mathlib.RingTheory.GradedAlgebra.HomogeneousLocalization
{ι : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing A] [SetLike σ A] [AddSubmonoidClass σ A] {𝒜 : ι → σ} (x : Submonoid A) [AddCommMonoid ι] [DecidableEq ι] [GradedRing 𝒜] : One (HomogeneousLocalization.NumDenSameDeg 𝒜 x) - HomogeneousLocalization.instOne 📋 Mathlib.RingTheory.GradedAlgebra.HomogeneousLocalization
{ι : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing A] [SetLike σ A] [AddSubgroupClass σ A] [AddCommMonoid ι] [DecidableEq ι] {𝒜 : ι → σ} [GradedRing 𝒜] (x : Submonoid A) : One (HomogeneousLocalization 𝒜 x) - instOnePadic 📋 Mathlib.NumberTheory.Padics.PadicNumbers
(p : ℕ) [Fact (Nat.Prime p)] : One ℚ_[p] - CStarMatrix.instOne 📋 Mathlib.Analysis.CStarAlgebra.CStarMatrix
{n : Type u_2} {A : Type u_5} [DecidableEq n] [Zero A] [One A] : One (CStarMatrix n n A) - DoubleCentralizer.instOne 📋 Mathlib.Analysis.CStarAlgebra.Multiplier
{𝕜 : Type u_1} {A : Type u_2} [NontriviallyNormedField 𝕜] [NonUnitalNormedRing A] [NormedSpace 𝕜 A] [SMulCommClass 𝕜 A A] [IsScalarTower 𝕜 A A] : One (DoubleCentralizer 𝕜 A) - instOneContMDiffMonoidMorphism 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_2} [TopologicalSpace H] {E : Type u_3} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_4} [Monoid G] [TopologicalSpace G] [ChartedSpace H G] {H' : Type u_5} [TopologicalSpace H'] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {I' : ModelWithCorners 𝕜 E' H'} {G' : Type u_7} [Monoid G'] [TopologicalSpace G'] [ChartedSpace H' G'] : One (ContMDiffMonoidMorphism I I' n G G') - MulChar.hasOne 📋 Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : One (MulChar R R') - MulRingNorm.instOne 📋 Mathlib.Analysis.Normed.Unbundled.RingSeminorm
(R : Type u_1) [NonAssocRing R] [DecidableEq R] [NoZeroDivisors R] [Nontrivial R] : One (MulRingNorm R) - MulRingSeminorm.instOne 📋 Mathlib.Analysis.Normed.Unbundled.RingSeminorm
{R : Type u_1} [NonAssocRing R] [DecidableEq R] [NoZeroDivisors R] [Nontrivial R] : One (MulRingSeminorm R) - SemidirectProduct.instOne 📋 Mathlib.GroupTheory.SemidirectProduct
{N : Type u_1} {G : Type u_2} [Group N] [Group G] {φ : G →* MulAut N} : One (N ⋊[φ] G) - CategoryTheory.Conv.instOne 📋 Mathlib.CategoryTheory.Monoidal.Conv
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.MonoidalCategory C] {M N : C} [CategoryTheory.ComonObj M] [CategoryTheory.MonObj N] : One (CategoryTheory.Conv M N) - CategoryTheory.PresheafOfGroups.instOneH1 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} : One (CategoryTheory.PresheafOfGroups.H1 G U) - CategoryTheory.PresheafOfGroups.OneCochain.instOne 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) : One (CategoryTheory.PresheafOfGroups.OneCochain G U) - CategoryTheory.PresheafOfGroups.OneCocycle.instOne 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) : One (CategoryTheory.PresheafOfGroups.OneCocycle G U) - Language.instOne 📋 Mathlib.Computability.Language
{α : Type u_1} : One (Language α) - εNFA.instOne 📋 Mathlib.Computability.EpsilonNFA
{α : Type u} {σ : Type v} : One (εNFA α σ) - RegularExpression.instOne 📋 Mathlib.Computability.RegularExpressions
{α : Type u_1} : One (RegularExpression α) - LocallyConstant.instOne 📋 Mathlib.Topology.LocallyConstant.Algebra
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [One Y] : One (LocallyConstant X Y) - FirstOrder.Ring.instOneTermRing 📋 Mathlib.ModelTheory.Algebra.Ring.Basic
(α : Type u_2) : One (FirstOrder.Language.ring.Term α) - ContMDiffMap.instOne 📋 Mathlib.Geometry.Manifold.Algebra.SmoothFunctions
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {E' : Type u_3} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H : Type u_4} [TopologicalSpace H] {I : ModelWithCorners 𝕜 E H} {H' : Type u_5} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {N : Type u_6} [TopologicalSpace N] [ChartedSpace H N] {n : WithTop ℕ∞} {G : Type u_10} [One G] [TopologicalSpace G] [ChartedSpace H' G] : One (ContMDiffMap I I' N G n) - instOneTangentSpaceRealModelWithCornersSelf 📋 Mathlib.Geometry.Manifold.Instances.Icc
(x : ℝ) : One (TangentSpace (modelWithCornersSelf ℝ ℝ) x) - instOneTangentSpaceRealEuclideanSpaceFinOfNatNatEuclideanHalfSpaceModelWithCornersEuclideanHalfSpaceElemIcc 📋 Mathlib.Geometry.Manifold.Instances.Icc
{x y : ℝ} [h : Fact (x < y)] (z : ↑(Set.Icc x y)) : One (TangentSpace (modelWithCornersEuclideanHalfSpace 1) z) - Monoid.PushoutI.one 📋 Mathlib.GroupTheory.PushoutI
{ι : Type u_1} {G : ι → Type u_2} {H : Type u_3} [(i : ι) → Monoid (G i)] [Monoid H] {φ : (i : ι) → H →* G i} : One (Monoid.PushoutI φ) - RegularWreathProduct.instOne 📋 Mathlib.GroupTheory.RegularWreathProduct
{D : Type u_1} {Q : Type u_2} [Group D] [Group Q] : One (D ≀ᵣ Q) - instOneWithConvMatrix 📋 Mathlib.LinearAlgebra.Matrix.WithConv
{m : Type u_1} {n : Type u_2} {α : Type u_3} [One α] : One (WithConv (Matrix m n α)) - PiTensorProduct.instOne 📋 Mathlib.RingTheory.PiTensorProduct
{ι : Type u_1} {R : Type u_3} {A : ι → Type u_4} [CommSemiring R] [(i : ι) → AddCommMonoidWithOne (A i)] [(i : ι) → Module R (A i)] : One (PiTensorProduct R fun i => A i) - SpecialLinearGroup.instOne 📋 Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] : One (SpecialLinearGroup R V) - FirstOrder.Language.presburger.instOneTerm 📋 Mathlib.ModelTheory.Arithmetic.Presburger.Basic
{α : Type u_1} : One (FirstOrder.Language.presburger.Term α) - Zsqrtd.instOne 📋 Mathlib.NumberTheory.Zsqrtd.Basic
{d : ℤ} : One (ℤ√d) - Poly.instOne 📋 Mathlib.NumberTheory.Dioph
{α : Type u_1} : One (Poly α) - HeckeCoset.instOne 📋 Mathlib.NumberTheory.HeckeRing.Defs
{G : Type u_1} [Group G] (Δ : Submonoid G) (H : Subgroup G) : One (HeckeCoset Δ H H) - LucasLehmer.X.instOne 📋 Mathlib.NumberTheory.LucasLehmer
{q : ℕ} : One (LucasLehmer.X q) - RestrictedProduct.instOneCoeOfOneMemClass 📋 Mathlib.Topology.Algebra.RestrictedProduct.Basic
{ι : Type u_1} (R : ι → Type u_2) {𝓕 : Filter ι} {S : ι → Type u_3} [(i : ι) → SetLike (S i) (R i)] {B : (i : ι) → S i} [(i : ι) → One (R i)] [∀ (i : ι), OneMemClass (S i) (R i)] : One (RestrictedProduct (fun i => R i) (fun i => ↑(B i)) 𝓕)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision c026161