Loogle!
Result
Found 149 declarations mentioning CommGroupWithZero.
- CommGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.Defs
(G₀ : Type u_2) : Type u_2 - CommGroupWithZero.toCommMonoidWithZero 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : CommMonoidWithZero G₀ - CommGroupWithZero.toDiv 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : Div G₀ - CommGroupWithZero.toGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : GroupWithZero G₀ - CommGroupWithZero.toInv 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : Inv G₀ - CommGroupWithZero.toNontrivial 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : Nontrivial G₀ - CommGroupWithZero.toZPow 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : ZPow G₀ - CommGroupWithZero.inv_zero 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] : 0⁻¹ = 0 - CommGroupWithZero.zpow_zero' 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] (a : G₀) : a ^ 0 = 1 - CommGroupWithZero.div_eq_mul_inv 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] (a b : G₀) : a / b = a * b⁻¹ - CommGroupWithZero.zpow_neg' 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] (n : ℕ) (a : G₀) : a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹ - CommGroupWithZero.mul_inv_cancel 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] (a : G₀) : a ≠ 0 → a * a⁻¹ = 1 - CommGroupWithZero.zpow_succ' 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [self : CommGroupWithZero G₀] (n : ℕ) (a : G₀) : a ^ ↑n.succ = a ^ ↑n * a - CommGroupWithZero.mk 📋 Mathlib.Algebra.GroupWithZero.Defs
{G₀ : Type u_2} [toCommMonoidWithZero : CommMonoidWithZero G₀] [toInv : Inv G₀] [toDiv : Div G₀] [toZPow : ZPow G₀] (div_eq_mul_inv : ∀ (a b : G₀), a / b = a * b⁻¹ := by intros; rfl) (zpow_zero' : ∀ (a : G₀), a ^ 0 = 1 := by intros; rfl) (zpow_succ' : ∀ (n : ℕ) (a : G₀), a ^ ↑n.succ = a ^ ↑n * a := by intros; rfl) (zpow_neg' : ∀ (n : ℕ) (a : G₀), a ^ Int.negSucc n = (a ^ ↑n.succ)⁻¹ := by intros; rfl) [toNontrivial : Nontrivial G₀] (inv_zero : 0⁻¹ = 0) (mul_inv_cancel : ∀ (a : G₀), a ≠ 0 → a * a⁻¹ = 1) : CommGroupWithZero G₀ - div_mul_eq_mul_div₀ 📋 Mathlib.Algebra.GroupWithZero.Basic
{G₀ : Type u_2} [CommGroupWithZero G₀] (a b c : G₀) : a / c * b = a * b / c - div_sq_cancel 📋 Mathlib.Algebra.GroupWithZero.Basic
{G₀ : Type u_2} [CommGroupWithZero G₀] (a b : G₀) : a ^ 2 * b / a = a * b - Function.Injective.commGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.InjSurj
{G₀ : Type u_2} {G₀' : Type u_4} [CommGroupWithZero G₀] [Zero G₀'] [Mul G₀'] [One G₀'] [Inv G₀'] [Div G₀'] [Pow G₀' ℕ] [Pow G₀' ℤ] (f : G₀' → G₀) (hf : Function.Injective f) (zero : f 0 = 0) (one : f 1 = 1) (mul : ∀ (x y : G₀'), f (x * y) = f x * f y) (inv : ∀ (x : G₀'), f x⁻¹ = (f x)⁻¹) (div : ∀ (x y : G₀'), f (x / y) = f x / f y) (npow : ∀ (x : G₀') (n : ℕ), f (x ^ n) = f x ^ n) (zpow : ∀ (x : G₀') (n : ℤ), f (x ^ n) = f x ^ n) : CommGroupWithZero G₀' - Function.Surjective.commGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.InjSurj
{G₀ : Type u_2} {G₀' : Type u_4} [CommGroupWithZero G₀] [Zero G₀'] [Mul G₀'] [One G₀'] [Inv G₀'] [Div G₀'] [Pow G₀' ℕ] [Pow G₀' ℤ] (h01 : 0 ≠ 1) (f : G₀ → G₀') (hf : Function.Surjective f) (zero : f 0 = 0) (one : f 1 = 1) (mul : ∀ (x y : G₀), f (x * y) = f x * f y) (inv : ∀ (x : G₀), f x⁻¹ = (f x)⁻¹) (div : ∀ (x y : G₀), f (x / y) = f x / f y) (npow : ∀ (x : G₀) (n : ℕ), f (x ^ n) = f x ^ n) (zpow : ∀ (x : G₀) (n : ℤ), f (x ^ n) = f x ^ n) : CommGroupWithZero G₀' - CommGroupWithZero.toDivisionCommMonoid 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] : DivisionCommMonoid G₀ - commGroupWithZeroOfIsUnitOrEqZero 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{M : Type u_4} [Nontrivial M] [hM : CommMonoidWithZero M] (h : ∀ (a : M), IsUnit a ∨ a = 0) : CommGroupWithZero M - div_div_cancel₀ 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b : G₀} (ha : a ≠ 0) : a / (a / b) = b - mul_div_cancel₀ 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {b : G₀} (a : G₀) (hb : b ≠ 0) : b * (a / b) = a - div_div_cancel_left' 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b : G₀} (ha : a ≠ 0) : a / b / a = b⁻¹ - div_mul_cancel_left₀ 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a : G₀} (ha : a ≠ 0) (b : G₀) : a / (a * b) = b⁻¹ - mul_div_cancel_left_of_imp 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b : G₀} (h : a = 0 → b = 0) : a * b / a = b - mul_div_cancel_of_imp' 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b : G₀} (h : b = 0 → a = 0) : b * (a / b) = a - div_div_div_cancel_left' 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {c : G₀} (a b : G₀) (hc : c ≠ 0) : c / a / (c / b) = b / a - div_mul_div_cancel₀' 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a : G₀} (ha : a ≠ 0) (b c : G₀) : a / b * (c / a) = c / b - mul_div_mul_left 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {c : G₀} (a b : G₀) (hc : c ≠ 0) : c * a / (c * b) = a / b - div_eq_div_of_div_eq_div 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b c d : G₀} (hc : c ≠ 0) (hd : d ≠ 0) (h : a / b = c / d) : a / c = b / d - div_eq_div_iff_div_eq_div' 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b c d : G₀} (hb : b ≠ 0) (hc : c ≠ 0) : a / b = c / d ↔ a / c = b / d - mul_eq_mul_of_div_eq_div 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {b d : G₀} (a c : G₀) (hb : b ≠ 0) (hd : d ≠ 0) (h : a / b = c / d) : a * d = c * b - div_eq_div_iff 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b c d : G₀} (hb : b ≠ 0) (hd : d ≠ 0) : a / b = c / d ↔ a * d = c * b - div_helper 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a : G₀} (b : G₀) (h : a ≠ 0) : 1 / (a * b) * a = 1 / b - inv_mul_eq_inv_mul_iff 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b c d : G₀} (hb : b ≠ 0) (hd : d ≠ 0) : b⁻¹ * a = d⁻¹ * c ↔ a * d = c * b - mul_inv_eq_mul_inv_iff 📋 Mathlib.Algebra.GroupWithZero.Units.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] {a b c d : G₀} (hb : b ≠ 0) (hd : d ≠ 0) : a * b⁻¹ = c * d⁻¹ ↔ a * d = c * b - Semifield.toCommGroupWithZero 📋 Mathlib.Algebra.Field.Defs
{K : Type u_2} [self : Semifield K] : CommGroupWithZero K - div_le_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : b / c ≤ a ↔ b ≤ c * a - div_lt_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : b / c < a ↔ b < c * a - le_div_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a ≤ b / c ↔ c * a ≤ b - lt_div_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a < b / c ↔ c * a < b - le_mul_div_mul_left 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [Preorder G₀] {a b c : G₀} (h : a / b ≤ 0) : a / b ≤ c * a / (c * b) - mul_div_mul_left_le 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [Preorder G₀] {a b c : G₀} (h : 0 ≤ a / b) : c * a / (c * b) ≤ a / b - inv_mul_le_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : c⁻¹ * b ≤ a ↔ b ≤ a * c - inv_mul_lt_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : c⁻¹ * b < a ↔ b < a * c - le_inv_mul_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a ≤ c⁻¹ * b ↔ a * c ≤ b - le_mul_inv_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a ≤ b * c⁻¹ ↔ c * a ≤ b - lt_inv_mul_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a < c⁻¹ * b ↔ a * c < b - lt_mul_inv_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : a < b * c⁻¹ ↔ c * a < b - mul_inv_le_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : b * c⁻¹ ≤ a ↔ b ≤ c * a - mul_inv_lt_iff₀' 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hc : 0 < c) : b * c⁻¹ < a ↔ b < c * a - div_le_comm₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hb : 0 < b) (hc : 0 < c) : a / b ≤ c ↔ a / c ≤ b - div_lt_comm₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (hb : 0 < b) (hc : 0 < c) : a / b < c ↔ a / c < b - le_div_comm₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (ha : 0 < a) (hc : 0 < c) : a ≤ b / c ↔ c ≤ b / a - lt_div_comm₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c : G₀} (ha : 0 < a) (hc : 0 < c) : a < b / c ↔ c < b / a - div_le_div_iff₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c d : G₀} (hb : 0 < b) (hd : 0 < d) : a / b ≤ c / d ↔ a * d ≤ c * b - div_lt_div_iff₀ 📋 Mathlib.Algebra.Order.GroupWithZero.Basic
{G₀ : Type u_3} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {a b c d : G₀} (hb : 0 < b) (hd : 0 < d) : a / b < c / d ↔ a * d < c * b - pow_mem_range_pow_of_coprime 📋 Mathlib.Data.Int.GCD
{α : Type u_1} [CommGroupWithZero α] {m n : ℕ} (hmn : m.Coprime n) (a : α) : (a ^ m ∈ Set.range fun x => x ^ n) ↔ a ∈ Set.range fun x => x ^ n - pow_eq_pow_iff_of_coprime 📋 Mathlib.Data.Int.GCD
{α : Type u_1} [CommGroupWithZero α] {a b : α} {m n : ℕ} (hmn : m.Coprime n) : a ^ m = b ^ n ↔ ∃ c, a = c ^ n ∧ b = c ^ m - WithZero.instCommGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.WithZero
{α : Type u_1} [CommGroup α] : CommGroupWithZero (WithZero α) - LinearOrderedCommGroupWithZero.toCommGroupWithZero 📋 Mathlib.Algebra.Order.GroupWithZero.Canonical
{α : Type u_3} [self : LinearOrderedCommGroupWithZero α] : CommGroupWithZero α - invMonoidWithZeroHom 📋 Mathlib.Algebra.GroupWithZero.Units.Lemmas
{G₀ : Type u_8} [CommGroupWithZero G₀] : G₀ →*₀ G₀ - Equiv.divLeft₀ 📋 Mathlib.Algebra.GroupWithZero.Units.Equiv
{G₀ : Type u_1} [CommGroupWithZero G₀] (a : G₀) (ha : a ≠ 0) : Equiv.Perm G₀ - Equiv.divLeft₀_apply 📋 Mathlib.Algebra.GroupWithZero.Units.Equiv
{G₀ : Type u_1} [CommGroupWithZero G₀] (a : G₀) (ha : a ≠ 0) (x✝ : G₀) : (Equiv.divLeft₀ a ha) x✝ = a / x✝ - Equiv.divLeft₀_symm_apply 📋 Mathlib.Algebra.GroupWithZero.Units.Equiv
{G₀ : Type u_1} [CommGroupWithZero G₀] (a : G₀) (ha : a ≠ 0) (x✝ : G₀) : (Equiv.symm (Equiv.divLeft₀ a ha)) x✝ = a / x✝ - Mathlib.Tactic.FieldSimp.NF.eval_inv 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (l : Mathlib.Tactic.FieldSimp.NF M) : l⁻¹.eval = l.eval⁻¹ - Mathlib.Tactic.FieldSimp.NF.eval_zpow' 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (l : Mathlib.Tactic.FieldSimp.NF M) (r : ℤ) : (l ^ r).eval = Mathlib.Tactic.FieldSimp.zpow' l.eval r - Mathlib.Tactic.FieldSimp.NF.eval_pow 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (l : Mathlib.Tactic.FieldSimp.NF M) (r : ℕ) : (l ^ r).eval = Mathlib.Tactic.FieldSimp.zpow' l.eval ↑r - Mathlib.Tactic.FieldSimp.NF.inv_eq_eval 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {l : Mathlib.Tactic.FieldSimp.NF M} {x : M} (h : x = l.eval) : x⁻¹ = l⁻¹.eval - Mathlib.Tactic.FieldSimp.NF.one_div_eq_eval 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (l : Mathlib.Tactic.FieldSimp.NF M) : 1 / l.eval = l⁻¹.eval - Mathlib.Tactic.FieldSimp.NF.eval_cons 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (p : ℤ × M) (l : Mathlib.Tactic.FieldSimp.NF M) : (p ::ᵣ l).eval = l.eval * Mathlib.Tactic.FieldSimp.zpow' p.2 p.1 - Mathlib.Tactic.FieldSimp.NF.eval_cons_of_pow_eq_zero 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {r : ℤ} (hr : r = 0) {x : M} (hx : x ≠ 0) (l : Mathlib.Tactic.FieldSimp.NF M) : ((r, x) ::ᵣ l).eval = l.eval - Mathlib.Tactic.FieldSimp.NF.zpow_eq_eval 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {l : Mathlib.Tactic.FieldSimp.NF M} {r : ℤ} (hr : r ≠ 0) {x : M} (hx : x = l.eval) : x ^ r = (l ^ r).eval - Mathlib.Tactic.FieldSimp.mul_zpow' 📋 Mathlib.Tactic.FieldSimp.Lemmas
{α : Type u_1} [CommGroupWithZero α] (n : ℤ) (a b : α) : Mathlib.Tactic.FieldSimp.zpow' (a * b) n = Mathlib.Tactic.FieldSimp.zpow' a n * Mathlib.Tactic.FieldSimp.zpow' b n - Mathlib.Tactic.FieldSimp.NF.pow_eq_eval 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {l : Mathlib.Tactic.FieldSimp.NF M} {r : ℕ} (hr : r ≠ 0) {x : M} (hx : x = l.eval) : x ^ r = (l ^ r).eval - Mathlib.Tactic.FieldSimp.NF.eval_cons_eq_eval_of_eq_of_eq 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (r : ℤ) (x : M) {t t' l' : Mathlib.Tactic.FieldSimp.NF M} (h : t.eval = t'.eval) (h' : ((r, x) ::ᵣ t').eval = l'.eval) : ((r, x) ::ᵣ t).eval = l'.eval - Mathlib.Tactic.FieldSimp.list_prod_zpow' 📋 Mathlib.Tactic.FieldSimp.Lemmas
{α : Type u_1} [CommGroupWithZero α] {r : ℤ} {l : List α} : Mathlib.Tactic.FieldSimp.zpow' l.prod r = (List.map (fun x => Mathlib.Tactic.FieldSimp.zpow' x r) l).prod - Mathlib.Tactic.FieldSimp.NF.cons_eq_div_of_eq_div 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (n : ℤ) (e : M) {t t_n t_d : Mathlib.Tactic.FieldSimp.NF M} (h : t.eval = t_n.eval / t_d.eval) : ((n, e) ::ᵣ t).eval = ((n, e) ::ᵣ t_n).eval / t_d.eval - Mathlib.Tactic.FieldSimp.NF.div_eq_eval₁ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (a₁ : ℤ × M) {a₂ : ℤ × M} {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : l₁.eval / (a₂ ::ᵣ l₂).eval = l.eval) : (a₁ ::ᵣ l₁).eval / (a₂ ::ᵣ l₂).eval = (a₁ ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.cons_eq_div_of_eq_div' 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (n : ℤ) (e : M) {t t_n t_d : Mathlib.Tactic.FieldSimp.NF M} (h : t.eval = t_n.eval / t_d.eval) : ((-n, e) ::ᵣ t).eval = t_n.eval / ((n, e) ::ᵣ t_d).eval - Mathlib.Tactic.FieldSimp.NF.eval_cons_mul_eval 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (n : ℤ) (e : M) {L l l' : Mathlib.Tactic.FieldSimp.NF M} (h : L.eval * l.eval = l'.eval) : ((n, e) ::ᵣ L).eval * l.eval = ((n, e) ::ᵣ l').eval - Mathlib.Tactic.FieldSimp.NF.eval_mul_eval_cons 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (n : ℤ) (e : M) {L l l' : Mathlib.Tactic.FieldSimp.NF M} (h : L.eval * l.eval = l'.eval) : L.eval * ((n, e) ::ᵣ l).eval = ((n, e) ::ᵣ l').eval - Mathlib.Tactic.FieldSimp.NF.mul_eq_eval₁ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (a₁ : ℤ × M) {a₂ : ℤ × M} {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : l₁.eval * (a₂ ::ᵣ l₂).eval = l.eval) : (a₁ ::ᵣ l₁).eval * (a₂ ::ᵣ l₂).eval = (a₁ ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.mul_eq_eval₃ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {a₁ : ℤ × M} (a₂ : ℤ × M) {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : (a₁ ::ᵣ l₁).eval * l₂.eval = l.eval) : (a₁ ::ᵣ l₁).eval * (a₂ ::ᵣ l₂).eval = (a₂ ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.div_eq_eval₃ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {a₁ : ℤ × M} (a₂ : ℤ × M) {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : (a₁ ::ᵣ l₁).eval / l₂.eval = l.eval) : (a₁ ::ᵣ l₁).eval / (a₂ ::ᵣ l₂).eval = ((-a₂.1, a₂.2) ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.div_eq_eval₂ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (r₁ r₂ : ℤ) (x : M) {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : l₁.eval / l₂.eval = l.eval) : ((r₁, x) ::ᵣ l₁).eval / ((r₂, x) ::ᵣ l₂).eval = ((r₁ - r₂, x) ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.cons_zero_eq_div_of_eq_div 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (e : M) {t t_n t_d : Mathlib.Tactic.FieldSimp.NF M} (h : t.eval = t_n.eval / t_d.eval) : ((0, e) ::ᵣ t).eval = ((1, e) ::ᵣ t_n).eval / ((1, e) ::ᵣ t_d).eval - Mathlib.Tactic.FieldSimp.NF.mul_eq_eval₂ 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (r₁ r₂ : ℤ) (x : M) {l₁ l₂ l : Mathlib.Tactic.FieldSimp.NF M} (h : l₁.eval * l₂.eval = l.eval) : ((r₁, x) ::ᵣ l₁).eval * ((r₂, x) ::ᵣ l₂).eval = ((r₁ + r₂, x) ::ᵣ l).eval - Mathlib.Tactic.FieldSimp.NF.eval_cons_mul_eval_cons_neg 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] (n : ℤ) {e : M} (he : e ≠ 0) {L l l' : Mathlib.Tactic.FieldSimp.NF M} (h : L.eval * l.eval = l'.eval) : ((n, e) ::ᵣ L).eval * ((-n, e) ::ᵣ l).eval = l'.eval - Mathlib.Tactic.FieldSimp.NF.eval_mul_eval_cons_zero 📋 Mathlib.Tactic.FieldSimp.Lemmas
{M : Type u_1} [CommGroupWithZero M] {e : M} {L l l' l₀ : Mathlib.Tactic.FieldSimp.NF M} (h : L.eval * l.eval = l'.eval) (h' : ((0, e) ::ᵣ l).eval = l₀.eval) : L.eval * l₀.eval = ((0, e) ::ᵣ l').eval - Rat.commGroupWithZero 📋 Mathlib.Algebra.Ring.Rat
: CommGroupWithZero ℚ - Lex.instCommGroupWithZero 📋 Mathlib.Algebra.Order.GroupWithZero.Synonym
{α : Type u_1} [CommGroupWithZero α] : CommGroupWithZero (Lex α) - OrderDual.instCommGroupWithZero 📋 Mathlib.Algebra.Order.GroupWithZero.Synonym
{α : Type u_1} [CommGroupWithZero α] : CommGroupWithZero αᵒᵈ - divMonoidWithZeroHom 📋 Mathlib.Algebra.GroupWithZero.Prod
{M₀ : Type u_1} [CommGroupWithZero M₀] : M₀ × M₀ →*₀ M₀ - divMonoidWithZeroHom_apply 📋 Mathlib.Algebra.GroupWithZero.Prod
{M₀ : Type u_1} [CommGroupWithZero M₀] (a✝ : M₀ × M₀) : divMonoidWithZeroHom a✝ = (↑divMonoidHom).toFun a✝ - ULift.commGroupWithZero 📋 Mathlib.Algebra.GroupWithZero.ULift
{α : Type u} [CommGroupWithZero α] : CommGroupWithZero (ULift.{u_1, u} α) - Units.mk0_prod 📋 Mathlib.Algebra.BigOperators.GroupWithZero.Finset
{ι : Type u_1} {G₀ : Type u_3} [CommGroupWithZero G₀] (s : Finset ι) (f : ι → G₀) (h : ∏ i ∈ s, f i ≠ 0) : Units.mk0 (∏ i ∈ s, f i) h = ∏ i ∈ s.attach, Units.mk0 (f ↑i) ⋯ - CommGroupWithZero.instStrongNormalizedGCDMonoid 📋 Mathlib.Algebra.GCDMonoid.Basic
(G₀ : Type u_2) [CommGroupWithZero G₀] [DecidableEq G₀] : StrongNormalizedGCDMonoid G₀ - CommGroupWithZero.normalize_eq_one 📋 Mathlib.Algebra.GCDMonoid.Basic
(G₀ : Type u_2) [CommGroupWithZero G₀] [DecidableEq G₀] {a : G₀} (h0 : a ≠ 0) : normalize a = 1 - CommGroupWithZero.coe_normUnit 📋 Mathlib.Algebra.GCDMonoid.Basic
(G₀ : Type u_2) [CommGroupWithZero G₀] [DecidableEq G₀] {a : G₀} (h0 : a ≠ 0) : ↑(normUnit a) = a⁻¹ - star_div₀ 📋 Mathlib.Algebra.Star.Basic
{R : Type u} [CommGroupWithZero R] [StarMul R] (x y : R) : star (x / y) = star x / star y - OreLocalization.instCommGroupWithZeroNonZeroDivisors 📋 Mathlib.RingTheory.OreLocalization.NonZeroDivisors
{R : Type u_1} [CommMonoidWithZero R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] : CommGroupWithZero (OreLocalization (nonZeroDivisors R) R) - DirectLimit.instCommGroupWithZeroOfMonoidWithZeroHomClass 📋 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 : ι) → CommGroupWithZero (G i)] [∀ (i j : ι) (h : i ≤ j), MonoidWithZeroHomClass (T h) (G i) (G j)] : CommGroupWithZero (DirectLimit G f) - Set.preimage_const_mul_Ici₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Ici a = Set.Ici (a / c) - Set.preimage_const_mul_Iic₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Iic a = Set.Iic (a / c) - Set.preimage_const_mul_Iio₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Iio a = Set.Iio (a / c) - Set.preimage_const_mul_Ioi₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Ioi a = Set.Ioi (a / c) - Set.preimage_const_mul_Icc₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] (a b : G₀) {c : G₀} (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Icc a b = Set.Icc (a / c) (b / c) - Set.preimage_const_mul_Ico₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a b : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Ico a b = Set.Ico (a / c) (b / c) - Set.preimage_const_mul_Ioc₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a b : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Ioc a b = Set.Ioc (a / c) (b / c) - Set.preimage_const_mul_Ioo₀ 📋 Mathlib.Algebra.Order.Group.Pointwise.Interval
{G₀ : Type u_2} [CommGroupWithZero G₀] [PartialOrder G₀] [PosMulReflectLT G₀] {c : G₀} (a b : G₀) (h : 0 < c) : (fun x => c * x) ⁻¹' Set.Ioo a b = Set.Ioo (a / c) (b / c) - MonoidWithZeroHom.mker_inverse 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{H : Type u_2} [CommGroupWithZero H] : MonoidHom.mker MonoidWithZero.inverse = ⊥ - MonoidWithZeroHom.instCommGroupWithZeroSubtypeMemSubmonoidMrange 📋 Mathlib.Algebra.GroupWithZero.Submonoid.Instances
{G : Type u_1} {H : Type u_2} [GroupWithZero G] [CommGroupWithZero H] (f : G →*₀ H) : CommGroupWithZero ↥(MonoidHom.mrange f) - MonoidWithZeroHom.instCommGroupWithZeroValueGroup₀ 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) : CommGroupWithZero f.ValueGroup₀ - MonoidWithZeroHom.ValueGroup₀.mk 📋 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) : f.ValueGroup₀ - MonoidWithZeroHom.valueGroup.mk 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) (r s : A) (hr : f r ≠ 0) (hs : f s ≠ 0) : ↥f.valueGroup - MonoidWithZeroHom.mem_valueGroup_iff_of_comm 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) {y : Bˣ} : y ∈ f.valueGroup ↔ ∃ a, f a ≠ 0 ∧ ∃ x, f a * ↑y = f x - 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.mem_valueGroup_iff_of_comm' 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) {y : Bˣ} : y ∈ f.valueGroup ↔ ∃ a, f a ≠ 0 ∧ ∃ x, f x ≠ 0 ∧ f a * ↑y = f x - MonoidWithZeroHom.valueGroup.mk_inj 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) {r₁ s₁ r₂ s₂ : A} {hr₁ : f r₁ ≠ 0} {hs₁ : f s₁ ≠ 0} {hr₂ : f r₂ ≠ 0} {hs₂ : f s₂ ≠ 0} : MonoidWithZeroHom.valueGroup.mk f r₁ s₁ hr₁ hs₁ = MonoidWithZeroHom.valueGroup.mk f r₂ s₂ hr₂ hs₂ ↔ f (r₁ * s₂) = f (r₂ * s₁) - 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.mk_mul 📋 Mathlib.Algebra.GroupWithZero.Range
{A : Type u_1} {B : Type u_2} [MonoidWithZero A] [CommGroupWithZero B] (f : A →*₀ B) {r₁ s₁ r₂ s₂ : A} {hr₁ : f r₁ ≠ 0} {hs₁ : f s₁ ≠ 0} {hr₂ : f r₂ ≠ 0} {hs₂ : f s₂ ≠ 0} : MonoidWithZeroHom.valueGroup.mk f r₁ s₁ hr₁ hs₁ * MonoidWithZeroHom.valueGroup.mk f r₂ s₂ hr₂ hs₂ = MonoidWithZeroHom.valueGroup.mk f (r₁ * r₂) (s₁ * s₂) ⋯ ⋯ - 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 ⋯ ⋯) - Valuation.instCommGroupWithZeroSubtypeMemSubmonoidMrangeMonoidWithZeroHomOfClass 📋 Mathlib.RingTheory.Valuation.Basic
{K : Type u_4} {Γ₀ : Type u_6} [LinearOrderedCommGroupWithZero Γ₀] [DivisionRing K] (v : Valuation K Γ₀) : CommGroupWithZero ↥(MonoidHom.mrange (MonoidWithZeroHom.ofClass v)) - ValuationRing.commGroupWithZero 📋 Mathlib.RingTheory.Valuation.ValuationRing
(A : Type u) [CommRing A] (K : Type v) [Field K] [Algebra A K] : CommGroupWithZero (ValuationRing.ValueGroup A K) - Multipliable.congr_cofinite₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} [SeparatelyContinuousMul K] (hf : Multipliable f) (hf' : ∀ (a : α), f a ≠ 0) (hfg : ∀ᶠ (a : α) in Filter.cofinite, f a = g a) : Multipliable g - Multipliable.inv₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f : α → K} {L : SummationFilter α} [ContinuousInv₀ K] (h : Multipliable f L) (ne_zero : ∏'[L] (x : α), f x ≠ 0) : Multipliable (fun x => (f x)⁻¹) L - HasProd.inv₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f : α → K} {L : SummationFilter α} {a : K} [ContinuousInv₀ K] (h : HasProd f a L) (ha : a ≠ 0) : HasProd (fun x => (f x)⁻¹) a⁻¹ L - Multipliable.div₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} {L : SummationFilter α} [ContinuousInv₀ K] [ContinuousMul K] (hf : Multipliable f L) (hg : Multipliable g L) (ne_zero : ∏'[L] (x : α), g x ≠ 0) : Multipliable (fun x => f x / g x) L - Multipliable.tprod_inv₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f : α → K} {L : SummationFilter α} [ContinuousInv₀ K] [T2Space K] [L.NeBot] (h : Multipliable f L) (ne_zero : ∏'[L] (x : α), f x ≠ 0) : ∏'[L] (x : α), (f x)⁻¹ = (∏'[L] (x : α), f x)⁻¹ - HasProd.div₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} {L : SummationFilter α} [ContinuousInv₀ K] [ContinuousMul K] {a b : K} (hf : HasProd f a L) (hg : HasProd g b L) (hb : b ≠ 0) : HasProd (fun x => f x / g x) (a / b) L - HasProd.congr_cofinite₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} [SeparatelyContinuousMul K] {c : K} (hc : HasProd f c) {s : Finset α} (hs : ∀ a ∈ s, f a ≠ 0) (hs' : ∀ a ∉ s, f a = g a) : HasProd g (c * ((∏ i ∈ s, g i) / ∏ i ∈ s, f i)) - Multipliable.tsum_congr_cofinite₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} [SeparatelyContinuousMul K] [T2Space K] (hc : Multipliable f) {s : Finset α} (hs : ∀ a ∈ s, f a ≠ 0) (hs' : ∀ a ∉ s, f a = g a) : ∏' (i : α), g i = (∏' (i : α), f i) * ((∏ i ∈ s, g i) / ∏ i ∈ s, f i) - Multipliable.tprod_div₀ 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {K : Type u_4} [CommGroupWithZero K] [TopologicalSpace K] {f g : α → K} {L : SummationFilter α} [ContinuousInv₀ K] [ContinuousMul K] [T2Space K] [L.NeBot] (hf : Multipliable f L) (hg : Multipliable g L) (ne_zero : ∏'[L] (x : α), g x ≠ 0) : ∏'[L] (x : α), f x / g x = (∏'[L] (x : α), f x) / ∏'[L] (x : α), g x - SignType.instCommGroupWithZero 📋 Mathlib.Basic.Sign.Defs
: CommGroupWithZero SignType - ArithmeticFunction.IsMultiplicative.map_gcd 📋 Mathlib.NumberTheory.ArithmeticFunction.Defs
{R : Type u_1} [CommGroupWithZero R] {f : ArithmeticFunction R} (hf : f.IsMultiplicative) {x y : ℕ} (hf_lcm : f (x.lcm y) ≠ 0) : f (x.gcd y) = f x * f y / f (x.lcm y) - ArithmeticFunction.IsMultiplicative.map_lcm 📋 Mathlib.NumberTheory.ArithmeticFunction.Defs
{R : Type u_1} [CommGroupWithZero R] {f : ArithmeticFunction R} (hf : f.IsMultiplicative) {x y : ℕ} (hf_gcd : f (x.gcd y) ≠ 0) : f (x.lcm y) = f x * f y / f (x.gcd y) - ArithmeticFunction.IsMultiplicative.pdiv 📋 Mathlib.NumberTheory.ArithmeticFunction.Zeta
{R : Type u_1} [CommGroupWithZero R] {f g : ArithmeticFunction R} (hf : f.IsMultiplicative) (hg : g.IsMultiplicative) : (f.pdiv g).IsMultiplicative - RatFunc.liftMonoidWithZeroHom 📋 Mathlib.FieldTheory.RatFunc.Basic
{G₀ : Type u_1} {R : Type u_3} [CommGroupWithZero G₀] [CommRing R] (φ : Polynomial R →*₀ G₀) (hφ : nonZeroDivisors (Polynomial R) ≤ Submonoid.comap φ (nonZeroDivisors G₀)) : RatFunc R →*₀ G₀ - RatFunc.liftMonoidWithZeroHom_injective 📋 Mathlib.FieldTheory.RatFunc.Basic
{G₀ : Type u_1} {R : Type u_3} [CommGroupWithZero G₀] [CommRing R] [Nontrivial R] (φ : Polynomial R →*₀ G₀) (hφ : Function.Injective ⇑φ) (hφ' : nonZeroDivisors (Polynomial R) ≤ Submonoid.comap φ (nonZeroDivisors G₀) := ⋯) : Function.Injective ⇑(RatFunc.liftMonoidWithZeroHom φ hφ') - RatFunc.liftMonoidWithZeroHom_apply 📋 Mathlib.FieldTheory.RatFunc.Basic
{K : Type u} [Field K] {L : Type u_1} [CommGroupWithZero L] (φ : Polynomial K →*₀ L) (hφ : nonZeroDivisors (Polynomial K) ≤ Submonoid.comap φ (nonZeroDivisors L)) (f : RatFunc K) : (RatFunc.liftMonoidWithZeroHom φ hφ) f = φ f.num / φ f.denom - RatFunc.liftMonoidWithZeroHom_apply_div 📋 Mathlib.FieldTheory.RatFunc.Basic
{K : Type u} [CommRing K] [IsDomain K] {L : Type u_1} [CommGroupWithZero L] (φ : Polynomial K →*₀ L) (hφ : nonZeroDivisors (Polynomial K) ≤ Submonoid.comap φ (nonZeroDivisors L)) (p q : Polynomial K) : (RatFunc.liftMonoidWithZeroHom φ hφ) ((algebraMap (Polynomial K) (RatFunc K)) p / (algebraMap (Polynomial K) (RatFunc K)) q) = φ p / φ q - RatFunc.liftMonoidWithZeroHom_apply_ofFractionRing_mk 📋 Mathlib.FieldTheory.RatFunc.Basic
{G₀ : Type u_1} {R : Type u_3} [CommGroupWithZero G₀] [CommRing R] (φ : Polynomial R →*₀ G₀) (hφ : nonZeroDivisors (Polynomial R) ≤ Submonoid.comap φ (nonZeroDivisors G₀)) (n : Polynomial R) (d : ↥(nonZeroDivisors (Polynomial R))) : (RatFunc.liftMonoidWithZeroHom φ hφ) { toFractionRing := Localization.mk n d } = φ n / φ ↑d - RatFunc.liftMonoidWithZeroHom_apply_div' 📋 Mathlib.FieldTheory.RatFunc.Basic
{K : Type u} [CommRing K] [IsDomain K] {L : Type u_1} [CommGroupWithZero L] (φ : Polynomial K →*₀ L) (hφ : nonZeroDivisors (Polynomial K) ≤ Submonoid.comap φ (nonZeroDivisors L)) (p q : Polynomial K) : (RatFunc.liftMonoidWithZeroHom φ hφ) ((algebraMap (Polynomial K) (RatFunc K)) p) / (RatFunc.liftMonoidWithZeroHom φ hφ) ((algebraMap (Polynomial K) (RatFunc K)) q) = φ p / φ q - ArithmeticFunction.prod_eq_iff_prod_pow_moebius_eq_of_nonzero 📋 Mathlib.NumberTheory.ArithmeticFunction.Moebius
{R : Type u_1} [CommGroupWithZero R] {f g : ℕ → R} (hf : ∀ (n : ℕ), 0 < n → f n ≠ 0) (hg : ∀ (n : ℕ), 0 < n → g n ≠ 0) : (∀ n > 0, ∏ i ∈ n.divisors, f i = g n) ↔ ∀ n > 0, ∏ x ∈ n.divisorsAntidiagonal, g x.2 ^ ArithmeticFunction.moebius x.1 = f n - ArithmeticFunction.prod_eq_iff_prod_pow_moebius_eq_on_of_nonzero 📋 Mathlib.NumberTheory.ArithmeticFunction.Moebius
{R : Type u_1} [CommGroupWithZero R] (s : Set ℕ) (hs : ∀ (m n : ℕ), m ∣ n → n ∈ s → m ∈ s) {f g : ℕ → R} (hf : ∀ n > 0, f n ≠ 0) (hg : ∀ n > 0, g n ≠ 0) : (∀ n > 0, n ∈ s → ∏ i ∈ n.divisors, f i = g n) ↔ ∀ n > 0, n ∈ s → ∏ x ∈ n.divisorsAntidiagonal, g x.2 ^ ArithmeticFunction.moebius x.1 = f n - MulChar.inv_apply_eq_inv' 📋 Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_3} [CommGroupWithZero R'] (χ : MulChar R R') (a : R) : χ⁻¹ a = (χ a)⁻¹ - MulChar.inv_apply' 📋 Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommGroupWithZero R] (χ : MulChar R R') (a : R) : χ⁻¹ a = χ a⁻¹ - MulChar.zpow_apply_coe 📋 Mathlib.NumberTheory.MulChar.Basic
{R : Type u_4} [CommGroupWithZero R] {R' : Type u_5} [CommRing R'] (χ : MulChar R R') (n : ℤ) (a : Rˣ) : (χ ^ n) ↑a = χ ↑(a ^ n)
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