Loogle!
Result
Found 43 declarations mentioning MulEquiv.trans.
- MulEquiv.trans ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} {P : Type u_6} [Mul M] [Mul N] [Mul P] (h1 : M โ* N) (h2 : N โ* P) : M โ* P - MulEquiv.self_trans_symm ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} [Mul M] [Mul N] (e : M โ* N) : e.trans e.symm = MulEquiv.refl M - MulEquiv.symm_trans_self ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} [Mul M] [Mul N] (e : M โ* N) : e.symm.trans e = MulEquiv.refl N - MulEquiv.trans_apply ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} {P : Type u_6} [Mul M] [Mul N] [Mul P] (eโ : M โ* N) (eโ : N โ* P) (m : M) : (eโ.trans eโ) m = eโ (eโ m) - MulEquiv.coe_trans ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} {P : Type u_6} [Mul M] [Mul N] [Mul P] (eโ : M โ* N) (eโ : N โ* P) : โ(eโ.trans eโ) = โeโ โ โeโ - MulEquiv.symm_trans_apply ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} {P : Type u_6} [Mul M] [Mul N] [Mul P] (eโ : M โ* N) (eโ : N โ* P) (p : P) : (eโ.trans eโ).symm p = eโ.symm (eโ.symm p) - MulEquiv.coe_monoidHom_trans ๐ Mathlib.Algebra.Group.Equiv.Defs
{M : Type u_4} {N : Type u_5} {P : Type u_6} [MulOneClass M] [MulOneClass N] [MulOneClass P] (eโ : M โ* N) (eโ : N โ* P) : โ(eโ.trans eโ) = (โeโ).comp โeโ - MulEquiv.piCongrRight_trans ๐ Mathlib.Algebra.Group.Equiv.Basic
{ฮท : Type u_15} {Ms : ฮท โ Type u_16} {Ns : ฮท โ Type u_17} {Ps : ฮท โ Type u_18} [(j : ฮท) โ Mul (Ms j)] [(j : ฮท) โ Mul (Ns j)] [(j : ฮท) โ Mul (Ps j)] (es : (j : ฮท) โ Ms j โ* Ns j) (fs : (j : ฮท) โ Ns j โ* Ps j) : (MulEquiv.piCongrRight es).trans (MulEquiv.piCongrRight fs) = MulEquiv.piCongrRight fun i => (es i).trans (fs i) - MulEquiv.monoidHomCongrLeftEquiv_trans ๐ Mathlib.Algebra.Group.Equiv.Basic
{Mโ : Type u_5} {Mโ : Type u_6} {Mโ : Type u_7} {N : Type u_8} [MulOneClass Mโ] [MulOneClass Mโ] [MulOneClass Mโ] [Monoid N] (eโโ : Mโ โ* Mโ) (eโโ : Mโ โ* Mโ) : (eโโ.trans eโโ).monoidHomCongrLeftEquiv = eโโ.monoidHomCongrLeftEquiv.trans eโโ.monoidHomCongrLeftEquiv - MulEquiv.monoidHomCongrRightEquiv_trans ๐ Mathlib.Algebra.Group.Equiv.Basic
{M : Type u_4} {Nโ : Type u_9} {Nโ : Type u_10} {Nโ : Type u_11} [MulOneClass M] [Monoid Nโ] [Monoid Nโ] [Monoid Nโ] (eโโ : Nโ โ* Nโ) (eโโ : Nโ โ* Nโ) : (eโโ.trans eโโ).monoidHomCongrRightEquiv = eโโ.monoidHomCongrRightEquiv.trans eโโ.monoidHomCongrRightEquiv - MulEquiv.monoidHomCongrLeft_trans ๐ Mathlib.Algebra.Group.Equiv.Basic
{Mโ : Type u_5} {Mโ : Type u_6} {Mโ : Type u_7} {N : Type u_8} [MulOneClass Mโ] [MulOneClass Mโ] [MulOneClass Mโ] [CommMonoid N] (eโโ : Mโ โ* Mโ) (eโโ : Mโ โ* Mโ) : (eโโ.trans eโโ).monoidHomCongrLeft = eโโ.monoidHomCongrLeft.trans eโโ.monoidHomCongrLeft - MulEquiv.monoidHomCongrRight_trans ๐ Mathlib.Algebra.Group.Equiv.Basic
{M : Type u_4} {Nโ : Type u_9} {Nโ : Type u_10} {Nโ : Type u_11} [MulOneClass M] [CommMonoid Nโ] [CommMonoid Nโ] [CommMonoid Nโ] (eโโ : Nโ โ* Nโ) (eโโ : Nโ โ* Nโ) : (eโโ.trans eโโ).monoidHomCongrRight = eโโ.monoidHomCongrRight.trans eโโ.monoidHomCongrRight - Equiv.permCongrHom_trans ๐ Mathlib.Algebra.Group.End
{ฮฑ : Type u_4} {ฮฒ : Type u_5} {ฮณ : Type u_6} (e : ฮฑ โ ฮฒ) (e' : ฮฒ โ ฮณ) : e.permCongrHom.trans e'.permCongrHom = (e.trans e').permCongrHom - MulAut.mul_def ๐ Mathlib.Algebra.Group.End
(M : Type u_2) [Mul M] (eโ eโ : MulAut M) : eโ * eโ = MulEquiv.trans eโ eโ - MulAut.congr_apply ๐ Mathlib.Algebra.Group.End
{G : Type u_3} [Group G] {H : Type u_7} [Group H] (ฯ : G โ* H) (f : MulAut G) : (MulAut.congr ฯ) f = ฯ.symm.trans (MulEquiv.trans f ฯ) - MulAut.congr_symm_apply ๐ Mathlib.Algebra.Group.End
{G : Type u_3} [Group G] {H : Type u_7} [Group H] (ฯ : G โ* H) (f : MulAut H) : (MulAut.congr ฯ).symm f = ฯ.trans (MulEquiv.trans f ฯ.symm) - FreeGroup.freeGroupCongr_trans ๐ Mathlib.GroupTheory.FreeGroup.Basic
{ฮฑ : Type u_1} {ฮฒ : Type u_2} {ฮณ : Type u_3} (e : ฮฑ โ ฮฒ) (f : ฮฒ โ ฮณ) : (FreeGroup.freeGroupCongr e).trans (FreeGroup.freeGroupCongr f) = FreeGroup.freeGroupCongr (e.trans f) - abelianizationCongr_trans ๐ Mathlib.GroupTheory.Abelianization.Defs
{G : Type u} [Group G] {H : Type v} [Group H] {I : Type v} [Group I] (e : G โ* H) (eโ : H โ* I) : e.abelianizationCongr.trans eโ.abelianizationCongr = (e.trans eโ).abelianizationCongr - Submonoid.LocalizationMap.ofMulEquivOfLocalizations_comp ๐ Mathlib.GroupTheory.MonoidLocalization.Maps
{M : Type u_1} [CommMonoid M] {S : Submonoid M} {N : Type u_2} [CommMonoid N] {P : Type u_3} [CommMonoid P] (f : S.LocalizationMap N) {Q : Type u_4} [CommMonoid Q] {k : N โ* P} {j : P โ* Q} : (f.ofMulEquivOfLocalizations (k.trans j)).toMonoidHom = j.toMonoidHom.comp (f.ofMulEquivOfLocalizations k).toMonoidHom - OrderMonoidIso.coe_trans_mulEquiv ๐ Mathlib.Algebra.Order.Hom.Monoid
{ฮฑ : Type u_2} {ฮฒ : Type u_3} {ฮณ : Type u_4} [Preorder ฮฑ] [Preorder ฮฒ] [Preorder ฮณ] [Mul ฮฑ] [Mul ฮฒ] [Mul ฮณ] (f : ฮฑ โ*o ฮฒ) (g : ฮฒ โ*o ฮณ) : โ(f.trans g) = (โf).trans โg - RingEquiv.coe_mulEquiv_trans ๐ Mathlib.Algebra.Ring.Equiv
{R : Type u_4} {S : Type u_5} {S' : Type u_6} [Mul R] [Mul S] [Add R] [Add S] [Mul S'] [Add S'] (eโ : R โ+* S) (eโ : S โ+* S') : โ(eโ.trans eโ) = (โeโ).trans โeโ - AlgEquiv.autCongr_trans ๐ Mathlib.Algebra.Algebra.Equiv
{R : Type uR} {Aโ : Type uAโ} {Aโ : Type uAโ} {Aโ : Type uAโ} [CommSemiring R] [Semiring Aโ] [Semiring Aโ] [Semiring Aโ] [Algebra R Aโ] [Algebra R Aโ] [Algebra R Aโ] (ฯ : Aโ โโ[R] Aโ) (ฯ : Aโ โโ[R] Aโ) : ฯ.autCongr.trans ฯ.autCongr = (ฯ.trans ฯ).autCongr - QuotientGroup.equivQuotientZPowOfEquiv_trans ๐ Mathlib.GroupTheory.QuotientGroup.Basic
{A B C : Type u} [CommGroup A] [CommGroup B] [CommGroup C] (e : A โ* B) (d : B โ* C) (n : โค) : (QuotientGroup.equivQuotientZPowOfEquiv e n).trans (QuotientGroup.equivQuotientZPowOfEquiv d n) = QuotientGroup.equivQuotientZPowOfEquiv (e.trans d) n - MonoidAlgebra.mapDomainRingEquiv_trans ๐ Mathlib.Algebra.MonoidAlgebra.MapDomain
{R : Type u_3} {M : Type u_6} {N : Type u_7} {O : Type u_8} [Semiring R] [Monoid M] [Monoid N] [Monoid O] (eโ : M โ* N) (eโ : N โ* O) : MonoidAlgebra.mapDomainRingEquiv R (eโ.trans eโ) = (MonoidAlgebra.mapDomainRingEquiv R eโ).trans (MonoidAlgebra.mapDomainRingEquiv R eโ) - LinearMap.GeneralLinearGroup.congrLinearEquiv_trans ๐ Mathlib.LinearAlgebra.GeneralLinearGroup.Basic
{R : Type u_1} [Semiring R] {Nโ : Type u_9} {Nโ : Type u_10} {Nโ : Type u_11} [AddCommMonoid Nโ] [AddCommMonoid Nโ] [AddCommMonoid Nโ] [Module R Nโ] [Module R Nโ] [Module R Nโ] (eโโ : Nโ โโ[R] Nโ) (eโโ : Nโ โโ[R] Nโ) : (LinearMap.GeneralLinearGroup.congrLinearEquiv eโโ).trans (LinearMap.GeneralLinearGroup.congrLinearEquiv eโโ) = LinearMap.GeneralLinearGroup.congrLinearEquiv (eโโ โชโซโ eโโ) - LinearMap.GeneralLinearGroup.congrLinearEquiv_trans' ๐ Mathlib.LinearAlgebra.GeneralLinearGroup.Basic
{Rโ : Type u_3} {Rโ : Type u_4} {Rโ : Type u_5} {Mโ : Type u_6} {Mโ : Type u_7} {Mโ : Type u_8} [Semiring Rโ] [Semiring Rโ] [Semiring Rโ] [AddCommMonoid Mโ] [AddCommMonoid Mโ] [AddCommMonoid Mโ] [Module Rโ Mโ] [Module Rโ Mโ] [Module Rโ Mโ] {ฯโโ : Rโ โ+* Rโ} {ฯโโ : Rโ โ+* Rโ} {ฯโโ : Rโ โ+* Rโ} {ฯโโ : Rโ โ+* Rโ} {ฯโโ : Rโ โ+* Rโ} {ฯโโ : Rโ โ+* Rโ} [RingHomInvPair ฯโโ ฯโโ] [RingHomInvPair ฯโโ ฯโโ] [RingHomInvPair ฯโโ ฯโโ] [RingHomInvPair ฯโโ ฯโโ] [RingHomInvPair ฯโโ ฯโโ] [RingHomInvPair ฯโโ ฯโโ] [RingHomCompTriple ฯโโ ฯโโ ฯโโ] [RingHomCompTriple ฯโโ ฯโโ ฯโโ] (eโโ : Mโ โโโ[ฯโโ] Mโ) (eโโ : Mโ โโโ[ฯโโ] Mโ) : (LinearMap.GeneralLinearGroup.congrLinearEquiv eโโ).trans (LinearMap.GeneralLinearGroup.congrLinearEquiv eโโ) = LinearMap.GeneralLinearGroup.congrLinearEquiv (eโโ.trans eโโ) - MonoidAlgebra.trans_domCongr_domCongr ๐ Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} {O : Type u_9} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Monoid N] [Monoid O] (e : M โ* N) (f : N โ* O) : (MonoidAlgebra.domCongr R A e).trans (MonoidAlgebra.domCongr R A f) = MonoidAlgebra.domCongr R A (e.trans f) - MulAction.stabilizerEquivStabilizer_trans ๐ Mathlib.GroupTheory.GroupAction.Basic
{G : Type u_1} {ฮฑ : Type u_2} [Group G] [MulAction G ฮฑ] {g h k : G} {a b c : ฮฑ} (hg : b = g โข a) (hh : c = h โข b) (hk : c = k โข a) (H : k = h * g) : (MulAction.stabilizerEquivStabilizer hg).trans (MulAction.stabilizerEquivStabilizer hh) = MulAction.stabilizerEquivStabilizer hk - IsCyclic.val_mulAutMulEquiv_apply ๐ Mathlib.GroupTheory.SpecificGroups.Cyclic
(G : Type u_2) [Group G] [h : IsCyclic G] (aโ : MulAut G) : โ((IsCyclic.mulAutMulEquiv G) aโ) = (Multiplicative.toAdd ((MulAutMultiplicative (ZMod (Nat.card G))) ((zmodCyclicMulEquiv h).trans (MulEquiv.trans aโ (zmodCyclicMulEquiv h).symm)))) 1 - IsCyclic.val_inv_mulAutMulEquiv_apply ๐ Mathlib.GroupTheory.SpecificGroups.Cyclic
(G : Type u_2) [Group G] [h : IsCyclic G] (aโ : MulAut G) : โ((IsCyclic.mulAutMulEquiv G) aโ)โปยน = (AddEquiv.symm (Multiplicative.toAdd ((MulAutMultiplicative (ZMod (Nat.card G))) ((zmodCyclicMulEquiv h).trans (MulEquiv.trans aโ (zmodCyclicMulEquiv h).symm))))) 1 - MulEquiv.withOneCongr_trans ๐ Mathlib.Algebra.Group.WithOne.Basic
{ฮฑ : Type u} {ฮฒ : Type v} {ฮณ : Type w} [Mul ฮฑ] [Mul ฮฒ] [Mul ฮณ] (eโ : ฮฑ โ* ฮฒ) (eโ : ฮฒ โ* ฮณ) : eโ.withOneCongr.trans eโ.withOneCongr = (eโ.trans eโ).withOneCongr - powMulEquiv_mul ๐ Mathlib.FieldTheory.Perfect
(M : Type u_1) (p q : โ) [CommMonoid M] [PerfectRing M p] [PerfectRing M q] : powMulEquiv M (p * q) = (powMulEquiv M p).trans (powMulEquiv M q) - powMulEquiv_mul' ๐ Mathlib.FieldTheory.Perfect
(M : Type u_1) (p q : โ) [CommMonoid M] [PerfectRing M p] [PerfectRing M q] : powMulEquiv M (p * q) = (powMulEquiv M q).trans (powMulEquiv M p) - StarMulEquiv.toMulEquiv_trans ๐ Mathlib.Algebra.Star.MonoidHom
{A : Type u_2} {B : Type u_3} {C : Type u_4} [Mul A] [Mul B] [Mul C] [Star A] [Star B] [Star C] (eโ : A โโ* B) (eโ : B โโ* C) : (eโ.trans eโ).toMulEquiv = eโ.trans eโ.toMulEquiv - SemidirectProduct.congr ๐ Mathlib.GroupTheory.SemidirectProduct
{Nโ : Type u_4} {Gโ : Type u_5} {Nโ : Type u_6} {Gโ : Type u_7} [Group Nโ] [Group Gโ] [Group Nโ] [Group Gโ] {ฯโ : Gโ โ* MulAut Nโ} {ฯโ : Gโ โ* MulAut Nโ} (fn : Nโ โ* Nโ) (fg : Gโ โ* Gโ) (h : โ (g : Gโ), MulEquiv.trans (ฯโ g) fn = fn.trans (ฯโ (fg g))) : Nโ โ[ฯโ] Gโ โ* Nโ โ[ฯโ] Gโ - SemidirectProduct.congr_apply_left ๐ Mathlib.GroupTheory.SemidirectProduct
{Nโ : Type u_4} {Gโ : Type u_5} {Nโ : Type u_6} {Gโ : Type u_7} [Group Nโ] [Group Gโ] [Group Nโ] [Group Gโ] {ฯโ : Gโ โ* MulAut Nโ} {ฯโ : Gโ โ* MulAut Nโ} (fn : Nโ โ* Nโ) (fg : Gโ โ* Gโ) (h : โ (g : Gโ), MulEquiv.trans (ฯโ g) fn = fn.trans (ฯโ (fg g))) (x : Nโ โ[ฯโ] Gโ) : ((SemidirectProduct.congr fn fg h) x).left = fn x.left - SemidirectProduct.congr_apply_right ๐ Mathlib.GroupTheory.SemidirectProduct
{Nโ : Type u_4} {Gโ : Type u_5} {Nโ : Type u_6} {Gโ : Type u_7} [Group Nโ] [Group Gโ] [Group Nโ] [Group Gโ] {ฯโ : Gโ โ* MulAut Nโ} {ฯโ : Gโ โ* MulAut Nโ} (fn : Nโ โ* Nโ) (fg : Gโ โ* Gโ) (h : โ (g : Gโ), MulEquiv.trans (ฯโ g) fn = fn.trans (ฯโ (fg g))) (x : Nโ โ[ฯโ] Gโ) : ((SemidirectProduct.congr fn fg h) x).right = fg x.right - SemidirectProduct.congr_symm_apply_left ๐ Mathlib.GroupTheory.SemidirectProduct
{Nโ : Type u_4} {Gโ : Type u_5} {Nโ : Type u_6} {Gโ : Type u_7} [Group Nโ] [Group Gโ] [Group Nโ] [Group Gโ] {ฯโ : Gโ โ* MulAut Nโ} {ฯโ : Gโ โ* MulAut Nโ} (fn : Nโ โ* Nโ) (fg : Gโ โ* Gโ) (h : โ (g : Gโ), MulEquiv.trans (ฯโ g) fn = fn.trans (ฯโ (fg g))) (x : Nโ โ[ฯโ] Gโ) : ((SemidirectProduct.congr fn fg h).symm x).left = fn.symm x.left - SemidirectProduct.congr_symm_apply_right ๐ Mathlib.GroupTheory.SemidirectProduct
{Nโ : Type u_4} {Gโ : Type u_5} {Nโ : Type u_6} {Gโ : Type u_7} [Group Nโ] [Group Gโ] [Group Nโ] [Group Gโ] {ฯโ : Gโ โ* MulAut Nโ} {ฯโ : Gโ โ* MulAut Nโ} (fn : Nโ โ* Nโ) (fg : Gโ โ* Gโ) (h : โ (g : Gโ), MulEquiv.trans (ฯโ g) fn = fn.trans (ฯโ (fg g))) (x : Nโ โ[ฯโ] Gโ) : ((SemidirectProduct.congr fn fg h).symm x).right = fg.symm x.right - CoxeterSystem.map_mulEquiv ๐ Mathlib.GroupTheory.Coxeter.Basic
{B : Type u_1} {W : Type u_3} {H : Type u_4} [Group W] [Group H] {M : CoxeterMatrix B} (cs : CoxeterSystem M W) (e : W โ* H) : (cs.map e).mulEquiv = e.symm.trans cs.mulEquiv - CoxeterSystem.reindex_mulEquiv ๐ Mathlib.GroupTheory.Coxeter.Basic
{B : Type u_1} {B' : Type u_2} {W : Type u_3} [Group W] {M : CoxeterMatrix B} (cs : CoxeterSystem M W) (e : B โ B') : (cs.reindex e).mulEquiv = cs.mulEquiv.trans (M.reindexGroupEquiv e).symm - SpecialLinearGroup.congr_linearEquiv_trans ๐ Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_1} {V : Type u_2} [CommRing R] [AddCommGroup V] [Module R V] {W : Type u_3} {X : Type u_4} [AddCommGroup W] [Module R W] [AddCommGroup X] [Module R X] (e : V โโ[R] W) (f : W โโ[R] X) : (SpecialLinearGroup.congr_linearEquiv e).trans (SpecialLinearGroup.congr_linearEquiv f) = SpecialLinearGroup.congr_linearEquiv (e โชโซโ f) - SpecialLinearGroup.centerCongr_toLin_equiv_trans_centerEquivRootsOfUnity_eq ๐ Mathlib.LinearAlgebra.SpecialLinearGroup
{R : Type u_3} [CommRing R] {V : Type u_4} [AddCommGroup V] [Module R V] [Module.Free R V] [Module.Finite R V] {ฮน : Type u_5} [Fintype ฮน] [DecidableEq ฮน] (b : Module.Basis ฮน R V) (g : โฅ(Subgroup.center (Matrix.SpecialLinearGroup ฮน R))) : โ(((Subgroup.centerCongr (Matrix.SpecialLinearGroup.toLin_equiv b)).trans SpecialLinearGroup.centerEquivRootsOfUnity) g) = โ(Matrix.SpecialLinearGroup.center_equiv_rootsOfUnity 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