Loogle!
Result
Found 123 declarations mentioning WithZero.coe.
- WithZero.coe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} : α → WithZero α - WithZero.coe_injective 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} : Function.Injective WithZero.coe - WithZero.unzeroD_coe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} (d x : α) : WithZero.unzeroD d ↑x = x - WithZero.coe_inj 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {a b : α} : ↑a = ↑b ↔ a = b - WithZero.coe_ne_zero 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {a : α} : ↑a ≠ 0 - WithZero.zero_ne_coe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {a : α} : 0 ≠ ↑a - WithZero.coe_neg 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} [Neg α] (a : α) : ↑(-a) = -↑a - WithZero.instCanLift 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} : CanLift (WithZero α) α WithZero.coe fun a => a ≠ 0 - WithZero.cases_on 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {P : WithZero α → Prop} (x : WithZero α) : P 0 → (∀ (a : α), P ↑a) → P x - WithZero.recZeroCoe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {motive : WithZero α → Sort u_1} (zero : motive 0) (coe : (a : α) → motive ↑a) (n : WithZero α) : motive n - WithZero.forall 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {p : WithZero α → Prop} : (∀ (x : WithZero α), p x) ↔ p 0 ∧ ∀ (a : α), p ↑a - WithZero.coe_unzero 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {x : WithZero α} (hx : x ≠ 0) : ↑(WithZero.unzero hx) = x - WithZero.unzero_coe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {x : α} (hx : ↑x ≠ 0) : WithZero.unzero hx = x - WithZero.ne_zero_iff_exists 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {x : WithZero α} : x ≠ 0 ↔ ∃ a, ↑a = x - WithZero.exists 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {p : WithZero α → Prop} : (∃ x, p x) ↔ p 0 ∨ ∃ a, p ↑a - WithZero.unzeroD_eq_self_iff 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {d : α} {x : WithZero α} : WithZero.unzeroD d x = d ↔ x = ↑d ∨ x = 0 - WithZero.coe_add 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} [Add α] (a b : α) : ↑(a + b) = ↑a + ↑b - WithZero.recZeroCoe_coe 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {motive : WithZero α → Sort u_1} (h₁ : motive 0) (h₂ : (a : α) → motive ↑a) (a : α) : WithZero.recZeroCoe h₁ h₂ ↑a = h₂ a - WithZero.unzeroD_eq_iff 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {d y : α} {x : WithZero α} : WithZero.unzeroD d x = y ↔ x = ↑y ∨ x = 0 ∧ y = d - WithZero.recZeroCoe_zero 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {motive : WithZero α → Sort u_1} (h₁ : motive 0) (h₂ : (a : α) → motive ↑a) : WithZero.recZeroCoe h₁ h₂ 0 = h₁ - WithZero.unzeroD_eq_unzeroD_iff 📋 Mathlib.Algebra.Group.WithOne.Defs
{α : Type u} {d : α} {x y : WithZero α} : WithZero.unzeroD d x = WithZero.unzeroD d y ↔ x = y ∨ x = ↑d ∧ y = 0 ∨ x = 0 ∧ y = ↑d - WithZero.map_coe 📋 Mathlib.Algebra.Group.WithOne.Map
{α : Type u_1} {β : Type u_2} (f : α → β) (a : α) : WithZero.map f ↑a = ↑(f a) - WithZero.map₂_coe_coe 📋 Mathlib.Algebra.Group.WithOne.Map
{α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : β) : WithZero.map₂ f ↑a ↑b = ↑(f a b) - WithZero.map₂_coe_left 📋 Mathlib.Algebra.Group.WithOne.Map
{α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : α) (b : WithZero β) : WithZero.map₂ f (↑a) b = WithZero.map (fun b => f a b) b - WithZero.map₂_coe_right 📋 Mathlib.Algebra.Group.WithOne.Map
{α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (a : WithZero α) (b : β) : WithZero.map₂ f a ↑b = WithZero.map (fun x => f x b) a - WithZero.coe_inv 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [Inv α] (a : α) : ↑a⁻¹ = (↑a)⁻¹ - WithZero.coe_one 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [One α] : ↑1 = 1 - WithZero.exp_eq_coe_ofAdd 📋 Mathlib.Algebra.GroupWithZero.WithZero
{M : Type u_4} (a : M) : WithZero.exp a = ↑(Multiplicative.ofAdd a) - WithZero.coe_div 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [Div α] (a b : α) : ↑(a / b) = ↑a / ↑b - WithZero.coe_mul 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [Mul α] (a b : α) : ↑(a * b) = ↑a * ↑b - WithZero.coe_pow 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [One α] [Pow α ℕ] (a : α) (n : ℕ) : ↑(a ^ n) = ↑a ^ n - WithZero.coe_zpow 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [One α] [Pow α ℤ] (a : α) (n : ℤ) : ↑(a ^ n) = ↑a ^ n - WithZero.coeMonoidHom_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [MulOneClass α] (a✝ : α) : WithZero.coeMonoidHom a✝ = ↑a✝ - WithZero.map'_coe 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulOneClass β] (f : α →* β) (x : α) : (WithZero.map' f) ↑x = ↑(f x) - WithZero.lift'_coe 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [MulOneClass α] [MulZeroOneClass β] (f : α →* β) (x : α) : (WithZero.lift' f) ↑x = f x - WithZero.coe_unitsWithZeroEquiv_eq_units_val 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [Group α] (γ : (WithZero α)ˣ) : ↑(WithZero.unitsWithZeroEquiv γ) = ↑γ - 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 - WithZero.unitsWithZeroEquiv_symm_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [Group α] (a : α) : WithZero.unitsWithZeroEquiv.symm a = Units.mk0 ↑a ⋯ - WithZero.withZeroUnitsEquiv_symm_apply_coe 📋 Mathlib.Algebra.GroupWithZero.WithZero
{G : Type u_4} [GroupWithZero G] [DecidablePred fun a => a = 0] (a : Gˣ) : WithZero.withZeroUnitsEquiv.symm ↑a = ↑a - WithZero.withZeroUnitsEquiv_symm_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{G : Type u_4} [GroupWithZero G] [DecidablePred fun a => a = 0] (a : G) : WithZero.withZeroUnitsEquiv.symm a = if h : a = 0 then 0 else ↑(Units.mk0 a h) - MulEquiv.withZero_symm_apply_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [Group α] [Group β] (e : WithZero α ≃* WithZero β) (x : α) : (MulEquiv.withZero.symm e) x = WithZero.unzero ⋯ - MulEquiv.withZero_symm_apply_symm_apply 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} {β : Type u_2} [Group α] [Group β] (e : WithZero α ≃* WithZero β) (x : β) : (MulEquiv.withZero.symm e).symm x = WithZero.unzero ⋯ - IsMax.withZero 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {a : α} (h : IsMax a) : IsMax ↑a - WithZero.le_coe_unzeroD 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] (x : WithZero α) (b : α) : x ≤ ↑(WithZero.unzeroD b x) - WithZero.zero_lt_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] (a : α) : 0 < ↑a - WithZero.coe_le_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {a b : α} : ↑a ≤ ↑b ↔ a ≤ b - WithZero.coe_lt_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {a b : α} : ↑a < ↑b ↔ a < b - WithZero.not_coe_le_zero 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] (a : α) : ¬↑a ≤ 0 - WithZero.le_coe_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x : WithZero α} {b : α} : x ≤ ↑b ↔ ∀ (a : α), x = ↑a → a ≤ b - WithZero.lt_coe_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x : WithZero α} {b : α} : x < ↑b ↔ ∀ (a : α), x = ↑a → a < b - WithZero.coe_inf 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [SemilatticeInf α] (a b : α) : ↑(a ⊓ b) = ↑a ⊓ ↑b - WithZero.coe_sup 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [SemilatticeSup α] (a b : α) : ↑(a ⊔ b) = ↑a ⊔ ↑b - WithZero.coe_le_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x : WithZero α} {a : α} : ↑a ≤ x ↔ ∃ b, x = ↑b ∧ a ≤ b - WithZero.le_unzeroD 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [PartialOrder α] {y : WithZero α} {a b : α} (hy : ↑b ≤ y) : b ≤ WithZero.unzeroD a y - WithZero.coe_le_one 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {a : α} [One α] : ↑a ≤ 1 ↔ a ≤ 1 - WithZero.coe_lt_one 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {a : α} [One α] : ↑a < 1 ↔ a < 1 - WithZero.one_le_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {a : α} [One α] : 1 ≤ ↑a ↔ 1 ≤ a - WithZero.one_lt_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {a : α} [One α] : 1 < ↑a ↔ 1 < a - WithZero.lt_iff_exists_coe 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x y : WithZero α} : x < y ↔ ∃ b, y = ↑b ∧ x < ↑b - WithZero.le_unzero_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {y : WithZero α} {a : α} (hy : y ≠ 0) : a ≤ WithZero.unzero hy ↔ ↑a ≤ y - WithZero.lt_unzero_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {y : WithZero α} {a : α} (hy : y ≠ 0) : a < WithZero.unzero hy ↔ ↑a < y - WithZero.unbot_le_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x : WithZero α} {b : α} (hx : x ≠ 0) : WithZero.unzero hx ≤ b ↔ x ≤ ↑b - WithZero.unzero_lt_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x : WithZero α} {b : α} (hx : x ≠ 0) : WithZero.unzero hx < b ↔ x < ↑b - WithZero.le_unzeroD_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x : WithZero α} {a b : α} (hx : x ≠ 0) : b ≤ WithZero.unzeroD a x ↔ ↑b ≤ x - WithZero.lt_unzeroD_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x : WithZero α} {a b : α} (hx : x ≠ 0) : b < WithZero.unzeroD a x ↔ ↑b < x - WithZero.le_def 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x y : WithZero α} : x ≤ y ↔ ∀ (a : α), x = ↑a → ∃ b, y = ↑b ∧ a ≤ b - WithZero.lt_iff_exists 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x y : WithZero α} : x < y ↔ ∃ b, y = ↑b ∧ ∀ (a : α), x = ↑a → a < b - WithZero.unzeroD_le_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LE α] {x : WithZero α} {a b : α} (hx : x = 0 → a ≤ b) : WithZero.unzeroD a x ≤ b ↔ x ≤ ↑b - WithZero.unzeroD_lt_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x : WithZero α} {a b : α} (hx : x = 0 → a < b) : WithZero.unzeroD a x < b ↔ x < ↑b - WithZero.lt_def 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LT α] {x y : WithZero α} : x < y ↔ (x = 0 ∧ ∃ b, y = ↑b) ∨ ∃ a b, a < b ∧ x = ↑a ∧ y = ↑b - WithZero.le_max_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LinearOrder α] {a b c : α} : ↑a ≤ max ↑b ↑c ↔ a ≤ max b c - WithZero.min_le_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [LinearOrder α] {a b c : α} : min ↑a ↑b ≤ ↑c ↔ min a b ≤ c - WithZero.toAdd_unzero_eq_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_3} {a : WithZero (Multiplicative α)} (h : a ≠ 0) (b : α) : Multiplicative.toAdd (WithZero.unzero h) = b ↔ a = ↑(Multiplicative.ofAdd b) - WithZero.le_ofAdd_of_toAdd_unzero_le 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) (h : Multiplicative.toAdd (WithZero.unzero ha) ≤ b) : a ≤ ↑(Multiplicative.ofAdd b) - WithZero.lt_ofAdd_of_toAdd_unzero_lt 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) (h : Multiplicative.toAdd (WithZero.unzero ha) < b) : a < ↑(Multiplicative.ofAdd b) - WithZero.toAdd_unzero_le_of_lt_ofAdd 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) (h : a ≤ ↑(Multiplicative.ofAdd b)) : Multiplicative.toAdd (WithZero.unzero ha) ≤ b - WithZero.toAdd_unzero_lt_of_lt_ofAdd 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) (h : a < ↑(Multiplicative.ofAdd b)) : Multiplicative.toAdd (WithZero.unzero ha) < b - WithZero.le_ofAdd_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) : a ≤ ↑(Multiplicative.ofAdd b) ↔ Multiplicative.toAdd (WithZero.unzero ha) ≤ b - WithZero.lt_ofAdd_iff 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_1} [Preorder α] {a : WithZero (Multiplicative α)} {b : α} (ha : a ≠ 0) : a < ↑(Multiplicative.ofAdd b) ↔ Multiplicative.toAdd (WithZero.unzero ha) < b - WithZero.val_expOrderIso_apply 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{G : Type u_3} [Preorder G] [AddGroup G] (a✝ : G) : ↑(WithZero.expOrderIso a✝) = ↑(Multiplicative.ofAdd a✝) - WithZero.val_inv_expOrderIso_apply 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{G : Type u_3} [Preorder G] [AddGroup G] (a✝ : G) : ↑(WithZero.expOrderIso a✝)⁻¹ = (↑(Multiplicative.ofAdd a✝))⁻¹ - WithZero.val_logOrderIso_symm_apply 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{G : Type u_3} [Preorder G] [AddGroup G] (a✝ : G) : ↑((RelIso.symm WithZero.logOrderIso) a✝) = ↑(Multiplicative.ofAdd a✝) - WithZero.val_inv_logOrderIso_symm_apply 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{G : Type u_3} [Preorder G] [AddGroup G] (a✝ : G) : ↑((RelIso.symm WithZero.logOrderIso) a✝)⁻¹ = (↑(Multiplicative.ofAdd a✝))⁻¹ - OrderMonoidIso.val_unitsWithZero_symm_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} [Group α] [Preorder α] (a : α) : ↑(OrderMonoidIso.unitsWithZero.symm a) = ↑a - OrderMonoidIso.val_inv_unitsWithZero_symm_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} [Group α] [Preorder α] (a : α) : ↑(OrderMonoidIso.unitsWithZero.symm a)⁻¹ = (↑a)⁻¹ - OrderMonoidIso.withZeroUnits_symm_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{α : Type u_6} [LinearOrderedCommGroupWithZero α] [DecidablePred fun a => a = 0] (a : α) : OrderMonoidIso.withZeroUnits.symm a = if h : a = 0 then 0 else ↑(Units.mk0 a h) - OrderMonoidIso.withZero_symm_apply_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{G : Type u_6} {H : Type u_7} [Group G] [PartialOrder G] [Group H] [PartialOrder H] (e : WithZero G ≃*o WithZero H) (x : G) : (OrderMonoidIso.withZero.symm e) x = WithZero.unzero ⋯ - OrderMonoidIso.withZero_symm_apply_symm_apply 📋 Mathlib.Algebra.Order.Hom.MonoidWithZero
{G : Type u_6} {H : Type u_7} [Group G] [PartialOrder G] [Group H] [PartialOrder H] (e : WithZero G ≃*o WithZero H) (x : H) : (OrderMonoidIso.withZero.symm e).symm x = WithZero.unzero ⋯ - WithZero.coeAddHom_apply 📋 Mathlib.Algebra.Group.WithOne.Basic
{α : Type u} [Add α] (a✝ : α) : WithZero.coeAddHom a✝ = ↑a✝ - WithZero.mapAddHom_coe 📋 Mathlib.Algebra.Group.WithOne.Basic
{α : Type u} {β : Type v} [Add α] [Add β] (f : α →ₙ+ β) (a : α) : (WithZero.mapAddHom f) ↑a = ↑(f a) - WithZero.lift_coe 📋 Mathlib.Algebra.Group.WithOne.Basic
{α : Type u} {β : Type v} [Add α] [AddZeroClass β] (f : α →ₙ+ β) (x : α) : (WithZero.lift f) ↑x = f x - WithZero.lift_symm_apply 📋 Mathlib.Algebra.Group.WithOne.Basic
{α : Type u} {β : Type v} [Add α] [AddZeroClass β] (f : WithZero α →+ β) (x : α) : (WithZero.lift.symm f) x = f ↑x - FreeAddMonoid.equivWithZeroFreeAddSemigroup_apply 📋 Mathlib.Algebra.FreeMonoid.FreeSemigroup
{α : Type u_1} (a : FreeAddMonoid α) : FreeAddMonoid.equivWithZeroFreeAddSemigroup a = (FreeAddMonoid.lift fun x => ↑(FreeAddSemigroup.of x)) a - MonoidWithZeroHom.fst_apply_coe 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{G₀ : Type u_1} {H₀ : Type u_2} [GroupWithZero G₀] [GroupWithZero H₀] (x : G₀ˣ × H₀ˣ) : (MonoidWithZeroHom.fst G₀ H₀) ↑x = ↑x.1 - MonoidWithZeroHom.snd_apply_coe 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{G₀ : Type u_1} {H₀ : Type u_2} [GroupWithZero G₀] [GroupWithZero H₀] (x : G₀ˣ × H₀ˣ) : (MonoidWithZeroHom.snd G₀ H₀) ↑x = ↑x.2 - MonoidWithZeroHom.inl_apply_unit 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{G₀ : Type u_1} {H₀ : Type u_2} [GroupWithZero G₀] [GroupWithZero H₀] [DecidablePred fun x => x = 0] (x : G₀ˣ) : (MonoidWithZeroHom.inl G₀ H₀) ↑x = ↑(x, 1) - MonoidWithZeroHom.inr_apply_unit 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{G₀ : Type u_1} {H₀ : Type u_2} [GroupWithZero G₀] [GroupWithZero H₀] [DecidablePred fun x => x = 0] (x : H₀ˣ) : (MonoidWithZeroHom.inr G₀ H₀) ↑x = ↑(1, x) - MonoidWithZeroHom.inl_mul_inr_eq_mk_of_unit 📋 Mathlib.Algebra.GroupWithZero.ProdHom
{G₀ : Type u_1} {H₀ : Type u_2} [GroupWithZero G₀] [GroupWithZero H₀] [DecidablePred fun x => x = 0] [DecidablePred fun x => x = 0] (m : G₀ˣ) (n : H₀ˣ) : (MonoidWithZeroHom.inl G₀ H₀) ↑m * (MonoidWithZeroHom.inr G₀ H₀) ↑n = ↑(m, n) - MonoidWithZeroHom.ValueGroup₀.mk_eq_of_ne_zero 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) [DecidablePred fun b => b = 0] (r s : A) (hr : f r ≠ 0) (hs : f s ≠ 0) : MonoidWithZeroHom.ValueGroup₀.mk f r s = ↑(MonoidWithZeroHom.valueGroup.mk f r s hr hs) - MonoidWithZeroHom.ValueGroup₀.zero_or_exists_mk 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) (x : f.ValueGroup₀) : x = 0 ∨ ∃ r s, ∃ (hr : f r ≠ 0) (hs : f s ≠ 0), x = ↑(MonoidWithZeroHom.valueGroup.mk f r s hr hs) - MonoidWithZeroHom.ValueGroup₀.restrict₀_of_ne_zero 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [GroupWithZero B] {f : A →*₀ B} {a : A} (h : f a ≠ 0) : (MonoidWithZeroHom.ValueGroup₀.restrict₀ f) a = ↑⟨Units.mk0 (f a) h, ⋯⟩ - MonoidWithZeroHom.ValueGroup₀.restrict₀_apply 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [GroupWithZero B] (f : A →*₀ B) (a : A) : (MonoidWithZeroHom.ValueGroup₀.restrict₀ f) a = if h : f a = 0 then 0 else ↑⟨Units.mk0 (f a) h, ⋯⟩ - MonoidWithZeroHom.ValueGroup₀.zero_or_exists_mk' 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) (x : f.ValueGroup₀) : x = 0 ∨ ∃ d, x = ↑(MonoidWithZeroHom.valueGroup.mk f (↑d).1 (↑d).2 ⋯ ⋯) - OrderIso.withZeroUnits_symm_apply 📋 Mathlib.Algebra.Order.GroupWithZero.WithZero
{α : Type u_1} [LinearOrderedCommGroupWithZero α] (a : α) : (RelIso.symm OrderIso.withZeroUnits) a = if h : a = 0 then 0 else ↑(Units.mk0 a h) - Valuation.restrict_eq_mk 📋 Mathlib.RingTheory.Valuation.Basic
{R : Type u_3} {Γ₀ : Type u_4} [Ring R] [LinearOrderedCommGroupWithZero Γ₀] (v : Valuation R Γ₀) {x : R} (hx : v x ≠ 0) : v.restrict x = ↑(MonoidWithZeroHom.valueGroup.mk (MonoidWithZeroHom.ofClass v) 1 x ⋯ hx) - Valuation.IsEquiv.valueGroup₀Fun_spec 📋 Mathlib.RingTheory.Valuation.Basic
{R : Type u_3} {Γ₀ : Type u_4} {Γ'₀ : Type u_5} [LinearOrderedCommGroupWithZero Γ₀] [LinearOrderedCommGroupWithZero Γ'₀] [Ring R] {v : Valuation R Γ₀} {w : Valuation R Γ'₀} (h : v.IsEquiv w) {r s : R} (hr : (MonoidWithZeroHom.ofClass v) r ≠ 0) (hs : (MonoidWithZeroHom.ofClass v) s ≠ 0) (hr' : (MonoidWithZeroHom.ofClass w) r ≠ 0 := ⋯) (hs' : (MonoidWithZeroHom.ofClass w) s ≠ 0 := ⋯) : h.valueGroup₀Fun ↑(MonoidWithZeroHom.valueGroup.mk (MonoidWithZeroHom.ofClass v) r s hr hs) = ↑(MonoidWithZeroHom.valueGroup.mk (MonoidWithZeroHom.ofClass w) r s hr' hs') - LinearOrderedCommGroupWithZero.inr_eq_coe_inrₗ 📋 Mathlib.Algebra.Order.GroupWithZero.Lex
{α : Type u_1} {β : Type u_2} [LinearOrderedCommGroupWithZero α] [LinearOrderedCommGroupWithZero β] {n : β} (hn : n ≠ 0) : (LinearOrderedCommGroupWithZero.inr α β) n = ↑((OrderMonoidHom.inrₗ αˣ βˣ) (Units.mk0 n hn)) - LinearOrderedCommGroupWithZero.inl_eq_coe_inlₗ 📋 Mathlib.Algebra.Order.GroupWithZero.Lex
{α : Type u_1} {β : Type u_2} [LinearOrderedCommGroupWithZero α] [LinearOrderedCommGroupWithZero β] {m : α} (hm : m ≠ 0) : (LinearOrderedCommGroupWithZero.inl α β) m = ↑((OrderMonoidHom.inlₗ αˣ βˣ) (Units.mk0 m hm)) - LinearOrderedCommGroupWithZero.inl_mul_inr_eq_coe_toLex 📋 Mathlib.Algebra.Order.GroupWithZero.Lex
{α : Type u_1} {β : Type u_2} [LinearOrderedCommGroupWithZero α] [LinearOrderedCommGroupWithZero β] {m : α} {n : β} (hm : m ≠ 0) (hn : n ≠ 0) : (LinearOrderedCommGroupWithZero.inl α β) m * (LinearOrderedCommGroupWithZero.inr α β) n = ↑(toLex (Units.mk0 m hm, Units.mk0 n hn)) - WithZero.toMulBot_coe 📋 Mathlib.Algebra.Order.Monoid.ToMulBot
{α : Type u} [Add α] (x : Multiplicative α) : WithZero.toMulBot ↑x = Multiplicative.ofAdd ↑(Multiplicative.toAdd x) - WithZero.toMulBot_coe_ofAdd 📋 Mathlib.Algebra.Order.Monoid.ToMulBot
{α : Type u} [Add α] (x : α) : WithZero.toMulBot.symm (Multiplicative.ofAdd ↑x) = ↑(Multiplicative.ofAdd x) - Valuation.IsRankOneDiscrete.embedding_generator' 📋 Mathlib.RingTheory.Valuation.Discrete.Basic
{Γ : Type u_1} [LinearOrderedCommGroupWithZero Γ] {A : Type u_2} [Ring A] (v : Valuation A Γ) [v.IsRankOneDiscrete] : MonoidWithZeroHom.ValueGroup₀.embedding ↑(Valuation.IsRankOneDiscrete.generator' v) = ↑(Valuation.IsRankOneDiscrete.generator v) - IsDedekindDomain.HeightOneSpectrum.exists_intValuation_mul_sub_lt 📋 Mathlib.RingTheory.DedekindDomain.AdicValuation
{R : Type u_1} [CommRing R] [IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) {a b : R} (hv : v.intValuation b ≤ v.intValuation a) (γ : Multiplicative ℤ) : ∃ y, v.intValuation (b - y * a) < ↑γ - IsDedekindDomain.HeightOneSpectrum.adicCompletion.coe_valueGroupOrderIso_coe 📋 Mathlib.RingTheory.DedekindDomain.AdicValuation
{R : Type u_1} [CommRing R] [IsDedekindDomain R] (K : Type u_2) [Field K] [Algebra R K] [IsFractionRing R K] (v : IsDedekindDomain.HeightOneSpectrum R) (a : ↥(MonoidWithZeroHom.ofClass (IsDedekindDomain.HeightOneSpectrum.adicCompletion.valuation K v)).valueGroup) : (IsDedekindDomain.HeightOneSpectrum.adicCompletion.valueGroupOrderIso K v) ↑a = ↑((IsDedekindDomain.HeightOneSpectrum.adicCompletion.valueGroupEquiv K v) a) - IsDiscreteValuationRing.intValuation_maximalIdeal 📋 Mathlib.RingTheory.Valuation.Discrete.IsDiscreteValuationRing
{A : Type u_1} [CommRing A] [IsDomain A] [IsDiscreteValuationRing A] (x : A) : (IsDiscreteValuationRing.maximalIdeal A).intValuation x = (ENat.recTopCoe 0 (fun x => ↑(Multiplicative.ofAdd ↑x)) ((IsDiscreteValuationRing.addVal A) x))⁻¹ - Valuation.IsRankOneDiscrete.valueGroup₀_equiv_withZeroMulInt_apply_zpow 📋 Mathlib.RingTheory.Valuation.Discrete.RankOne
{Γ : Type u_1} [LinearOrderedCommGroupWithZero Γ] {R : Type u_2} [Ring R] (v : Valuation R Γ) [hv : v.IsRankOneDiscrete] (k : ℤ) : (Valuation.IsRankOneDiscrete.valueGroup₀_equiv_withZeroMulInt v) (↑(Valuation.IsRankOneDiscrete.generator' v) ^ k) = WithZero.exp (-k) - Ring.ordMonoidWithZeroHom_eq_coe 📋 Mathlib.RingTheory.OrderOfVanishing.Basic
(R : Type u_1) [CommRing R] [Nontrivial R] {x : R} (hx : x ∈ nonZeroDivisors R) {n : ℕ} (hn : Ring.ord R x = ↑n) : (Ring.ordMonoidWithZeroHom R) x = ↑(Multiplicative.ofAdd ↑n) - Ring.ordMonoidWithZeroHom_eq_ord 📋 Mathlib.RingTheory.OrderOfVanishing.Basic
{R : Type u_1} [CommRing R] [Nontrivial R] {x : R} (h : x ∈ nonZeroDivisors R) : (Ring.ordMonoidWithZeroHom R) x = ENat.recTopCoe 0 (fun x => ↑(Multiplicative.ofAdd ↑x)) (Ring.ord R x) - Ring.ordMonoidWithZeroHom_eq_ordMonoidHom 📋 Mathlib.RingTheory.OrderOfVanishing.Noetherian
{R : Type u_2} [CommRing R] [IsNoetherianRing R] [Ring.KrullDimLE 1 R] [Nontrivial R] (x : ↥(nonZeroDivisors R)) : ↑(Multiplicative.ofAdd ↑(Multiplicative.toAdd (Ring.ordMonoidHom x))) = (Ring.ordMonoidWithZeroHom R) ↑x - AlgebraicGeometry.Scheme.ord_eq_iff 📋 Mathlib.AlgebraicGeometry.OrderOfVanishing
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsIntegral X] [AlgebraicGeometry.IsLocallyNoetherian X] {z : ↥X} (hz : Order.coheight z = 1) {f : ↑X.functionField} (hf : f ≠ 0) {n : ℤ} : AlgebraicGeometry.Scheme.ord f z = n ↔ (AlgebraicGeometry.Scheme.ordHom z hz) f = ↑(Multiplicative.ofAdd n) - AlgebraicGeometry.Scheme.le_ord_iff 📋 Mathlib.AlgebraicGeometry.OrderOfVanishing
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsIntegral X] [AlgebraicGeometry.IsLocallyNoetherian X] {x : ↥X} (hx : Order.coheight x = 1) {f : ↑X.functionField} (hf : f ≠ 0) {n : ℤ} : n ≤ AlgebraicGeometry.Scheme.ord f x ↔ ↑(Multiplicative.ofAdd n) ≤ (AlgebraicGeometry.Scheme.ordHom x hx) f - IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroToFun_eq 📋 Mathlib.RingTheory.DedekindDomain.SelmerGroup
{R : Type u} [CommRing R] [IsDedekindDomain R] {K : Type v} [Field K] [Algebra R K] [IsFractionRing R K] (v : IsDedekindDomain.HeightOneSpectrum R) (x : Kˣ) : ↑(v.valuationOfNeZeroToFun x) = (IsDedekindDomain.HeightOneSpectrum.valuation K v) ↑x - IsDedekindDomain.HeightOneSpectrum.valuationOfNeZero_eq 📋 Mathlib.RingTheory.DedekindDomain.SelmerGroup
{R : Type u} [CommRing R] [IsDedekindDomain R] {K : Type v} [Field K] [Algebra R K] [IsFractionRing R K] (v : IsDedekindDomain.HeightOneSpectrum R) (x : Kˣ) : ↑(v.valuationOfNeZero x) = (IsDedekindDomain.HeightOneSpectrum.valuation K v) ↑x
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59