Loogle!
Result
Found 72 declarations mentioning Nat.Primes.
- Nat.Primes π Mathlib.Data.Nat.Prime.Defs
: Type - Nat.instDecidableEqPrimes π Mathlib.Data.Nat.Prime.Defs
: DecidableEq Nat.Primes - Nat.Primes.inhabitedPrimes π Mathlib.Data.Nat.Prime.Defs
: Inhabited Nat.Primes - Nat.Primes.instRepr π Mathlib.Data.Nat.Prime.Defs
: Repr Nat.Primes - Nat.Primes.coeNat π Mathlib.Data.Nat.Prime.Defs
: Coe Nat.Primes β - Nat.monoid.primePow π Mathlib.Data.Nat.Prime.Defs
{Ξ± : Type u_1} [Monoid Ξ±] : Pow Ξ± Nat.Primes - Nat.Primes.coe_nat_inj π Mathlib.Data.Nat.Prime.Defs
(p q : Nat.Primes) : βp = βq β p = q - Nat.Primes.countable π Mathlib.Data.Nat.PrimeFin
: Countable Nat.Primes - Nat.Primes.infinite π Mathlib.Data.Nat.PrimeFin
: Infinite Nat.Primes - Complex.norm_prime_cpow_le_one_half π Mathlib.Analysis.SpecialFunctions.Pow.Real
(p : Nat.Primes) {s : β} (hs : 1 < s.re) : βββp ^ (-s)β β€ 1 / 2 - Nat.Primes.prodNatEquiv π Mathlib.Data.Nat.Factorization.PrimePow
: Nat.Primes Γ β β { n // IsPrimePow n } - Nat.Primes.coe_prodNatEquiv_apply π Mathlib.Data.Nat.Factorization.PrimePow
(p : Nat.Primes) (k : β) : β(Nat.Primes.prodNatEquiv (p, k)) = βp ^ (k + 1) - Nat.Primes.prodNatEquiv_symm_apply π Mathlib.Data.Nat.Factorization.PrimePow
{n : β} (hn : IsPrimePow n) : Nat.Primes.prodNatEquiv.symm β¨n, hnβ© = (β¨n.minFac, β―β©, n.factorization n.minFac - 1) - Nat.Primes.prodNatEquiv_apply π Mathlib.Data.Nat.Factorization.PrimePow
(p : Nat.Primes) (k : β) : Nat.Primes.prodNatEquiv (p, k) = β¨βp ^ (k + 1), β―β© - Nat.Primes.toPNat π Mathlib.Data.PNat.Prime
: Nat.Primes β β+ - Nat.Primes.coePNat π Mathlib.Data.PNat.Prime
: Coe Nat.Primes β+ - Nat.Primes.coe_pnat_injective π Mathlib.Data.PNat.Prime
: Function.Injective Nat.Primes.toPNat - Nat.Primes.coe_pnat_nat π Mathlib.Data.PNat.Prime
(p : Nat.Primes) : ββp = βp - Nat.Primes.coe_pnat_inj π Mathlib.Data.PNat.Prime
(p q : Nat.Primes) : βp = βq β p = q - PrimeMultiset.ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : PrimeMultiset - PNat.factorMultiset_ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : (βp).factorMultiset = PrimeMultiset.ofPrime p - PrimeMultiset.prod_ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : (PrimeMultiset.ofPrime p).prod = βp - PrimeMultiset.card_ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : Multiset.card (PrimeMultiset.ofPrime p) = 1 - PrimeMultiset.coePNat_ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : (PrimeMultiset.ofPrime p).toPNatMultiset = {βp} - PrimeMultiset.coeNat_ofPrime π Mathlib.Data.PNat.Factors
(p : Nat.Primes) : (PrimeMultiset.ofPrime p).toNatMultiset = {βp} - PNat.count_factorMultiset π Mathlib.Data.PNat.Factors
(m : β+) (p : Nat.Primes) (k : β) : βp ^ k β£ m β k β€ Multiset.count p m.factorMultiset - FirstOrder.Field.ACF_zero_realize_iff_infinite_ACF_prime_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
{Ο : FirstOrder.Language.ring.Sentence} : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο β {p | FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}.Infinite - FirstOrder.Field.finite_ACF_prime_not_realize_of_ACF_zero_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
(Ο : FirstOrder.Language.ring.Sentence) (h : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο) : {p | Β¬FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}.Finite - FirstOrder.Field.ACF_zero_realize_iff_finite_ACF_prime_not_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
{Ο : FirstOrder.Language.ring.Sentence} : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο β {p | FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}αΆ.Finite - tprod_eq_tprod_primes_of_mulSupport_subset_prime_powers π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [CommGroup Ξ±] [UniformSpace Ξ±] [IsUniformGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hfm : Multipliable f) (hf : Function.mulSupport f β {n | IsPrimePow n}) : β' (n : β), f n = β' (p : Nat.Primes) (k : β), f (βp ^ (k + 1)) - tsum_eq_tsum_primes_of_support_subset_prime_powers π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [AddCommGroup Ξ±] [UniformSpace Ξ±] [IsUniformAddGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hfm : Summable f) (hf : Function.support f β {n | IsPrimePow n}) : β' (n : β), f n = β' (p : Nat.Primes) (k : β), f (βp ^ (k + 1)) - tprod_primes_pow_eq π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [CommGroup Ξ±] [UniformSpace Ξ±] [IsUniformGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hf : Multipliable fun n => f βn) : β' (p : Nat.Primes) (n : β), f (βp ^ (n + 1)) = β' (n : { n // IsPrimePow n }), f βn - tsum_primes_pow_eq π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [AddCommGroup Ξ±] [UniformSpace Ξ±] [IsUniformAddGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hf : Summable fun n => f βn) : β' (p : Nat.Primes) (n : β), f (βp ^ (n + 1)) = β' (n : { n // IsPrimePow n }), f βn - tprod_eq_tprod_primes_mul_tprod_primes_of_mulSupport_subset_prime_powers π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [CommGroup Ξ±] [UniformSpace Ξ±] [IsUniformGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hfm : Multipliable f) (hf : Function.mulSupport f β {n | IsPrimePow n}) : β' (n : β), f n = (β' (p : Nat.Primes), f βp) * β' (p : Nat.Primes) (k : β), f (βp ^ (k + 2)) - tsum_eq_tsum_primes_add_tsum_primes_of_support_subset_prime_powers π Mathlib.NumberTheory.EulerProduct.Basic
{Ξ± : Type u_1} [AddCommGroup Ξ±] [UniformSpace Ξ±] [IsUniformAddGroup Ξ±] [CompleteSpace Ξ±] [T0Space Ξ±] {f : β β Ξ±} (hfm : Summable f) (hf : Function.support f β {n | IsPrimePow n}) : β' (n : β), f n = β' (p : Nat.Primes), f βp + β' (p : Nat.Primes) (k : β), f (βp ^ (k + 2)) - EulerProduct.eulerProduct_hasProd π Mathlib.NumberTheory.EulerProduct.Basic
{R : Type u_1} [NormedCommRing R] {f : β β R} [CompleteSpace R] (hfβ : f 1 = 1) (hmul : β {m n : β}, m.Coprime n β f (m * n) = f m * f n) (hsum : Summable fun x => βf xβ) (hfβ : f 0 = 0) : HasProd (fun p => β' (e : β), f (βp ^ e)) (β' (n : β), f n) - EulerProduct.eulerProduct_tprod π Mathlib.NumberTheory.EulerProduct.Basic
{R : Type u_1} [NormedCommRing R] {f : β β R} [CompleteSpace R] (hfβ : f 1 = 1) (hmul : β {m n : β}, m.Coprime n β f (m * n) = f m * f n) (hsum : Summable fun x => βf xβ) (hfβ : f 0 = 0) : β' (p : Nat.Primes), β' (e : β), f (βp ^ e) = β' (n : β), f n - ArithmeticFunction.IsMultiplicative.eulerProduct_hasProd π Mathlib.NumberTheory.EulerProduct.Basic
{R : Type u_1} [NormedCommRing R] [CompleteSpace R] {f : ArithmeticFunction R} (hf : f.IsMultiplicative) (hsum : Summable fun x => βf xβ) : HasProd (fun p => β' (e : β), f (βp ^ e)) (β' (n : β), f n) - ArithmeticFunction.IsMultiplicative.eulerProduct_tprod π Mathlib.NumberTheory.EulerProduct.Basic
{R : Type u_1} [NormedCommRing R] [CompleteSpace R] {f : ArithmeticFunction R} (hf : f.IsMultiplicative) (hsum : Summable fun x => βf xβ) : β' (p : Nat.Primes), β' (e : β), f (βp ^ e) = β' (n : β), f n - EulerProduct.eulerProduct_completely_multiplicative_hasProd π Mathlib.NumberTheory.EulerProduct.Basic
{F : Type u_1} [NormedField F] [CompleteSpace F] {f : β β*β F} (hsum : Summable fun x => βf xβ) : HasProd (fun p => (1 - f βp)β»ΒΉ) (β' (n : β), f n) - EulerProduct.eulerProduct_completely_multiplicative_tprod π Mathlib.NumberTheory.EulerProduct.Basic
{F : Type u_1} [NormedField F] [CompleteSpace F] {f : β β*β F} (hsum : Summable fun x => βf xβ) : β' (p : Nat.Primes), (1 - f βp)β»ΒΉ = β' (n : β), f n - EulerProduct.exp_tsum_primes_log_eq_tsum π Mathlib.NumberTheory.EulerProduct.ExpLog
{f : β β*β β} (hsum : Summable fun x => βf xβ) : Complex.exp (β' (p : Nat.Primes), -Complex.log (1 - f βp)) = β' (n : β), f n - Nat.Primes.not_summable_one_div π Mathlib.NumberTheory.SumPrimeReciprocals
: Β¬Summable fun p => 1 / ββp - Nat.Primes.summable_rpow π Mathlib.NumberTheory.SumPrimeReciprocals
{r : β} : (Summable fun p => ββp ^ r) β r < -1 - Nat.Primes.multipliable_iff_multipliable_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [CommMonoid M] [TopologicalSpace M] (f : β β M) : (Multipliable fun p => f βp) β Multipliable fun n => if Nat.Prime n then f n else 1 - Nat.Primes.summable_iff_summable_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [AddCommMonoid M] [TopologicalSpace M] (f : β β M) : (Summable fun p => f βp) β Summable fun n => if Nat.Prime n then f n else 0 - Nat.Primes.tprod_eq_tprod_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [CommMonoid M] [TopologicalSpace M] (f : β β M) : β' (p : Nat.Primes), f βp = β' (n : β), if Nat.Prime n then f n else 1 - Nat.Primes.tsum_eq_tsum_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [AddCommMonoid M] [TopologicalSpace M] (f : β β M) : β' (p : Nat.Primes), f βp = β' (n : β), if Nat.Prime n then f n else 0 - Nat.Primes.hasProd_iff_hasProd_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [CommMonoid M] [TopologicalSpace M] (f : β β M) {a : M} : HasProd (fun p => f βp) a β HasProd (fun n => if Nat.Prime n then f n else 1) a - Nat.Primes.hasSum_iff_hasSum_ite π Mathlib.NumberTheory.SumPrimeReciprocals
{M : Type u_1} [AddCommMonoid M] [TopologicalSpace M] (f : β β M) {a : M} : HasSum (fun p => f βp) a β HasSum (fun n => if Nat.Prime n then f n else 0) a - riemannZeta_eulerProduct_hasProd π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} (hs : 1 < s.re) : HasProd (fun p => (1 - ββp ^ (-s))β»ΒΉ) (riemannZeta s) - riemannZeta_eulerProduct_exp_log π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} (hs : 1 < s.re) : Complex.exp (β' (p : Nat.Primes), -Complex.log (1 - ββp ^ (-s))) = riemannZeta s - riemannZeta_eulerProduct_tprod π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} (hs : 1 < s.re) : β' (p : Nat.Primes), (1 - ββp ^ (-s))β»ΒΉ = riemannZeta s - ArithmeticFunction.LSeries_zeta_eulerProduct_exp_log π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} (hs : 1 < s.re) : Complex.exp (β' (p : Nat.Primes), -Complex.log (1 - ββp ^ (-s))) = LSeries 1 s - DirichletCharacter.LSeries_eulerProduct_hasProd π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} {N : β} (Ο : DirichletCharacter β N) (hs : 1 < s.re) : HasProd (fun p => (1 - Ο ββp * ββp ^ (-s))β»ΒΉ) (LSeries (fun n => Ο βn) s) - DirichletCharacter.LSeries_eulerProduct_exp_log π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{N : β} (Ο : DirichletCharacter β N) {s : β} (hs : 1 < s.re) : Complex.exp (β' (p : Nat.Primes), -Complex.log (1 - Ο ββp * ββp ^ (-s))) = LSeries (fun n => Ο βn) s - DirichletCharacter.LSeries_eulerProduct_tprod π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{s : β} {N : β} (Ο : DirichletCharacter β N) (hs : 1 < s.re) : β' (p : Nat.Primes), (1 - Ο ββp * ββp ^ (-s))β»ΒΉ = LSeries (fun n => Ο βn) s - DirichletCharacter.eulerProduct_log_eq_LSeries π Mathlib.NumberTheory.EulerProduct.DirichletLSeries
{N : β} (Ο : DirichletCharacter β N) {s : β} (hs : 1 < s.re) : β' (p : Nat.Primes), -Complex.log (1 - Ο ββp * ββp ^ (-s)) = LSeries (fun n => Ο βn * β(ArithmeticFunction.vonMangoldt n) / β(Real.log βn)) s - DirichletCharacter.summable_neg_log_one_sub_mul_prime_cpow π Mathlib.NumberTheory.LSeries.Nonvanishing
{N : β} (Ο : DirichletCharacter β N) {s : β} (hs : 1 < s.re) : Summable fun p => -Complex.log (1 - Ο ββp * ββp ^ (-s)) - instFactPrimeValNat π Mathlib.NumberTheory.Padics.HeightOneSpectrum
(p : Nat.Primes) : Fact (Nat.Prime βp) - Rat.HeightOneSpectrum.primesEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] : IsDedekindDomain.HeightOneSpectrum R β Nat.Primes - Rat.HeightOneSpectrum.valuation_equiv_padicValuation π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) : (IsDedekindDomain.HeightOneSpectrum.valuation β v).IsEquiv (Rat.padicValuation β(Rat.HeightOneSpectrum.primesEquiv v)) - Rat.HeightOneSpectrum.withValEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) : WithVal (IsDedekindDomain.HeightOneSpectrum.valuation β v) βα΅€ WithVal (Rat.padicValuation β(Rat.HeightOneSpectrum.primesEquiv v)) - Padic.adicCompletionEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
(R : Type u_2) [CommRing R] [IsDedekindDomain R] [Algebra R β] [IsFractionRing R β] [IsIntegralClosure R β€ β] (p : Nat.Primes) : β_[βp] βA[β] IsDedekindDomain.HeightOneSpectrum.adicCompletion β (Rat.HeightOneSpectrum.primesEquiv.symm p) - Rat.HeightOneSpectrum.adicCompletion.padicEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) : IsDedekindDomain.HeightOneSpectrum.adicCompletion β v βA[β] β_[β(Rat.HeightOneSpectrum.primesEquiv v)] - Rat.HeightOneSpectrum.adicCompletionIntegers.padicIntEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) : β₯(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers β v) βA[β€] β€_[β(Rat.HeightOneSpectrum.primesEquiv v)] - PadicInt.adicCompletionIntegersEquiv π Mathlib.NumberTheory.Padics.HeightOneSpectrum
(R : Type u_2) [CommRing R] [IsDedekindDomain R] [Algebra R β] [IsFractionRing R β] [IsIntegralClosure R β€ β] (p : Nat.Primes) : β€_[βp] βA[β€] β₯(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers β (Rat.HeightOneSpectrum.primesEquiv.symm p)) - Rat.HeightOneSpectrum.adicCompletion.padicEquiv_bijOn π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) : Set.BijOn β(Rat.HeightOneSpectrum.adicCompletion.padicEquiv v) β(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers β v) β(PadicInt.subring β(Rat.HeightOneSpectrum.primesEquiv v)) - Rat.HeightOneSpectrum.adicCompletionIntegers.coe_padicIntEquiv_apply π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) (x : β₯(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers β v)) : β((Rat.HeightOneSpectrum.adicCompletionIntegers.padicIntEquiv v) x) = (Rat.HeightOneSpectrum.adicCompletion.padicEquiv v) βx - Rat.HeightOneSpectrum.adicCompletionIntegers.coe_padicIntEquiv_symm_apply π Mathlib.NumberTheory.Padics.HeightOneSpectrum
{R : Type u_2} [CommRing R] [Algebra R β] [IsIntegralClosure R β€ β] [IsDedekindDomain R] [IsFractionRing R β] (v : IsDedekindDomain.HeightOneSpectrum R) (x : β€_[β(Rat.HeightOneSpectrum.primesEquiv v)]) : β((Rat.HeightOneSpectrum.adicCompletionIntegers.padicIntEquiv v).symm x) = (Rat.HeightOneSpectrum.adicCompletion.padicEquiv v).symm βx - PadicInt.coe_adicCompletionIntegersEquiv_apply π Mathlib.NumberTheory.Padics.HeightOneSpectrum
(R : Type u_2) [CommRing R] [IsDedekindDomain R] [Algebra R β] [IsFractionRing R β] [IsIntegralClosure R β€ β] (p : Nat.Primes) (x : β€_[βp]) : β((PadicInt.adicCompletionIntegersEquiv R p) x) = (Padic.adicCompletionEquiv R p) βx - PadicInt.coe_adicCompletionIntegersEquiv_symm_apply π Mathlib.NumberTheory.Padics.HeightOneSpectrum
(R : Type u_2) [CommRing R] [IsDedekindDomain R] [Algebra R β] [IsFractionRing R β] [IsIntegralClosure R β€ β] (p : Nat.Primes) (x : β₯(IsDedekindDomain.HeightOneSpectrum.adicCompletionIntegers β (Rat.HeightOneSpectrum.primesEquiv.symm p))) : β((PadicInt.adicCompletionIntegersEquiv R p).symm x) = (Padic.adicCompletionEquiv R p).symm β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 ce5dd8c