Loogle!
Result
Found 224 declarations mentioning IsCancelMulZero. Of these, only the first 200 are shown.
- IsCancelMulZero π Mathlib.Algebra.GroupWithZero.Defs
(Mβ : Type u) [Mul Mβ] [Zero Mβ] : Prop - IsCancelMulZero.toIsLeftCancelMulZero π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u} {instβ : Mul Mβ} {instβΒΉ : Zero Mβ} [self : IsCancelMulZero Mβ] : IsLeftCancelMulZero Mβ - IsCancelMulZero.toIsRightCancelMulZero π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u} {instβ : Mul Mβ} {instβΒΉ : Zero Mβ} [self : IsCancelMulZero Mβ] : IsRightCancelMulZero Mβ - IsCancelMulZero.mk π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u} [Mul Mβ] [Zero Mβ] [toIsLeftCancelMulZero : IsLeftCancelMulZero Mβ] [toIsRightCancelMulZero : IsRightCancelMulZero Mβ] : IsCancelMulZero Mβ - IsLeftCancelMulZero.to_isCancelMulZero π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u_1} [CommMagma Mβ] [Zero Mβ] [IsLeftCancelMulZero Mβ] : IsCancelMulZero Mβ - IsRightCancelMulZero.to_isCancelMulZero π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u_1} [CommMagma Mβ] [Zero Mβ] [IsRightCancelMulZero Mβ] : IsCancelMulZero Mβ - isCancelMulZero_iff π Mathlib.Algebra.GroupWithZero.Defs
(Mβ : Type u) [Mul Mβ] [Zero Mβ] : IsCancelMulZero Mβ β IsLeftCancelMulZero Mβ β§ IsRightCancelMulZero Mβ - isCancelMulZero_iff_forall_isRegular π Mathlib.Algebra.GroupWithZero.Defs
{Mβ : Type u_2} [Mul Mβ] [Zero Mβ] : IsCancelMulZero Mβ β β {a : Mβ}, a β 0 β IsRegular a - instIsCancelMulZero π Mathlib.Algebra.GroupWithZero.Basic
{Gβ : Type u_2} [GroupWithZero Gβ] : IsCancelMulZero Gβ - Function.Injective.isCancelMulZero π Mathlib.Algebra.GroupWithZero.InjSurj
{Mβ : Type u_1} {Mβ' : Type u_3} [Mul Mβ] [Zero Mβ] [Mul Mβ'] [Zero Mβ'] (f : Mβ β Mβ') (hf : Function.Injective f) (zero : f 0 = 0) (mul : β (x y : Mβ), f (x * y) = f x * f y) [IsCancelMulZero Mβ'] : IsCancelMulZero Mβ - MulOpposite.instIsCancelMulZero π Mathlib.Algebra.GroupWithZero.Opposite
{Ξ± : Type u_1} [Mul Ξ±] [Zero Ξ±] [IsCancelMulZero Ξ±] : IsCancelMulZero Ξ±α΅α΅α΅ - MulOpposite.isCancelMulZero_iff π Mathlib.Algebra.GroupWithZero.Opposite
{Ξ± : Type u_1} [Mul Ξ±] [Zero Ξ±] : IsCancelMulZero Ξ±α΅α΅α΅ β IsCancelMulZero Ξ± - IsDomain.toIsCancelMulZero π Mathlib.Algebra.Ring.Defs
{Ξ± : Type u} {instβ : Semiring Ξ±} [self : IsDomain Ξ±] : IsCancelMulZero Ξ± - IsDomain.mk π Mathlib.Algebra.Ring.Defs
{Ξ± : Type u} [Semiring Ξ±] [toIsCancelMulZero : IsCancelMulZero Ξ±] [toNontrivial : Nontrivial Ξ±] : IsDomain Ξ± - Int.instIsCancelMulZero π Mathlib.Algebra.Ring.Int.Defs
: IsCancelMulZero β€ - Subsingleton.to_isCancelMulZero π Mathlib.Algebra.Ring.Basic
(Ξ± : Type u_3) [Mul Ξ±] [Zero Ξ±] [Subsingleton Ξ±] : IsCancelMulZero Ξ± - isCancelMulZero_iff_isDomain_or_subsingleton π Mathlib.Algebra.Ring.Basic
(Ξ± : Type u_3) [Semiring Ξ±] : IsCancelMulZero Ξ± β IsDomain Ξ± β¨ Subsingleton Ξ± - isDomain_iff_cancelMulZero_and_nontrivial π Mathlib.Algebra.Ring.Basic
(Ξ± : Type u_3) [Semiring Ξ±] : IsDomain Ξ± β IsCancelMulZero Ξ± β§ Nontrivial Ξ± - NoZeroDivisors.to_isCancelMulZero π Mathlib.Algebra.Ring.Basic
(R : Type u_3) [NonUnitalNonAssocRing R] [NoZeroDivisors R] : IsCancelMulZero R - isCancelMulZero_iff_noZeroDivisors π Mathlib.Algebra.Ring.Basic
{R : Type u_3} [NonUnitalNonAssocRing R] : IsCancelMulZero R β NoZeroDivisors R - noZeroDivisors_tfae π Mathlib.Algebra.Ring.Basic
{R : Type u_3} [NonUnitalNonAssocRing R] : [NoZeroDivisors R, IsLeftCancelMulZero R, IsRightCancelMulZero R, IsCancelMulZero R].TFAE - Nat.instIsCancelMulZero π Mathlib.Algebra.GroupWithZero.Nat
: IsCancelMulZero β - IsRegular.of_ne_zero π Mathlib.Algebra.GroupWithZero.Regular
{R : Type u_1} [MulZeroClass R] [IsCancelMulZero R] {a : R} (a0 : a β 0) : IsRegular a - isRegular_iff_ne_zero π Mathlib.Algebra.GroupWithZero.Regular
{R : Type u_1} [MulZeroClass R] [IsCancelMulZero R] {a : R} [Nontrivial R] : IsRegular a β a β 0 - instIsCancelMulZero_1 π Mathlib.Algebra.Order.GroupWithZero.Canonical
{Ξ± : Type u_1} [LinearOrderedCommMonoidWithZero Ξ±] : IsCancelMulZero Ξ± - dvd_and_not_dvd_iff π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {x y : Ξ±} : x β£ y β§ Β¬y β£ x β DvdNotUnit x y - dvd_antisymm π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] : a β£ b β b β£ a β a = b - dvd_antisymm' π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] : a β£ b β b β£ a β b = a - Dvd.dvd.antisymm π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] : a β£ b β b β£ a β a = b - Dvd.dvd.antisymm' π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] : a β£ b β b β£ a β b = a - eq_of_forall_dvd π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] (h : β (c : Ξ±), a β£ c β b β£ c) : a = b - eq_of_forall_dvd' π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} [Subsingleton Ξ±Λ£] (h : β (c : Ξ±), c β£ a β c β£ b) : a = b - IsPrimal.mul π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_2} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {m n : Ξ±} (hm : IsPrimal m) (hn : IsPrimal n) : IsPrimal (m * n) - mul_dvd_left_iff_isUnit π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} (ha0 : a β 0) : a * b β£ a β IsUnit b - mul_dvd_right_iff_isUnit π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b : Ξ±} (ha0 : a β 0) : b * a β£ a β IsUnit b - mul_dvd_mul_iff_right π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a b c : Ξ±} (hc : c β 0) : a * c β£ b * c β a β£ b - pow_dvd_pow_iff π Mathlib.Algebra.GroupWithZero.Divisibility
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a : Ξ±} {m n : β} (haβ : a β 0) (ha : Β¬IsUnit a) : a ^ n β£ a ^ m β n β€ m - MulEquiv.isCancelMulZero_iff π Mathlib.Algebra.Ring.Equiv
{A : Type u_7} {B : Type u_8} [MulZeroClass A] [MulZeroClass B] (e : A β* B) : IsCancelMulZero A β IsCancelMulZero B - Lex.instIsCancelMulZero π Mathlib.Algebra.Order.GroupWithZero.Synonym
{Ξ± : Type u_1} [Mul Ξ±] [Zero Ξ±] [IsCancelMulZero Ξ±] : IsCancelMulZero (Lex Ξ±) - OrderDual.instIsCancelMulZero π Mathlib.Algebra.Order.GroupWithZero.Synonym
{Ξ± : Type u_1} [Mul Ξ±] [Zero Ξ±] [IsCancelMulZero Ξ±] : IsCancelMulZero Ξ±α΅α΅ - IsAddTorsionFree.of_isDomain_charZero π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} [Semiring R] [IsCancelMulZero R] [CharZero R] : IsAddTorsionFree R - IsAddTorsionFree.of_isTorsionFree π Mathlib.Algebra.Module.Torsion.Free
(R : Type u_1) (M : Type u_3) [Semiring R] [AddCommMonoid M] [Module R M] [Module.IsTorsionFree R M] [IsCancelMulZero R] [CharZero R] : IsAddTorsionFree M - IsSMulRegular.of_ne_zero π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) : IsSMulRegular M r - smul_right_injective π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} (M : Type u_3) [Semiring R] [AddCommMonoid M] [Module R M] {r : R} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) : Function.Injective fun x => r β’ x - smul_ne_zero π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) (hm : m β 0) : r β’ m β 0 - smul_eq_zero_iff_left π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hm : m β 0) : r β’ m = 0 β r = 0 - smul_eq_zero_iff_right π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) : r β’ m = 0 β m = 0 - smul_ne_zero_iff_left π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hm : m β 0) : r β’ m β 0 β r β 0 - smul_ne_zero_iff_right π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) : r β’ m β 0 β m β 0 - smul_eq_zero π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] : r β’ m = 0 β r = 0 β¨ m = 0 - smul_ne_zero_iff π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {m : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] : r β’ m β 0 β r β 0 β§ m β 0 - smul_left_injective π Mathlib.Algebra.Module.Torsion.Free
(R : Type u_1) {M : Type u_3} [Ring R] [AddCommGroup M] [Module R M] {m : M} [IsCancelMulZero R] [Module.IsTorsionFree R M] (hm : m β 0) : Function.Injective fun x => x β’ m - smul_right_inj π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {r : R} {mβ mβ : M} [Module.IsTorsionFree R M] [IsCancelMulZero R] (hr : r β 0) : r β’ mβ = r β’ mβ β mβ = mβ - smul_left_inj π Mathlib.Algebra.Module.Torsion.Free
{R : Type u_1} {M : Type u_3} [Ring R] [AddCommGroup M] [Module R M] {m : M} {rβ rβ : R} [IsCancelMulZero R] [Module.IsTorsionFree R M] (hm : m β 0) : rβ β’ m = rβ β’ m β rβ = rβ - PUnit.instIsCancelMulZero π Mathlib.Algebra.Ring.PUnit
: IsCancelMulZero PUnit.{u_1 + 1} - IsAddTorsionFree.of_isCancelMulZero_charZero π Mathlib.Algebra.Ring.CharZero
{R : Type u_2} [Semiring R] [CharZero R] [IsCancelMulZero R] : IsAddTorsionFree R - IsCancelMulZero.of_faithfulSMul π Mathlib.Algebra.Algebra.Basic
(R : Type u_1) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] [FaithfulSMul R A] [IsCancelMulZero A] : IsCancelMulZero R - FaithfulSMul.to_isTorsionFree π Mathlib.Algebra.Algebra.Basic
(R : Type u_1) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] [FaithfulSMul R A] [Nontrivial R] [IsCancelMulZero A] : Module.IsTorsionFree R A - Module.IsTorsionFree.to_faithfulSMul π Mathlib.Algebra.Algebra.Basic
{R : Type u_1} {A : Type u_2} [CommRing R] [Ring A] [Algebra R A] [IsCancelMulZero R] [Nontrivial A] [Module.IsTorsionFree R A] : FaithfulSMul R A - Module.IsTorsionFree.trans_faithfulSMul π Mathlib.Algebra.Algebra.Basic
(R : Type u_1) (A : Type u_3) (M : Type u_4) [CommSemiring R] [Semiring A] [Algebra R A] [FaithfulSMul R A] [Nontrivial R] [IsCancelMulZero A] [AddCommMonoid M] [Module A M] [Module R M] [Module.IsTorsionFree A M] [IsScalarTower R A M] : Module.IsTorsionFree R M - Prime.irreducible π Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} (hp : Prime p) : Irreducible p - irreducible_iff_prime π Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a β Prime a - DvdNotUnit.ne π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q : M} (h : DvdNotUnit p q) : p β q - IsSquare.not_prime π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {a : M} (ha : IsSquare a) : Β¬Prime a - Prime.not_isSquare π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} (hp : Prime p) : Β¬IsSquare p - not_prime_pow π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {a : M} {n : β} (hn : n β 1) : Β¬Prime (a ^ n) - pow_injective_of_not_isUnit π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {q : M} (hq : Β¬IsUnit q) (hq' : q β 0) : Function.Injective fun n => q ^ n - Prime.left_dvd_or_dvd_right_of_dvd_mul π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} (hp : Prime p) {a b : M} : a β£ p * b β p β£ a β¨ a β£ b - pow_inj_of_not_isUnit π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {q : M} (hq : Β¬IsUnit q) (hq' : q β 0) {m n : β} : q ^ m = q ^ n β m = n - Prime.pow_dvd_of_dvd_mul_left π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p a b : M} (hp : Prime p) (n : β) (h : Β¬p β£ a) (h' : p ^ n β£ a * b) : p ^ n β£ b - Prime.pow_dvd_of_dvd_mul_right π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p a b : M} (hp : Prime p) (n : β) (h : Β¬p β£ b) (h' : p ^ n β£ a * b) : p ^ n β£ a - prime_pow_succ_dvd_mul π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p x y : M} (h : Prime p) {i : β} (hxy : p ^ (i + 1) β£ x * y) : p ^ (i + 1) β£ x β¨ p β£ y - Prime.dvd_of_pow_dvd_pow_mul_pow_of_square_not_dvd π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p a b : M} {n : β} (hp : Prime p) (hpow : p ^ n.succ β£ a ^ n.succ * b ^ n) (hb : Β¬p ^ 2 β£ b) : p β£ a - succ_dvd_or_succ_dvd_of_succ_sum_dvd_mul π Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} (hp : Prime p) {a b : M} {k l : β} : p ^ k β£ a β p ^ l β£ b β p ^ (k + l + 1) β£ a * b β p ^ (k + 1) β£ a β¨ p ^ (l + 1) β£ b - Associates.instPartialOrder π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] : PartialOrder (Associates M) - DvdNotUnit.not_associated π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q : M} (h : DvdNotUnit p q) : Β¬Associated p q - Associates.instIsCancelMulZero π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] : IsCancelMulZero (Associates M) - Associates.instNoZeroDivisors π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] : NoZeroDivisors (Associates M) - Prime.associated_of_dvd π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q : M} (p_prime : Prime p) (q_prime : Prime q) (dvd : p β£ q) : Associated p q - Prime.dvd_prime_iff_associated π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q : M} (pp : Prime p) (qp : Prime q) : p β£ q β Associated p q - prime_dvd_prime_iff_eq π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_2} [CommMonoidWithZero M] [IsCancelMulZero M] [Subsingleton MΛ£] {p q : M} (pp : Prime p) (qp : Prime q) : p β£ q β p = q - prime_pow_iff π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} {n : β} : Prime (p ^ n) β Prime p β§ n = 1 - prime_mul_iff π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {x y : M} : Prime (x * y) β Prime x β§ IsUnit y β¨ IsUnit x β§ Prime y - Associates.dvdNotUnit_iff_lt π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {a b : Associates M} : DvdNotUnit a b β a < b - isUnit_of_associated_mul π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p b : M} (h : Associated (p * b) p) (hp : p β 0) : IsUnit b - associates_irreducible_iff_prime π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {p : Associates M} : Irreducible p β Prime p - eq_of_prime_pow_eq π Mathlib.Algebra.GroupWithZero.Associated
{R : Type u_2} [CommMonoidWithZero R] [IsCancelMulZero R] [Subsingleton RΛ£] {pβ pβ : R} {kβ kβ : β} (hpβ : Prime pβ) (hpβ : Prime pβ) (hkβ : 0 < kβ) (h : pβ ^ kβ = pβ ^ kβ) : pβ = pβ - eq_of_prime_pow_eq' π Mathlib.Algebra.GroupWithZero.Associated
{R : Type u_2} [CommMonoidWithZero R] [IsCancelMulZero R] [Subsingleton RΛ£] {pβ pβ : R} {kβ kβ : β} (hpβ : Prime pβ) (hpβ : Prime pβ) (hkβ : 0 < kβ) (h : pβ ^ kβ = pβ ^ kβ) : pβ = pβ - dvd_prime_pow π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q : M} (hp : Prime p) (n : β) : q β£ p ^ n β β i β€ n, Associated q (p ^ i) - Associated.of_pow_associated_of_prime π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {pβ pβ : M} {kβ kβ : β} (hpβ : Prime pβ) (hpβ : Prime pβ) (hkβ : 0 < kβ) (h : Associated (pβ ^ kβ) (pβ ^ kβ)) : Associated pβ pβ - Associated.of_pow_associated_of_prime' π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {pβ pβ : M} {kβ kβ : β} (hpβ : Prime pβ) (hpβ : Prime pβ) (hkβ : 0 < kβ) (h : Associated (pβ ^ kβ) (pβ ^ kβ)) : Associated pβ pβ - Associated.of_mul_left π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {a b c d : M} (h : Associated (a * b) (c * d)) (hβ : Associated a c) (ha : a β 0) : Associated b d - Associated.of_mul_right π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {a b c d : M} : Associated (a * b) (c * d) β Associated b d β b β 0 β Associated a c - Associates.le_one_iff π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : Associates M} : p β€ 1 β p = 1 - Associates.one_or_eq_of_le_of_prime π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p m : Associates M} (hp : Prime p) (hle : m β€ p) : m = 1 β¨ m = p - Associates.le_of_mul_le_mul_left π Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] (a b c : Associates M) (ha : a β 0) : a * b β€ a * c β b β€ c - IsAbsoluteValue.abvHom' π Mathlib.Algebra.Order.AbsoluteValue.Basic
{S : Type u_4} [Semiring S] [PartialOrder S] [IsCancelMulZero S] {R : Type u_5} [Semiring R] [Nontrivial R] (abv : R β S) [IsAbsoluteValue abv] : R β*β S - IsAbsoluteValue.abv_one' π Mathlib.Algebra.Order.AbsoluteValue.Basic
{S : Type u_4} [Semiring S] [PartialOrder S] [IsCancelMulZero S] {R : Type u_5} [Semiring R] [Nontrivial R] (abv : R β S) [IsAbsoluteValue abv] : abv 1 = 1 - AddMonoidAlgebra.instIsCancelAddZeroOfIsCancelAddOfUniqueSums π Mathlib.Algebra.MonoidAlgebra.NoZeroDivisors
{R : Type u_1} {A : Type u_2} [Semiring R] [IsCancelAdd R] [IsCancelMulZero R] [Add A] [UniqueSums A] : IsCancelMulZero (AddMonoidAlgebra R A) - MonoidAlgebra.instIsCancelMulZeroOfIsCancelAddOfUniqueProds π Mathlib.Algebra.MonoidAlgebra.NoZeroDivisors
{R : Type u_1} {A : Type u_2} [Semiring R] [IsCancelAdd R] [IsCancelMulZero R] [Mul A] [UniqueProds A] : IsCancelMulZero (MonoidAlgebra R A) - Polynomial.instIsCancelMulZeroOfIsCancelAdd π Mathlib.Algebra.Polynomial.Basic
{R : Type u} [Semiring R] [IsCancelAdd R] [IsCancelMulZero R] : IsCancelMulZero (Polynomial R) - GCDMonoid.toIsCancelMulZero π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_2} {instβ : CommMonoidWithZero Ξ±} [self : GCDMonoid Ξ±] : IsCancelMulZero Ξ± - IsGCDMonoid.isCancelMulZero π Mathlib.Algebra.GCDMonoid.Basic
(Ξ± : Type u_1) [CommMonoidWithZero Ξ±] [h : IsGCDMonoid Ξ±] : IsCancelMulZero Ξ± - gcdMonoidOfExistsGCD π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), d β£ a β§ d β£ b β d β£ c) : GCDMonoid Ξ± - gcdMonoidOfExistsLCM π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), a β£ d β§ b β£ d β c β£ d) : GCDMonoid Ξ± - isGCDMonoid_iff_exists_gcd π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_2} [CommMonoidWithZero Ξ±] : IsGCDMonoid Ξ± β IsCancelMulZero Ξ± β§ β (a b : Ξ±), β c, β (d : Ξ±), d β£ a β§ d β£ b β d β£ c - isGCDMonoid_iff_exists_lcm π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_2} [CommMonoidWithZero Ξ±] : IsGCDMonoid Ξ± β IsCancelMulZero Ξ± β§ β (a b : Ξ±), β c, β (d : Ξ±), a β£ d β§ b β£ d β c β£ d - strongNormalizedGCDMonoidOfExistsGCD π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [StrongNormalizationMonoid Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), d β£ a β§ d β£ b β d β£ c) : StrongNormalizedGCDMonoid Ξ± - strongNormalizedGCDMonoidOfExistsLCM π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [StrongNormalizationMonoid Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), a β£ d β§ b β£ d β c β£ d) : StrongNormalizedGCDMonoid Ξ± - normalizedGCDMonoidOfExistsGCD π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [NormalizationMonoid Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), d β£ a β§ d β£ b β d β£ c) : NormalizedGCDMonoid Ξ± - normalizedGCDMonoidOfExistsLCM π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [NormalizationMonoid Ξ±] [DecidableEq Ξ±] (h : β (a b : Ξ±), β c, β (d : Ξ±), a β£ d β§ b β£ d β c β£ d) : NormalizedGCDMonoid Ξ± - gcdMonoidOfGCD π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (gcd : Ξ± β Ξ± β Ξ±) (gcd_dvd_left : β (a b : Ξ±), gcd a b β£ a) (gcd_dvd_right : β (a b : Ξ±), gcd a b β£ b) (dvd_gcd : β {a b c : Ξ±}, a β£ c β a β£ b β a β£ gcd c b) : GCDMonoid Ξ± - gcdMonoidOfLCM π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (lcm : Ξ± β Ξ± β Ξ±) (dvd_lcm_left : β (a b : Ξ±), a β£ lcm a b) (dvd_lcm_right : β (a b : Ξ±), b β£ lcm a b) (lcm_dvd : β {a b c : Ξ±}, c β£ a β b β£ a β lcm c b β£ a) : GCDMonoid Ξ± - normalizedGCDMonoidOfGCD π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [NormalizationMonoid Ξ±] [DecidableEq Ξ±] (gcd : Ξ± β Ξ± β Ξ±) (gcd_dvd_left : β (a b : Ξ±), gcd a b β£ a) (gcd_dvd_right : β (a b : Ξ±), gcd a b β£ b) (dvd_gcd : β {a b c : Ξ±}, a β£ c β a β£ b β a β£ gcd c b) (normalize_gcd : β (a b : Ξ±), normalize (gcd a b) = gcd a b) : NormalizedGCDMonoid Ξ± - normalizedGCDMonoidOfLCM π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [NormalizationMonoid Ξ±] [DecidableEq Ξ±] (lcm : Ξ± β Ξ± β Ξ±) (dvd_lcm_left : β (a b : Ξ±), a β£ lcm a b) (dvd_lcm_right : β (a b : Ξ±), b β£ lcm a b) (lcm_dvd : β {a b c : Ξ±}, c β£ a β b β£ a β lcm c b β£ a) (normalize_lcm : β (a b : Ξ±), normalize (lcm a b) = lcm a b) : NormalizedGCDMonoid Ξ± - normalizationMonoidOfMonoidHomRightInverse π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (f : Associates Ξ± β* Ξ±) (hinv : Function.RightInverse (βf) Associates.mk) : StrongNormalizationMonoid Ξ± - strongNormalizationMonoidOfMonoidHomRightInverse π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [DecidableEq Ξ±] (f : Associates Ξ± β* Ξ±) (hinv : Function.RightInverse (βf) Associates.mk) : StrongNormalizationMonoid Ξ± - GCDMonoid.mk π Mathlib.Algebra.GCDMonoid.Basic
{Ξ± : Type u_2} [CommMonoidWithZero Ξ±] [toIsCancelMulZero : IsCancelMulZero Ξ±] (gcd lcm : Ξ± β Ξ± β Ξ±) (gcd_dvd_left : β (a b : Ξ±), gcd a b β£ a) (gcd_dvd_right : β (a b : Ξ±), gcd a b β£ b) (dvd_gcd : β {a b c : Ξ±}, a β£ c β a β£ b β a β£ gcd c b) (gcd_mul_lcm : β (a b : Ξ±), Associated (gcd a b * lcm a b) (a * b)) (lcm_zero_left : β (a : Ξ±), lcm 0 a = 0) (lcm_zero_right : β (a : Ξ±), lcm a 0 = 0) : GCDMonoid Ξ± - Submonoid.isPrimal π Mathlib.Algebra.GroupWithZero.Submonoid.Primal
(Mβ : Type u_1) [CommMonoidWithZero Mβ] [IsCancelMulZero Mβ] : Submonoid Mβ - UniqueFactorizationMonoid.toIsCancelMulZero π Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{Ξ± : Type u_2} {instβ : CommMonoidWithZero Ξ±} [self : UniqueFactorizationMonoid Ξ±] : IsCancelMulZero Ξ± - ufm_of_decomposition_of_wfDvdMonoid π Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [WfDvdMonoid Ξ±] [DecompositionMonoid Ξ±] : UniqueFactorizationMonoid Ξ± - UniqueFactorizationMonoid.mk π Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{Ξ± : Type u_2} [CommMonoidWithZero Ξ±] [toIsCancelMulZero : IsCancelMulZero Ξ±] [toIsWellFounded : IsWellFounded Ξ± DvdNotUnit] (irreducible_iff_prime : β {a : Ξ±}, Irreducible a β Prime a) : UniqueFactorizationMonoid Ξ± - IsBezout.instIsGCDMonoidOfIsCancelMulZero π Mathlib.RingTheory.PrincipalIdealDomain
(R : Type u) [CommRing R] [IsBezout R] [IsCancelMulZero R] : IsGCDMonoid R - IsBezout.toGCDDomain π Mathlib.RingTheory.PrincipalIdealDomain
(R : Type u) [CommRing R] [IsBezout R] [IsCancelMulZero R] [DecidableEq R] : GCDMonoid R - Submonoid.LocalizationMap.isCancelMulZero π Mathlib.GroupTheory.MonoidLocalization.MonoidWithZero
{M : Type u_1} [CommMonoidWithZero M] {S : Submonoid M} {N : Type u_2} [CommMonoidWithZero N] (f : S.LocalizationMap N) [IsCancelMulZero M] : IsCancelMulZero N - MvPolynomial.instIsCancelMulZeroOfIsCancelAdd π Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {Ο : Type u_1} [CommSemiring R] [IsCancelAdd R] [IsCancelMulZero R] : IsCancelMulZero (MvPolynomial Ο R) - mem_list_primes_of_dvd_prod π Mathlib.Data.List.Prime
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [Subsingleton MΛ£] {p : M} (hp : Prime p) {L : List M} (hL : β q β L, Prime q) (hpL : p β£ L.prod) : p β L - perm_of_prod_eq_prod π Mathlib.Data.List.Prime
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [Subsingleton MΛ£] {lβ lβ : List M} : lβ.prod = lβ.prod β (β p β lβ, Prime p) β (β p β lβ, Prime p) β lβ.Perm lβ - multiplicity_self π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a : Ξ±} : multiplicity a a = 1 - FiniteMultiplicity.emultiplicity_self π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {a : Ξ±} (hfin : FiniteMultiplicity a a) : emultiplicity a a = 1 - multiplicity_pow_self_of_prime π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p : Ξ±} (hp : Prime p) (n : β) : multiplicity p (p ^ n) = n - emultiplicity_pow_self_of_prime π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p : Ξ±} (hp : Prime p) (n : β) : emultiplicity p (p ^ n) = βn - FiniteMultiplicity.pow π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a : Ξ±} (hp : Prime p) (hfin : FiniteMultiplicity p a) {k : β} : FiniteMultiplicity p (a ^ k) - Finset.emultiplicity_prod π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {Ξ² : Type u_3} {p : Ξ±} (hp : Prime p) (s : Finset Ξ²) (f : Ξ² β Ξ±) : emultiplicity p (β x β s, f x) = β x β s, emultiplicity p (f x) - Prime.finiteMultiplicity_mul π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a b : Ξ±} (hp : Prime p) : FiniteMultiplicity p a β FiniteMultiplicity p b β FiniteMultiplicity p (a * b) - FiniteMultiplicity.mul_iff π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a b : Ξ±} (hp : Prime p) : FiniteMultiplicity p (a * b) β FiniteMultiplicity p a β§ FiniteMultiplicity p b - multiplicity_pow_self π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p : Ξ±} (h0 : p β 0) (hu : Β¬IsUnit p) (n : β) : multiplicity p (p ^ n) = n - emultiplicity_mul π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a b : Ξ±} (hp : Prime p) : emultiplicity p (a * b) = emultiplicity p a + emultiplicity p b - emultiplicity_pow_self π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p : Ξ±} (h0 : p β 0) (hu : Β¬IsUnit p) (n : β) : emultiplicity p (p ^ n) = βn - emultiplicity_pow π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a : Ξ±} (hp : Prime p) {k : β} : emultiplicity p (a ^ k) = βk * emultiplicity p a - FiniteMultiplicity.multiplicity_pow π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a : Ξ±} (hp : Prime p) (ha : FiniteMultiplicity p a) {k : β} : multiplicity p (a ^ k) = k * multiplicity p a - multiplicity_mul π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p a b : Ξ±} (hp : Prime p) (hfin : FiniteMultiplicity p (a * b)) : multiplicity p (a * b) = multiplicity p a + multiplicity p b - finiteMultiplicity_mul_aux π Mathlib.RingTheory.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {p : Ξ±} (hp : Prime p) {a b : Ξ±} {n m : β} : Β¬p ^ (n + 1) β£ a β Β¬p ^ (m + 1) β£ b β Β¬p ^ (n + m + 1) β£ a * b - exists_associated_mem_of_dvd_prod π Mathlib.Algebra.BigOperators.Associated
{Mβ : Type u_3} [CommMonoidWithZero Mβ] [IsCancelMulZero Mβ] {p : Mβ} (hp : Prime p) {s : Multiset Mβ} : (β r β s, Prime r) β p β£ s.prod β β q β s, Associated p q - Finset.prod_primes_dvd π Mathlib.Algebra.BigOperators.Associated
{Mβ : Type u_3} [CommMonoidWithZero Mβ] [IsCancelMulZero Mβ] [Subsingleton MβΛ£] {s : Finset Mβ} (n : Mβ) (h : β a β s, Prime a) (div : β a β s, a β£ n) : β p β s, p β£ n - Multiset.prod_primes_dvd π Mathlib.Algebra.BigOperators.Associated
{Mβ : Type u_3} [CommMonoidWithZero Mβ] [IsCancelMulZero Mβ] [(a : Mβ) β DecidablePred (Associated a)] {s : Multiset Mβ} (n : Mβ) (h : β a β s, Prime a) (div : β a β s, a β£ n) (uniq : β (a : Mβ), Multiset.countP (Associated a) s β€ 1) : s.prod β£ n - divisor_closure_eq_closure π Mathlib.Algebra.BigOperators.Associated
{Mβ : Type u_3} [CommMonoidWithZero Mβ] [IsCancelMulZero Mβ] (x y : Mβ) (hxy : x * y β Submonoid.closure {r | IsUnit r β¨ Prime r}) : x β Submonoid.closure {r | IsUnit r β¨ Prime r} - WfDvdMonoid.of_wellFoundedLT_associates π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (h : WellFoundedLT (Associates Ξ±)) : WfDvdMonoid Ξ± - WfDvdMonoid.iff_wellFounded_associates π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] : WfDvdMonoid Ξ± β WellFoundedLT (Associates Ξ±) - UniqueFactorizationMonoid.of_exists_prime_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (pf : β (a : Ξ±), a β 0 β β f, (β b β f, Prime b) β§ Associated f.prod a) : UniqueFactorizationMonoid Ξ± - WfDvdMonoid.of_exists_prime_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (pf : β (a : Ξ±), a β 0 β β f, (β b β f, Prime b) β§ Associated f.prod a) : WfDvdMonoid Ξ± - UniqueFactorizationMonoid.iff_exists_prime_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] : UniqueFactorizationMonoid Ξ± β β (a : Ξ±), a β 0 β β f, (β b β f, Prime b) β§ Associated f.prod a - prime_factors_unique π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] {f g : Multiset Ξ±} : (β x β f, Prime x) β (β x β g, Prime x) β Associated f.prod g.prod β Multiset.Rel Associated f g - irreducible_iff_prime_of_exists_prime_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (pf : β (a : Ξ±), a β 0 β β f, (β b β f, Prime b) β§ Associated f.prod a) {p : Ξ±} : Irreducible p β Prime p - UniqueFactorizationMonoid.of_existsUnique_irreducible_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (eif : β (a : Ξ±), a β 0 β β f, (β b β f, Irreducible b) β§ Associated f.prod a) (uif : β (f g : Multiset Ξ±), (β x β f, Irreducible x) β (β x β g, Irreducible x) β Associated f.prod g.prod β Multiset.Rel Associated f g) : UniqueFactorizationMonoid Ξ± - irreducible_iff_prime_of_existsUnique_irreducible_factors π Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] (eif : β (a : Ξ±), a β 0 β β f, (β b β f, Irreducible b) β§ Associated f.prod a) (uif : β (f g : Multiset Ξ±), (β x β f, Irreducible x) β (β x β g, Irreducible x) β Associated f.prod g.prod β Multiset.Rel Associated f g) (p : Ξ±) : Irreducible p β Prime p - Associates.FactorSet.prod_eq_zero_iff π Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [Nontrivial Ξ±] (p : Associates.FactorSet Ξ±) : p.prod = 0 β p = β€ - LinearEquiv.conjAlgEquiv_ext_iff' π Mathlib.Algebra.Central.End
{R : Type u_1} {M : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] [Module.Free R M] {S : Type u_4} {Mβ : Type u_5} [CommRing S] [IsCancelMulZero S] [Module S M] [SMulCommClass R S M] [Algebra S R] [IsScalarTower S R M] [AddCommGroup Mβ] [Module R Mβ] [Module S Mβ] [SMulCommClass R S Mβ] [IsScalarTower S R Mβ] [Algebra.IsCentral S R] [Module.IsTorsionFree S Mβ] (f g : M ββ[R] Mβ) : LinearEquiv.conjAlgEquiv S f = LinearEquiv.conjAlgEquiv S g β β Ξ±, f = Ξ± β’ g - FiniteMultiplicity.of_prime_left π Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [WfDvdMonoid Ξ±] {a b : Ξ±} (ha : Prime a) (hb : b β 0) : FiniteMultiplicity a b - FiniteMultiplicity.of_not_isUnit π Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{Ξ± : Type u_1} [CommMonoidWithZero Ξ±] [IsCancelMulZero Ξ±] [WfDvdMonoid Ξ±] {a b : Ξ±} (ha : Β¬IsUnit a) (hb : b β 0) : FiniteMultiplicity a b - NoZeroDivisors.toIsCancelMulZero π Mathlib.Algebra.Ring.Regular
{Ξ± : Type u_1} [NonUnitalNonAssocRing Ξ±] [NoZeroDivisors Ξ±] : IsCancelMulZero Ξ± - OreLocalization.oreSetOfIsCancelMulZero π Mathlib.RingTheory.OreLocalization.OreSet
{R : Type u_1} [MonoidWithZero R] [IsCancelMulZero R] {S : Submonoid R} (oreNum : R β β₯S β R) (oreDenom : R β β₯S β β₯S) (ore_eq : β (r : R) (s : β₯S), β(oreDenom r s) * r = oreNum r s * βs) : OreLocalization.OreSet S - IsRadical.of_dvd π Mathlib.RingTheory.Nilpotent.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y : R} (hy : IsRadical y) (h0 : y β 0) (hxy : x β£ y) : IsRadical x - Polynomial.support_integralNormalization π Mathlib.RingTheory.Polynomial.IntegralNormalization
{R : Type u} [Semiring R] [IsCancelMulZero R] {f : Polynomial R} : f.integralNormalization.support = f.support - MulZeroMemClass.isCancelMulZero π Mathlib.Algebra.GroupWithZero.Submonoid.CancelMulZero
{Mβ : Type u_1} [Mul Mβ] [Zero Mβ] {S : Type u_2} [SetLike S Mβ] [MulMemClass S Mβ] [ZeroMemClass S Mβ] (s : S) [IsCancelMulZero Mβ] : IsCancelMulZero β₯s - Prime.squarefree π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x : R} (h : Prime x) : Squarefree x - IsRadical.squarefree π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x : R} (h0 : x β 0) (h : IsRadical x) : Squarefree x - isRadical_iff_squarefree_of_ne_zero π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x : R} [DecompositionMonoid R] (h : x β 0) : IsRadical x β Squarefree x - isRadical_iff_squarefree_or_zero π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x : R} [DecompositionMonoid R] : IsRadical x β Squarefree x β¨ x = 0 - Squarefree.dvd_of_isSquare_mul π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y : R} [DecompositionMonoid R] (hx : Squarefree x) (h : IsSquare (x * y)) : x β£ y - squarefree_mul_iff π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y : R} [DecompositionMonoid R] : Squarefree (x * y) β IsRelPrime x y β§ Squarefree x β§ Squarefree y - Squarefree.associated_of_isSquare_mul π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y : R} [DecompositionMonoid R] (hx : Squarefree x) (hy : Squarefree y) (h : IsSquare (x * y)) : Associated x y - Finset.squarefree_prod_of_pairwise_isCoprime π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] [DecompositionMonoid R] {ΞΉ : Type u_2} {s : Finset ΞΉ} {f : ΞΉ β R} (hs : (βs).Pairwise (Function.onFun IsRelPrime f)) (hs' : β i β s, Squarefree (f i)) : Squarefree (β i β s, f i) - Squarefree.dvd_of_squarefree_of_mul_dvd_mul_left π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y d : R} [DecompositionMonoid R] (hy : Squarefree y) (h : d * d β£ x * y) : d β£ x - Squarefree.dvd_of_squarefree_of_mul_dvd_mul_right π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y d : R} [DecompositionMonoid R] (hx : Squarefree x) (h : d * d β£ x * y) : d β£ y - Squarefree.pow_dvd_of_squarefree_of_pow_succ_dvd_mul_left π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y p : R} {k : β} (hy : Squarefree y) (hp : Prime p) (h : p ^ (k + 1) β£ x * y) : p ^ k β£ x - Squarefree.pow_dvd_of_squarefree_of_pow_succ_dvd_mul_right π Mathlib.Algebra.Squarefree.Basic
{R : Type u_1} [CommMonoidWithZero R] [IsCancelMulZero R] {x y p : R} {k : β} (hx : Squarefree x) (hp : Prime p) (h : p ^ (k + 1) β£ x * y) : p ^ k β£ y - IsDiscreteValuationRing.HasUnitMulPowIrreducibleFactorization.toUniqueFactorizationMonoid π Mathlib.RingTheory.DiscreteValuationRing.Basic
{R : Type u_1} [CommRing R] [IsCancelMulZero R] (hR : IsDiscreteValuationRing.HasUnitMulPowIrreducibleFactorization R) : UniqueFactorizationMonoid R - Associates.isAtom_iff π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : Associates M} (hβ : p β 0) : IsAtom p β Irreducible p - DivisorChain.element_of_chain_not_isUnit_of_index_ne_zero π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {n : β} {i : Fin (n + 1)} (i_pos : i β 0) {c : Fin (n + 1) β Associates M} (hβ : StrictMono c) : Β¬IsUnit (c i) - DivisorChain.first_of_chain_isUnit π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {q : Associates M} {n : β} {c : Fin (n + 1) β Associates M} (hβ : StrictMono c) (hβ : β {r : Associates M}, r β€ q β β i, r = c i) : IsUnit (c 0) - DivisorChain.second_of_chain_is_irreducible π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {q : Associates M} {n : β} (hn : n β 0) {c : Fin (n + 1) β Associates M} (hβ : StrictMono c) (hβ : β {r : Associates M}, r β€ q β β i, r = c i) (hq : q β 0) : Irreducible (c 1) - DivisorChain.exists_chain_of_prime_pow π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : Associates M} {n : β} (hn : n β 0) (hp : Prime p) : β c, c 1 = p β§ StrictMono c β§ β {r : Associates M}, r β€ p ^ n β β i, r = c i - DivisorChain.eq_second_of_chain_of_prime_dvd π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p q r : Associates M} {n : β} (hn : n β 0) {c : Fin (n + 1) β Associates M} (hβ : StrictMono c) (hβ : β {r : Associates M}, r β€ q β β i, r = c i) (hp : Prime p) (hr : r β£ q) (hp' : p β£ r) : p = c 1 - coe_factor_orderIso_map_eq_one_iff π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [IsCancelMulZero N] {m u : Associates M} {n : Associates N} (hu' : u β€ m) (d : β(Set.Iic m) βo β(Set.Iic n)) : β(d β¨u, hu'β©) = 1 β u = 1 - mem_normalizedFactors_factor_dvd_iso_of_mem_normalizedFactors π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [Subsingleton MΛ£] [Subsingleton NΛ£] [UniqueFactorizationMonoid M] [UniqueFactorizationMonoid N] {m p : M} {n : N} (hm : m β 0) (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) {d : { l // l β£ m } β { l // l β£ n }} (hd : β (l l' : { l // l β£ m }), β(d l) β£ β(d l') β βl β£ βl') : β(d β¨p, β―β©) β UniqueFactorizationMonoid.normalizedFactors n - emultiplicity_factor_dvd_iso_eq_emultiplicity_of_mem_normalizedFactors π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [Subsingleton MΛ£] [Subsingleton NΛ£] [UniqueFactorizationMonoid M] [UniqueFactorizationMonoid N] {m p : M} {n : N} (hm : m β 0) (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) {d : { l // l β£ m } β { l // l β£ n }} (hd : β (l l' : { l // l β£ m }), β(d l) β£ β(d l') β βl β£ βl') : emultiplicity (β(d β¨p, β―β©)) n = emultiplicity p m - factor_orderIso_map_one_eq_bot π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [IsCancelMulZero N] {m : Associates M} {n : Associates N} (d : { l // l β€ m } βo { l // l β€ n }) : β(d β¨1, β―β©) = 1 - map_prime_of_factor_orderIso π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [UniqueFactorizationMonoid N] [UniqueFactorizationMonoid M] {m p : Associates M} {n : Associates N} (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) (d : β(Set.Iic m) βo β(Set.Iic n)) : Prime β(d β¨p, β―β©) - emultiplicity_prime_le_emultiplicity_image_by_factor_orderIso π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [UniqueFactorizationMonoid N] [UniqueFactorizationMonoid M] {m p : Associates M} {n : Associates N} (hp : p β UniqueFactorizationMonoid.normalizedFactors m) (d : β(Set.Iic m) βo β(Set.Iic n)) : emultiplicity p m β€ emultiplicity (β(d β¨p, β―β©)) n - emultiplicity_prime_eq_emultiplicity_image_by_factor_orderIso π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [UniqueFactorizationMonoid N] [UniqueFactorizationMonoid M] {m p : Associates M} {n : Associates N} (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) (d : β(Set.Iic m) βo β(Set.Iic n)) : emultiplicity p m = emultiplicity (β(d β¨p, β―β©)) n - mem_normalizedFactors_factor_orderIso_of_mem_normalizedFactors π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [UniqueFactorizationMonoid N] [UniqueFactorizationMonoid M] {m p : Associates M} {n : Associates N} (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) (d : β(Set.Iic m) βo β(Set.Iic n)) : β(d β¨p, β―β©) β UniqueFactorizationMonoid.normalizedFactors n - pow_image_of_prime_by_factor_orderIso_dvd π Mathlib.RingTheory.ChainOfDivisors
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {N : Type u_2} [CommMonoidWithZero N] [UniqueFactorizationMonoid N] [UniqueFactorizationMonoid M] {m p : Associates M} {n : Associates N} (hn : n β 0) (hp : p β UniqueFactorizationMonoid.normalizedFactors m) (d : β(Set.Iic m) βo β(Set.Iic n)) {s : β} (hs' : p ^ s β€ m) : β(d β¨p, β―β©) ^ s β€ n - Ideal.isCancelMulZero π Mathlib.RingTheory.DedekindDomain.Ideal.Basic
{A : Type u_2} [CommRing A] [IsDedekindDomain A] : IsCancelMulZero (Ideal A) - Set.Icc.instIsCancelMulZero π Mathlib.Algebra.Order.Interval.Set.Instances
{R : Type u_2} [Ring R] [PartialOrder R] [IsOrderedRing R] [NoZeroDivisors R] : IsCancelMulZero β(Set.Icc 0 1) - AffineMap.homothety_injective π Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] [Module.IsTorsionFree k V1] [IsCancelMulZero k] (c : P1) {r : k} (hr : r β 0) : Function.Injective β(AffineMap.homothety c r) - AffineMap.homothety_inj π Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] [Module.IsTorsionFree k V1] [IsCancelMulZero k] (c : P1) {r : k} (hr : r β 0) {p q : P1} : (AffineMap.homothety c r) p = (AffineMap.homothety c r) q β p = q - BoundedContinuousFunction.norm_sub_eq_max π Mathlib.Topology.ContinuousMap.Bounded.Normed
{Ξ± : Type u} [TopologicalSpace Ξ±] {R : Type u_1} [NonUnitalSeminormedRing R] [IsCancelMulZero R] {f g : BoundedContinuousFunction Ξ± R} (h : f * g = 0) : βf - gβ = max βfβ βgβ - BoundedContinuousFunction.norm_add_eq_max π Mathlib.Topology.ContinuousMap.Bounded.Normed
{Ξ± : Type u} [TopologicalSpace Ξ±] {R : Type u_1} [NonUnitalSeminormedRing R] [IsCancelMulZero R] {f g : BoundedContinuousFunction Ξ± R} (h : f * g = 0) : βf + gβ = max βfβ βgβ - BoundedContinuousFunction.nnnorm_sub_eq_max π Mathlib.Topology.ContinuousMap.Bounded.Normed
{Ξ± : Type u} [TopologicalSpace Ξ±] {R : Type u_1} [NonUnitalSeminormedRing R] [IsCancelMulZero R] {f g : BoundedContinuousFunction Ξ± R} (h : f * g = 0) : βf - gββ = max βfββ βgββ
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