Loogle!
Result
Found 783 declarations whose name contains "zpow". Of these, 6 have a name containing "zpow" and "inj".
- zpow_right_injectiveโ ๐ Mathlib.Algebra.Order.GroupWithZero.Unbundled.Basic
{Gโ : Type u_3} [GroupWithZero Gโ] [LinearOrder Gโ] {a : Gโ} [PosMulStrictMono Gโ] [ZeroLEOneClass Gโ] (haโ : 0 < a) (haโ : a โ 1) : Function.Injective fun n => a ^ n - zpow_right_injโ ๐ Mathlib.Algebra.Order.GroupWithZero.Unbundled.Basic
{Gโ : Type u_3} [GroupWithZero Gโ] [LinearOrder Gโ] {a : Gโ} [PosMulStrictMono Gโ] {m n : โค} [ZeroLEOneClass Gโ] (haโ : 0 < a) (haโ : a โ 1) : a ^ m = a ^ n โ m = n - zpow_left_injective ๐ Mathlib.Algebra.Group.Torsion
{G : Type u_2} [Group G] [IsMulTorsionFree G] {n : โค} : n โ 0 โ Function.Injective fun a => a ^ n - zpow_left_inj ๐ Mathlib.Algebra.Group.Torsion
{G : Type u_2} [Group G] [IsMulTorsionFree G] {n : โค} {a b : G} (hn : n โ 0) : a ^ n = b ^ n โ a = b - zpow_right_inj ๐ Mathlib.Algebra.Order.Group.Basic
{ฮฑ : Type u_1} [CommGroup ฮฑ] [PartialOrder ฮฑ] [IsOrderedMonoid ฮฑ] {a : ฮฑ} (ha : 1 < a) {m n : โค} : a ^ m = a ^ n โ m = n - injective_zpow_iff_not_isOfFinOrder ๐ Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] {x : G} : (Function.Injective fun n => x ^ n) โ ยฌIsOfFinOrder x
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using (by default) Ctrl-K Ctrl-S. 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 ?a
If 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 ?b
By 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_tsum
even though the hypothesisf i < g i
is not the last.
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.
This is Loogle revision 19971e9
serving mathlib revision e0654b0