Loogle!
Result
Found 256 declarations mentioning MulZeroOneClass. Of these, only the first 200 are shown.
- MulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Defs
(M₀ : Type u) : Type u - MonoidWithZero.toMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MonoidWithZero M₀] : MulZeroOneClass M₀ - MulZeroOneClass.toMulOneClass 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MulZeroOneClass M₀] : MulOneClass M₀ - MulZeroOneClass.toMulZeroClass 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MulZeroOneClass M₀] : MulZeroClass M₀ - MulZeroOneClass.toZero 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MulZeroOneClass M₀] : Zero M₀ - MulZeroOneClass.mul_zero 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MulZeroOneClass M₀] (a : M₀) : a * 0 = 0 - MulZeroOneClass.zero_mul 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [self : MulZeroOneClass M₀] (a : M₀) : 0 * a = 0 - MulZeroOneClass.mk 📋 Mathlib.Algebra.GroupWithZero.Defs
{M₀ : Type u} [toMulOneClass : MulOneClass M₀] [toZero : Zero M₀] (zero_mul : ∀ (a : M₀), 0 * a = 0) (mul_zero : ∀ (a : M₀), a * 0 = 0) : MulZeroOneClass M₀ - NeZero.one 📋 Mathlib.Algebra.GroupWithZero.NeZero
{M₀ : Type u_1} [MulZeroOneClass M₀] [Nontrivial M₀] : NeZero 1 - domain_nontrivial 📋 Mathlib.Algebra.GroupWithZero.NeZero
{M₀ : Type u_1} {M₀' : Type u_2} [MulZeroOneClass M₀] [Nontrivial M₀] [Zero M₀'] [One M₀'] (f : M₀' → M₀) (zero : f 0 = 0) (one : f 1 = 1) : Nontrivial M₀' - subsingleton_of_zero_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] : 0 = 1 → Subsingleton M₀ - uniqueOfZeroEqOne 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] (h : 0 = 1) : Unique M₀ - subsingleton_iff_zero_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] : 0 = 1 ↔ Subsingleton M₀ - eq_of_zero_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] (h : 0 = 1) (a b : M₀) : a = b - eq_zero_of_zero_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] (h : 0 = 1) (a : M₀) : a = 0 - zero_ne_one_or_forall_eq_0 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] : 0 ≠ 1 ∨ ∀ (a : M₀), a = 0 - left_ne_zero_of_mul_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] [Nontrivial M₀] {a b : M₀} (h : a * b = 1) : a ≠ 0 - right_ne_zero_of_mul_eq_one 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} [MulZeroOneClass M₀] [Nontrivial M₀] {a b : M₀} (h : a * b = 1) : b ≠ 0 - eq_zero_of_mul_eq_self_left 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsRightCancelMulZero M₀] (h₁ : b ≠ 1) (h₂ : b * a = a) : a = 0 - eq_zero_of_mul_eq_self_right 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsLeftCancelMulZero M₀] (h₁ : b ≠ 1) (h₂ : a * b = a) : a = 0 - left_eq_mul₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsLeftCancelMulZero M₀] (ha : a ≠ 0) : a = a * b ↔ b = 1 - mul_eq_left₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsLeftCancelMulZero M₀] (ha : a ≠ 0) : a * b = a ↔ b = 1 - mul_eq_right₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsRightCancelMulZero M₀] (hb : b ≠ 0) : a * b = b ↔ a = 1 - right_eq_mul₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsRightCancelMulZero M₀] (hb : b ≠ 0) : b = a * b ↔ a = 1 - mul_left_eq_self₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsRightCancelMulZero M₀] : a * b = b ↔ a = 1 ∨ b = 0 - mul_right_eq_self₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{M₀ : Type u_1} {a b : M₀} [MulZeroOneClass M₀] [IsLeftCancelMulZero M₀] : a * b = a ↔ b = 1 ∨ a = 0 - MonoidWithZeroHom 📋 Mathlib.Algebra.GroupWithZero.Hom
(α : Type u_7) (β : Type u_8) [MulZeroOneClass α] [MulZeroOneClass β] : Type (max u_7 u_8) - MonoidWithZeroHom.id 📋 Mathlib.Algebra.GroupWithZero.Hom
(α : Type u_7) [MulZeroOneClass α] : α →*₀ α - MonoidWithZeroHom.instInhabited 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} [MulZeroOneClass α] : Inhabited (α →*₀ α) - MonoidWithZeroHomClass 📋 Mathlib.Algebra.GroupWithZero.Hom
(F : Type u_7) (α : outParam (Type u_8)) (β : outParam (Type u_9)) [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] : Prop - MonoidWithZeroHom.funLike 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : FunLike (α →*₀ β) α β - MonoidWithZeroHom.instSubsingleton 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] [Subsingleton α] : Subsingleton (α →*₀ β) - MonoidWithZeroHom.instMul 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} [MulZeroOneClass α] {β : Type u_7} [CommMonoidWithZero β] : Mul (α →*₀ β) - MonoidWithZeroHom.monoidWithZeroHomClass 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : MonoidWithZeroHomClass (α →*₀ β) α β - MonoidWithZeroHom.comp 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (hnp : β →*₀ γ) (hmn : α →*₀ β) : α →*₀ γ - MonoidWithZeroHom.ofClass 📋 Mathlib.Algebra.GroupWithZero.Hom
{F : Type u_1} {α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] [MonoidWithZeroHomClass F α β] (f : F) : α →*₀ β - MonoidWithZeroHom.toMonoidHom 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_7} {β : Type u_8} [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀ β) : α →* β - MonoidWithZeroHom.toZeroHom 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_7} {β : Type u_8} [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀ β) : ZeroHom α β - MonoidWithZeroHom.coeToMonoidHom 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : Coe (α →*₀ β) (α →* β) - MonoidWithZeroHom.coeToZeroHom 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : Coe (α →*₀ β) (ZeroHom α β) - MonoidWithZeroHom.id_apply 📋 Mathlib.Algebra.GroupWithZero.Hom
(α : Type u_7) [MulZeroOneClass α] (x : α) : (MonoidWithZeroHom.id α) x = x - MonoidWithZeroHom.comp_id 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : f.comp (MonoidWithZeroHom.id α) = f - MonoidWithZeroHom.id_comp 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : (MonoidWithZeroHom.id β).comp f = f - MonoidWithZeroHom.toMonoidHom_injective 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : Function.Injective MonoidWithZeroHom.toMonoidHom - MonoidWithZeroHom.toZeroHom_injective 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] : Function.Injective MonoidWithZeroHom.toZeroHom - MonoidWithZeroHomClass.toMonoidHomClass 📋 Mathlib.Algebra.GroupWithZero.Hom
{F : Type u_7} {α : outParam (Type u_8)} {β : outParam (Type u_9)} {inst✝ : MulZeroOneClass α} {inst✝¹ : MulZeroOneClass β} {inst✝² : FunLike F α β} [self : MonoidWithZeroHomClass F α β] : MonoidHomClass F α β - MonoidWithZeroHomClass.toZeroHomClass 📋 Mathlib.Algebra.GroupWithZero.Hom
{F : Type u_7} {α : outParam (Type u_8)} {β : outParam (Type u_9)} {inst✝ : MulZeroOneClass α} {inst✝¹ : MulZeroOneClass β} {inst✝² : FunLike F α β} [self : MonoidWithZeroHomClass F α β] : ZeroHomClass F α β - 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₀) - MonoidWithZeroHom.copy 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (f' : α → β) (h : f' = ⇑f) : α →* β - MonoidWithZeroHom.map_zero 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : f 0 = 0 - MonoidWithZeroHomClass.mk 📋 Mathlib.Algebra.GroupWithZero.Hom
{F : Type u_7} {α : outParam (Type u_8)} {β : outParam (Type u_9)} [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] [toMonoidHomClass : MonoidHomClass F α β] [toZeroHomClass : ZeroHomClass F α β] : MonoidWithZeroHomClass F α β - MonoidWithZeroHom.coe_ofClass 📋 Mathlib.Algebra.GroupWithZero.Hom
{F : Type u_1} {α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] [MonoidWithZeroHomClass F α β] (f : F) : ⇑(MonoidWithZeroHom.ofClass f) = ⇑f - MonoidWithZeroHom.map_one 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : f 1 = 1 - MonoidWithZeroHom.map_one' 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_7} {β : Type u_8} [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀ β) : (↑self).toFun 1 = 1 - MonoidWithZeroHom.ext 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] ⦃f g : α →*₀ β⦄ (h : ∀ (x : α), f x = g x) : f = g - MonoidWithZeroHom.ext_iff 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] {f g : α →*₀ β} : f = g ↔ ∀ (x : α), f x = g x - MonoidWithZeroHom.toMonoidHom_coe 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : (↑↑f).toFun = ⇑f - MonoidWithZeroHom.toZeroHom_coe 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) : ⇑↑f = ⇑f - MonoidWithZeroHom.comp_assoc 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] [MulZeroOneClass δ] (f : α →*₀ β) (g : β →*₀ γ) (h : γ →*₀ δ) : (h.comp g).comp f = h.comp (g.comp f) - MonoidWithZeroHom.coe_copy 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (f' : α → β) (h : f' = ⇑f) : ⇑(f.copy f' h) = f' - MonoidWithZeroHom.cancel_left 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] {g : β →*₀ γ} {f₁ f₂ : α →*₀ β} (hg : Function.Injective ⇑g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ - MonoidWithZeroHom.cancel_right 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] {g₁ g₂ : β →*₀ γ} {f : α →*₀ β} (hf : Function.Surjective ⇑f) : g₁.comp f = g₂.comp f ↔ g₁ = g₂ - MonoidWithZeroHom.comp_apply 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (g : β →*₀ γ) (f : α →*₀ β) (x : α) : (g.comp f) x = g (f x) - MonoidWithZeroHom.coe_comp 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (g : β →*₀ γ) (f : α →*₀ β) : ⇑(g.comp f) = ⇑g ∘ ⇑f - MonoidWithZeroHom.map_ite_one_zero 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] {F : Type u_7} [FunLike F α β] [MonoidWithZeroHomClass F α β] (f : F) (p : Prop) [Decidable p] : f (if p then 1 else 0) = if p then 1 else 0 - MonoidWithZeroHom.map_ite_zero_one 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] {F : Type u_7} [FunLike F α β] [MonoidWithZeroHomClass F α β] (f : F) (p : Prop) [Decidable p] : f (if p then 0 else 1) = if p then 0 else 1 - MonoidWithZeroHom.map_mul 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (a b : α) : f (a * b) = f a * f b - MonoidWithZeroHom.one_apply_zero 📋 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₀] : 1 0 = 0 - MonoidWithZeroHom.copy_eq 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (f' : α → β) (h : f' = ⇑f) : f.copy f' h = ↑f - MonoidWithZeroHom.one_apply_of_ne_zero 📋 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₀] {x : M₀} (hx : x ≠ 0) : 1 x = 1 - MonoidWithZeroHom.one_apply_eq_zero_iff 📋 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₀] [Nontrivial N₀] {x : M₀} : 1 x = 0 ↔ x = 0 - MonoidWithZeroHom.map_mul' 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_7} {β : Type u_8} [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀ β) (x y : α) : (↑self).toFun (x * y) = (↑self).toFun x * (↑self).toFun y - MonoidWithZeroHom.one_apply_eq_one_iff 📋 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₀] [Nontrivial N₀] {x : M₀} : 1 x = 1 ↔ x ≠ 0 - MonoidWithZeroHom.one_apply_def 📋 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₀] (x : M₀) : 1 x = if x = 0 then 0 else 1 - MonoidWithZeroHom.mk 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_7} {β : Type u_8} [MulZeroOneClass α] [MulZeroOneClass β] (toZeroHom : ZeroHom α β) (map_one' : toZeroHom.toFun 1 = 1) (map_mul' : ∀ (x y : α), toZeroHom.toFun (x * y) = toZeroHom.toFun x * toZeroHom.toFun y) : α →*₀ β - MonoidWithZeroHom.coe_mk 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : ZeroHom α β) (h1 : f.toFun 1 = 1) (hmul : ∀ (x y : α), f.toFun (x * y) = f.toFun x * f.toFun y) : ⇑{ toZeroHom := f, map_one' := h1, map_mul' := hmul } = ⇑f - MonoidWithZeroHom.mk_coe 📋 Mathlib.Algebra.GroupWithZero.Hom
{α : Type u_2} {β : Type u_3} [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (h1 : (↑f).toFun 1 = 1) (hmul : ∀ (x y : α), (↑f).toFun (x * y) = (↑f).toFun x * (↑f).toFun y) : { toZeroHom := ↑f, map_one' := h1, map_mul' := hmul } = f - Function.Injective.mulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.InjSurj
{M₀ : Type u_1} {M₀' : Type u_3} [MulZeroOneClass M₀] [Mul M₀'] [Zero M₀'] [One M₀'] (f : M₀' → M₀) (hf : Function.Injective f) (zero : f 0 = 0) (one : f 1 = 1) (mul : ∀ (a b : M₀'), f (a * b) = f a * f b) : MulZeroOneClass M₀' - Function.Surjective.mulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.InjSurj
{M₀ : Type u_1} {M₀' : Type u_3} [MulZeroOneClass M₀] [Mul M₀'] [Zero M₀'] [One M₀'] (f : M₀ → M₀') (hf : Function.Surjective f) (zero : f 0 = 0) (one : f 1 = 1) (mul : ∀ (a b : M₀), f (a * b) = f a * f b) : MulZeroOneClass M₀' - AddOpposite.instMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Opposite
{α : Type u_1} [MulZeroOneClass α] : MulZeroOneClass αᵃᵒᵖ - MulOpposite.instMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Opposite
{α : Type u_1} [MulZeroOneClass α] : MulZeroOneClass αᵐᵒᵖ - instMulZeroOneClassOfSemiring 📋 Mathlib.Algebra.Ring.Defs
{α : Type u} [Semiring α] : MulZeroOneClass α - NonAssocSemiring.toMulZeroOneClass 📋 Mathlib.Algebra.Ring.Defs
{α : Type u} [self : NonAssocSemiring α] : MulZeroOneClass α - boole_mul 📋 Mathlib.Algebra.Ring.Defs
{α : Type u_1} [MulZeroOneClass α] (P : Prop) [Decidable P] (a : α) : (if P then 1 else 0) * a = if P then a else 0 - mul_boole 📋 Mathlib.Algebra.Ring.Defs
{α : Type u_1} [MulZeroOneClass α] (P : Prop) [Decidable P] (a : α) : (a * if P then 1 else 0) = if P then a else 0 - Nat.instMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Nat
: MulZeroOneClass ℕ - ext_nat'' 📋 Mathlib.Data.Nat.Cast.Basic
{A : Type u_3} {F : Type u_4} [MulZeroOneClass A] [FunLike F ℕ A] [ZeroHomClass F ℕ A] (f g : F) (h_pos : ∀ {n : ℕ}, 0 < n → f n = g n) : f = g - MonoidWithZeroHom.ext_nat 📋 Mathlib.Data.Nat.Cast.Basic
{A : Type u_3} [MulZeroOneClass A] {f g : ℕ →*₀ A} : (∀ {n : ℕ}, 0 < n → f n = g n) → f = g - MonoidWithZeroHom.ext_nat_iff 📋 Mathlib.Data.Nat.Cast.Basic
{A : Type u_3} [MulZeroOneClass A] {f g : ℕ →*₀ A} : f = g ↔ ∀ {n : ℕ}, 0 < n → f n = g n - MulEquiv.toMonoidWithZeroHom 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G ≃* H) : G →*₀ H - MulEquivClass.toMonoidWithZeroHomClass 📋 Mathlib.Algebra.GroupWithZero.Equiv
{F : Type u_1} {α : Type u_2} {β : Type u_3} [EquivLike F α β] [MulZeroOneClass α] [MulZeroOneClass β] [MulEquivClass F α β] : MonoidWithZeroHomClass F α β - MulEquiv.toMonoidWithZeroHom_bijective 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G ≃* H) : Function.Bijective ⇑f.toMonoidWithZeroHom - MulEquiv.toMonoidWithZeroHom_injective 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G ≃* H) : Function.Injective ⇑f.toMonoidWithZeroHom - MulEquiv.toMonoidWithZeroHom_surjective 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G ≃* H) : Function.Surjective ⇑f.toMonoidWithZeroHom - MulEquiv.toMonoidWithZeroHom_inj 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] {f g : G ≃* H} : f.toMonoidWithZeroHom = g.toMonoidWithZeroHom ↔ f = g - MulEquiv.toMonoidWithZeroHom_apply 📋 Mathlib.Algebra.GroupWithZero.Equiv
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G ≃* H) (x : G) : f.toMonoidWithZeroHom x = f x - WithZero.instMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [MulOneClass α] : MulZeroOneClass (WithZero α) - WithZero.lift' 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] : (α →* β) ≃ (WithZero α →*₀ β) - MonoidWithZeroHom.map_eq_zero_iff 📋 Mathlib.Algebra.GroupWithZero.WithZero
{G₀ : Type u_1} {M₀ : Type u_2} [GroupWithZero G₀] [MulZeroOneClass M₀] [Nontrivial M₀] {f : G₀ →*₀ M₀} {x : G₀} : f x = 0 ↔ x = 0 - MonoidWithZeroHom.comp_one 📋 Mathlib.Algebra.GroupWithZero.WithZero
{M₀ : Type u_1} {N₀ : Type u_2} {G₀ : Type u_3} [MulZeroOneClass M₀] [Nontrivial M₀] [NoZeroDivisors M₀] [MulZeroOneClass N₀] [MulZeroOneClass G₀] [DecidablePred fun x => x = 0] (f : N₀ →*₀ G₀) : f.comp 1 = 1 - MonoidWithZeroHom.one_apply_val_unit 📋 Mathlib.Algebra.GroupWithZero.WithZero
{M₀ : Type u_1} {N₀ : Type u_2} [MonoidWithZero M₀] [MulZeroOneClass N₀] [DecidablePred fun x => x = 0] [Nontrivial M₀] [NoZeroDivisors M₀] (x : M₀ˣ) : 1 ↑x = 1 - WithZero.monoidWithZeroHom_ext 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] ⦃f g : WithZero α →*₀ β⦄ (h : (↑f).comp WithZero.coeMonoidHom = (↑g).comp WithZero.coeMonoidHom) : f = g - WithZero.monoidWithZeroHom_ext_iff 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] {f g : WithZero α →*₀ β} : f = g ↔ (↑f).comp WithZero.coeMonoidHom = (↑g).comp WithZero.coeMonoidHom - MonoidWithZeroHom.apply_one_apply_eq 📋 Mathlib.Algebra.GroupWithZero.WithZero
{M₀ : Type u_1} {N₀ : Type u_2} {G₀ : Type u_3} [MulZeroOneClass M₀] [Nontrivial M₀] [NoZeroDivisors M₀] [MulZeroOneClass N₀] [MulZeroOneClass G₀] [DecidablePred fun x => x = 0] (f : N₀ →*₀ G₀) (x : M₀) : f (1 x) = 1 x - WithZero.lift'_unique 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] (f : WithZero α →*₀ β) : f = WithZero.lift' ((↑f).comp WithZero.coeMonoidHom) - WithZero.lift'_zero 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] (f : α →* β) : (WithZero.lift' f) 0 = 0 - WithZero.lift'_coe 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] (f : α →* β) (x : α) : (WithZero.lift' f) ↑x = f x - WithZero.lift'_surjective 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] {f : α →* β} (hf : Function.Surjective ⇑f) : Function.Surjective ⇑(WithZero.lift' f) - WithZero.lift'_symm_apply_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] (F : WithZero α →*₀ β) (x : α) : (WithZero.lift'.symm F) x = F ↑x - Invertible.toNeZero 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MulZeroOneClass α] [Nontrivial α] (a : α) [Invertible a] : NeZero a - Invertible.ne_zero 📋 Mathlib.Algebra.GroupWithZero.Invertible
{α : Type u} [MulZeroOneClass α] (a : α) [Nontrivial α] [Invertible a] : a ≠ 0 - map_eq_zero 📋 Mathlib.Algebra.GroupWithZero.Units.Lemmas
{G₀ : Type u_3} {M₀' : Type u_4} {F : Type u_6} [GroupWithZero G₀] [MulZeroOneClass M₀'] [Nontrivial M₀'] [FunLike F G₀ M₀'] [MonoidWithZeroHomClass F G₀ M₀'] (f : F) {a : G₀} : f a = 0 ↔ a = 0 - map_ne_zero 📋 Mathlib.Algebra.GroupWithZero.Units.Lemmas
{G₀ : Type u_3} {M₀' : Type u_4} {F : Type u_6} [GroupWithZero G₀] [MulZeroOneClass M₀'] [Nontrivial M₀'] [FunLike F G₀ M₀'] [MonoidWithZeroHomClass F G₀ M₀'] (f : F) {a : G₀} : f a ≠ 0 ↔ a ≠ 0 - OrderMonoidWithZeroHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
(α : Type u_6) (β : Type u_7) [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : Type (max u_6 u_7) - OrderMonoidWithZeroHom.id 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
(α : Type u_2) [Preorder α] [MulZeroOneClass α] : α →*₀o α - OrderMonoidWithZeroHom.instInhabited 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
(α : Type u_2) [Preorder α] [MulZeroOneClass α] : Inhabited (α →*₀o α) - OrderMonoidWithZeroHom.instFunLike 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : FunLike (α →*₀o β) α β - OrderMonoidWithZeroHom.toMonoidWithZeroHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} {β : Type u_7} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀o β) : α →*₀ β - OrderMonoidWithZeroHom.toOrderMonoidHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : α →*o β - OrderMonoidWithZeroHom.instMonoidWithZeroHomClass 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : MonoidWithZeroHomClass (α →*₀o β) α β - OrderMonoidWithZeroHom.toMonoidWithZeroHom_injective 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : Function.Injective OrderMonoidWithZeroHom.toMonoidWithZeroHom - OrderMonoidWithZeroHom.coe_id 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
(α : Type u_2) [Preorder α] [MulZeroOneClass α] : ⇑(OrderMonoidWithZeroHom.id α) = id - OrderMonoidWithZeroHom.instOrderHomClass 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : OrderHomClass (α →*₀o β) α β - OrderMonoidWithZeroHom.comp 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (f : β →*₀o γ) (g : α →*₀o β) : α →*₀o γ - OrderMonoidWithZeroHom.toOrderMonoidHom_injective 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] : Function.Injective OrderMonoidWithZeroHom.toOrderMonoidHom - OrderMonoidWithZeroHom.comp_id 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : f.comp (OrderMonoidWithZeroHom.id α) = f - OrderMonoidWithZeroHom.id_comp 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : (OrderMonoidWithZeroHom.id β).comp f = f - OrderMonoidWithZeroHomClass.toOrderMonoidWithZeroHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{F : Type u_1} {α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] [OrderHomClass F α β] [MonoidWithZeroHomClass F α β] (f : F) : α →*₀o β - instCoeTCOrderMonoidWithZeroHomOfOrderHomClassOfMonoidWithZeroHomClass 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{F : Type u_1} {α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] [FunLike F α β] [OrderHomClass F α β] [MonoidWithZeroHomClass F α β] : CoeTC F (α →*₀o β) - OrderMonoidWithZeroHom.mk 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} {β : Type u_7} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (toMonoidWithZeroHom : α →*₀ β) (monotone' : Monotone (↑toMonoidWithZeroHom).toFun) : α →*₀o β - OrderMonoidWithZeroHom.monotone' 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} {β : Type u_7} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (self : α →*₀o β) : Monotone (↑self.toMonoidWithZeroHom).toFun - OrderMonoidWithZeroHom.copy 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) (f' : α → β) (h : f' = ⇑f) : α →*o β - OrderMonoidWithZeroHom.toMonoidWithZeroHom_eq_ofClass 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {hα : Preorder α} {hα' : MulZeroOneClass α} {hβ : Preorder β} {hβ' : MulZeroOneClass β} (f : α →*₀o β) : f.toMonoidWithZeroHom = MonoidWithZeroHom.ofClass f - OrderMonoidWithZeroHom.toFun_eq_coe 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : (↑f.toMonoidWithZeroHom).toFun = ⇑f - OrderMonoidWithZeroHom.ext 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] {f g : α →*₀o β} (h : ∀ (a : α), f a = g a) : f = g - OrderMonoidWithZeroHom.ofClass_mk 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {hα : Preorder α} {hα' : MulZeroOneClass α} {hβ : Preorder β} {hβ' : MulZeroOneClass β} (f : α →*₀ β) (hf : Monotone ⇑f) : MonoidWithZeroHom.ofClass { toMonoidWithZeroHom := f, monotone' := hf } = f - OrderMonoidWithZeroHom.ext_iff 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] {f g : α →*₀o β} : f = g ↔ ∀ (a : α), f a = g a - OrderMonoidWithZeroHom.coe_monoidWithZeroHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : ⇑(MonoidWithZeroHom.ofClass f) = ⇑f - OrderMonoidWithZeroHom.coe_copy 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) (f' : α → β) (h : f' = ⇑f) : ⇑(f.copy f' h) = f' - OrderMonoidWithZeroHom.coe_mk 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀ β) (h : Monotone (↑f).toFun) : ⇑{ toMonoidWithZeroHom := f, monotone' := h } = ⇑f - OrderMonoidWithZeroHom.comp_assoc 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [Preorder α] [Preorder β] [Preorder γ] [Preorder δ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] [MulZeroOneClass δ] (f : γ →*₀o δ) (g : β →*₀o γ) (h : α →*₀o β) : (f.comp g).comp h = f.comp (g.comp h) - OrderMonoidWithZeroHom.toOrderMonoidHom_eq_coe 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {hα : Preorder α} {hα' : MulZeroOneClass α} {hβ : Preorder β} {hβ' : MulZeroOneClass β} (f : α →*₀o β) : f.toOrderMonoidHom = ↑f - OrderMonoidWithZeroHom.cancel_left 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] {g : β →*₀o γ} {f₁ f₂ : α →*₀o β} (hg : Function.Injective ⇑g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ - OrderMonoidWithZeroHom.cancel_right 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] {g₁ g₂ : β →*₀o γ} {f : α →*₀o β} (hf : Function.Surjective ⇑f) : g₁.comp f = g₂.comp f ↔ g₁ = g₂ - OrderMonoidWithZeroHom.comp_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (f : β →*₀o γ) (g : α →*₀o β) (a : α) : (f.comp g) a = f (g a) - OrderMonoidWithZeroHom.coe_comp 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (f : β →*₀o γ) (g : α →*₀o β) : ⇑(f.comp g) = ⇑f ∘ ⇑g - OrderMonoidWithZeroHom.mk_coe 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) (h : Monotone (↑(MonoidWithZeroHom.ofClass f)).toFun) : { toMonoidWithZeroHom := MonoidWithZeroHom.ofClass f, monotone' := h } = f - OrderMonoidWithZeroHom.copy_eq 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) (f' : α → β) (h : f' = ⇑f) : f.copy f' h = ↑f - OrderMonoidWithZeroHom.coe_orderMonoidHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] [MulZeroOneClass α] [MulZeroOneClass β] (f : α →*₀o β) : ⇑↑f = ⇑f - OrderMonoidWithZeroHom.ofClass_comp 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {hα : Preorder α} {hα' : MulZeroOneClass α} {hβ : Preorder β} {hβ' : MulZeroOneClass β} {hγ : Preorder γ} {hγ' : MulZeroOneClass γ} (f : β →*₀o γ) (g : α →*₀o β) : MonoidWithZeroHom.ofClass (f.comp g) = (MonoidWithZeroHom.ofClass f).comp (MonoidWithZeroHom.ofClass g) - OrderMonoidWithZeroHom.ofClass_comp_monoidWithZeroHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (f : β →*₀o γ) (g : α →*₀o β) : MonoidWithZeroHom.ofClass (f.comp g) = (MonoidWithZeroHom.ofClass f).comp (MonoidWithZeroHom.ofClass g) - OrderMonoidWithZeroHom.coe_comp_orderMonoidHom 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Preorder α] [Preorder β] [Preorder γ] [MulZeroOneClass α] [MulZeroOneClass β] [MulZeroOneClass γ] (f : β →*₀o γ) (g : α →*₀o β) : ↑(f.comp g) = (↑f).comp ↑g - OrderMonoidWithZeroHom.toOrderMonoidHom_comp 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {hα : Preorder α} {hα' : MulZeroOneClass α} {hβ : Preorder β} {hβ' : MulZeroOneClass β} {hγ : Preorder γ} {hγ' : MulZeroOneClass γ} (f : β →*₀o γ) (g : α →*₀o β) : ↑(f.comp g) = (↑f).comp ↑g - Lex.instMulZeroOneClass 📋 Mathlib.Algebra.Order.GroupWithZero.Synonym
{α : Type u_1} [MulZeroOneClass α] : MulZeroOneClass (Lex α) - OrderDual.instMulZeroOneClass 📋 Mathlib.Algebra.Order.GroupWithZero.Synonym
{α : Type u_1} [MulZeroOneClass α] : MulZeroOneClass αᵒᵈ - WithBot.instMulZeroOneClass 📋 Mathlib.Algebra.Order.Ring.WithTop
{α : Type u_1} [DecidableEq α] [MulZeroOneClass α] [Nontrivial α] : MulZeroOneClass (WithBot α) - WithTop.instMulZeroOneClass 📋 Mathlib.Algebra.Order.Ring.WithTop
{α : Type u_1} [DecidableEq α] [MulZeroOneClass α] [Nontrivial α] : MulZeroOneClass (WithTop α) - MonoidWithZeroHom.withBotMap 📋 Mathlib.Algebra.Order.Ring.WithTop
{R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ⇑f) : WithBot R →*₀ WithBot S - MonoidWithZeroHom.withTopMap 📋 Mathlib.Algebra.Order.Ring.WithTop
{R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ⇑f) : WithTop R →*₀ WithTop S - MonoidWithZeroHom.withBotMap_apply 📋 Mathlib.Algebra.Order.Ring.WithTop
{R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ⇑f) : ⇑(f.withBotMap hf) = WithBot.map ⇑f - MonoidWithZeroHom.withTopMap_apply 📋 Mathlib.Algebra.Order.Ring.WithTop
{R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ⇑f) : ⇑(f.withTopMap hf) = WithTop.map ⇑f - MonoidWithZeroHom.ENatMap 📋 Mathlib.Data.ENat.Monoid
{S : Type u_1} [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : ℕ →*₀ S) (hf : Function.Injective ⇑f) : ℕ∞ →*₀ WithTop S - MonoidWithZeroHom.ENatMap_apply 📋 Mathlib.Data.ENat.Monoid
{S : Type u_1} [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : ℕ →*₀ S) (hf : Function.Injective ⇑f) : ⇑(f.ENatMap hf) = ENat.map ⇑f - Prod.instMulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Prod
{M₀ : Type u_1} {N₀ : Type u_2} [MulZeroOneClass M₀] [MulZeroOneClass N₀] : MulZeroOneClass (M₀ × N₀) - smulMonoidWithZeroHom 📋 Mathlib.Algebra.GroupWithZero.Action.Basic
{M₀ : Type u_4} {N₀ : Type u_5} [MonoidWithZero M₀] [MulZeroOneClass N₀] [MulActionWithZero M₀ N₀] [IsScalarTower M₀ N₀ N₀] [SMulCommClass M₀ N₀ N₀] : M₀ × N₀ →*₀ N₀ - smulMonoidWithZeroHom_apply 📋 Mathlib.Algebra.GroupWithZero.Action.Basic
{M₀ : Type u_4} {N₀ : Type u_5} [MonoidWithZero M₀] [MulZeroOneClass N₀] [MulActionWithZero M₀ N₀] [IsScalarTower M₀ N₀ N₀] [SMulCommClass M₀ N₀ N₀] (a✝ : M₀ × N₀) : smulMonoidWithZeroHom a✝ = (↑smulMonoidHom).toFun a✝ - Pi.mulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.Pi
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → MulZeroOneClass (α i)] : MulZeroOneClass ((i : ι) → α i) - MonoidWithZeroHom.comap_mker 📋 Mathlib.Algebra.Group.Subgroup.Actions
{M : Type u_1} {N : Type u_2} {P : Type u_3} [MulZeroOneClass M] [MulZeroOneClass N] [MulZeroOneClass P] (g : N →*₀ P) (f : M →*₀ N) : Submonoid.comap f (MonoidHom.mker g) = MonoidHom.mker (g.comp f) - ULift.mulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.ULift
{α : Type u} [MulZeroOneClass α] : MulZeroOneClass (ULift.{u_1, u} α) - Set.indicator_eq_zero_iff_notMem 📋 Mathlib.Algebra.GroupWithZero.Indicator
{ι : Type u_1} (M₀ : Type u_4) [MulZeroOneClass M₀] {s : Set ι} {i : ι} [Nontrivial M₀] : s.indicator 1 i = 0 ↔ i ∉ s - Set.indicator_eq_one_iff_mem 📋 Mathlib.Algebra.GroupWithZero.Indicator
{ι : Type u_1} (M₀ : Type u_4) [MulZeroOneClass M₀] {s : Set ι} {i : ι} [Nontrivial M₀] : s.indicator 1 i = 1 ↔ i ∈ s - Set.indicator_one_inj 📋 Mathlib.Algebra.GroupWithZero.Indicator
{ι : Type u_1} (M₀ : Type u_4) [MulZeroOneClass M₀] {s t : Set ι} [Nontrivial M₀] (h : s.indicator 1 = t.indicator 1) : s = t - Set.inter_indicator_one 📋 Mathlib.Algebra.GroupWithZero.Indicator
{ι : Type u_1} {M₀ : Type u_4} [MulZeroOneClass M₀] {s t : Set ι} : (s ∩ t).indicator 1 = s.indicator 1 * t.indicator 1 - Set.indicator_prod_one 📋 Mathlib.Algebra.GroupWithZero.Indicator
{ι : Type u_1} {κ : Type u_2} {M₀ : Type u_4} [MulZeroOneClass M₀] {s : Set ι} {i : ι} {t : Set κ} {j : κ} : (s ×ˢ t).indicator 1 (i, j) = s.indicator 1 i * t.indicator 1 j - Set.smul_indicator_one_apply 📋 Mathlib.Algebra.Module.Basic
{α : Type u_1} {R : Type u_2} [MulZeroOneClass R] (s : Set α) (r : R) (a : α) : r • s.indicator 1 a = s.indicator (fun x => r) a - Finsupp.smul_single_one 📋 Mathlib.Data.Finsupp.SMul
{α : Type u_1} {R : Type u_6} [MulZeroOneClass R] (a : α) (b : R) : (b • fun₀ | a => 1) = fun₀ | a => b - Matrix.single_eq_single_vecMulVec_single 📋 Mathlib.Data.Matrix.Basis
{m : Type u_2} {n : Type u_3} {α : Type u_7} [DecidableEq m] [DecidableEq n] [MulZeroOneClass α] (i : m) (j : n) : Matrix.single i j 1 = Matrix.vecMulVec (Pi.single i 1) (Pi.single j 1) - Submonoid.pos 📋 Mathlib.Algebra.Order.GroupWithZero.Submonoid
(α : Type u_1) [MulZeroOneClass α] [PartialOrder α] [PosMulStrictMono α] [ZeroLEOneClass α] [NeZero 1] : Submonoid α - Submonoid.coe_pos 📋 Mathlib.Algebra.Order.GroupWithZero.Submonoid
(α : Type u_1) [MulZeroOneClass α] [PartialOrder α] [PosMulStrictMono α] [ZeroLEOneClass α] [NeZero 1] : ↑(Submonoid.pos α) = Set.Ioi 0 - Submonoid.mem_pos 📋 Mathlib.Algebra.Order.GroupWithZero.Submonoid
{α : Type u_1} [MulZeroOneClass α] [PartialOrder α] [PosMulStrictMono α] [ZeroLEOneClass α] [NeZero 1] {a : α} : a ∈ Submonoid.pos α ↔ 0 < a - DirectLimit.instMulZeroOneClass 📋 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 : ι) → MulZeroOneClass (G i)] [∀ (i j : ι) (h : i ≤ j), MonoidWithZeroHomClass (T h) (G i) (G j)] : MulZeroOneClass (DirectLimit G f) - DirectLimit.instNontrivial 📋 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 : ι) → MulZeroOneClass (G i)] [∀ (i j : ι) (h : i ≤ j), MonoidWithZeroHomClass (T h) (G i) (G j)] [∀ (i : ι), Nontrivial (G i)] : Nontrivial (DirectLimit G f) - Matrix.kronecker_one 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [MulZeroOneClass α] [DecidableEq n] (A : Matrix l m α) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) A 1 = Matrix.blockDiagonal fun x => A - Matrix.one_kronecker_one 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {m : Type u_10} {n : Type u_11} [MulZeroOneClass α] [DecidableEq m] [DecidableEq n] : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) 1 1 = 1 - Matrix.one_kronecker 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [MulZeroOneClass α] [DecidableEq l] (B : Matrix m n α) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) 1 B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun x => B) - DualNumber.inr_eq_smul_eps 📋 Mathlib.Algebra.DualNumber
{R : Type u_1} [MulZeroOneClass R] (r : R) : TrivSqZeroExt.inr r = r • DualNumber.eps - MonoidWithZeroHom.one_comp 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{M₀ : Type u_1} {N₀ : Type u_2} {G₀ : Type u_3} [GroupWithZero M₀] [MulZeroOneClass N₀] [Nontrivial N₀] [NoZeroDivisors N₀] [MulZeroOneClass G₀] [DecidablePred fun x => x = 0] [DecidablePred fun x => x = 0] (f : M₀ →*₀ N₀) : MonoidWithZeroHom.comp 1 f = 1 - MonoidWithZeroHom.one_apply_apply_eq 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{M₀ : Type u_1} {N₀ : Type u_2} {G₀ : Type u_3} [GroupWithZero M₀] [MulZeroOneClass N₀] [Nontrivial N₀] [NoZeroDivisors N₀] [MulZeroOneClass G₀] [DecidablePred fun x => x = 0] [DecidablePred fun x => x = 0] (f : M₀ →*₀ N₀) (x : M₀) : 1 (f x) = 1 x - MonoidWithZeroHom.instMulZeroOneClassSubtypeMemSubmonoidMrange 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G →*₀ H) : MulZeroOneClass ↥(MonoidHom.mrange f) - MonoidWithZeroHom.instMonoidWithZeroSubtypeMemSubmonoidMrange 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MonoidWithZero H] (f : G →*₀ H) : MonoidWithZero ↥(MonoidHom.mrange f) - MonoidWithZeroHom.instCommMonoidWithZeroSubtypeMemSubmonoidMrange 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [CommMonoidWithZero H] (f : G →*₀ H) : CommMonoidWithZero ↥(MonoidHom.mrange f) - MonoidWithZeroHom.val_mrange_zero 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] (f : G →*₀ H) : ↑0 = 0 - MonoidWithZeroHom.range_nontrivial 📋 Mathlib.Algebra.GroupWithZero.Range
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] [Nontrivial H] (f : G →*₀ H) : (Set.range ⇑f).Nontrivial - MonoidWithZeroHom.mrange_nontrivial 📋 Mathlib.Algebra.GroupWithZero.Range
{G : Type u_1} {H : Type u_2} [MulZeroOneClass G] [MulZeroOneClass H] [Nontrivial H] (f : G →*₀ H) : Nontrivial ↥(MonoidHom.mrange f) - Equiv.mulZeroOneClass 📋 Mathlib.Algebra.GroupWithZero.TransferInstance
{α : Type u} {β : Type v} (e : α ≃ β) [MulZeroOneClass β] : MulZeroOneClass α - instMulZeroOneClassShrink 📋 Mathlib.Algebra.GroupWithZero.Shrink
{α : Type u_2} [Small.{v, u_2} α] [MulZeroOneClass α] : MulZeroOneClass (Shrink.{v, u_2} α) - Matrix.hadamard_one 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {n : Type u_3} [DecidableEq n] [MulZeroOneClass α] (M : Matrix n n α) : M.hadamard 1 = Matrix.diagonal M.diag - Matrix.one_hadamard 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {n : Type u_3} [DecidableEq n] [MulZeroOneClass α] (M : Matrix n n α) : Matrix.hadamard 1 M = Matrix.diagonal M.diag - Matrix.hadamard_one_eq_diagonal_iff 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {n : Type u_3} [DecidableEq n] [MulZeroOneClass α] {A : Matrix n n α} {d : n → α} : A.hadamard 1 = Matrix.diagonal d ↔ A.diag = d - Matrix.one_hadamard_eq_diagonal_iff 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {n : Type u_3} [DecidableEq n] [MulZeroOneClass α] {A : Matrix n n α} {d : n → α} : Matrix.hadamard 1 A = Matrix.diagonal d ↔ A.diag = d
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