Loogle!
Result
Found 398 declarations mentioning MulOpposite.op. Of these, only the first 200 are shown.
- MulOpposite.op š Mathlib.Algebra.Opposites
{α : Type u_1} : α ā αįµįµįµ - MulOpposite.op_bijective š Mathlib.Algebra.Opposites
{α : Type u_1} : Function.Bijective MulOpposite.op - MulOpposite.op_injective š Mathlib.Algebra.Opposites
{α : Type u_1} : Function.Injective MulOpposite.op - MulOpposite.op_surjective š Mathlib.Algebra.Opposites
{α : Type u_1} : Function.Surjective MulOpposite.op - MulOpposite.unop_op š Mathlib.Algebra.Opposites
{α : Type u_1} (x : α) : MulOpposite.unop (MulOpposite.op x) = x - MulOpposite.op_unop š Mathlib.Algebra.Opposites
{α : Type u_1} (x : αįµįµįµ) : MulOpposite.op (MulOpposite.unop x) = x - MulOpposite.rec' š Mathlib.Algebra.Opposites
{α : Type u_1} {F : αįµįµįµ ā Sort u_3} (h : (X : α) ā F (MulOpposite.op X)) (X : αįµįµįµ) : F X - MulOpposite.forall š Mathlib.Algebra.Opposites
{α : Type u_1} {p : αįµįµįµ ā Prop} : (ā (a : αįµįµįµ), p a) ā ā (a : α), p (MulOpposite.op a) - MulOpposite.unop_comp_op š Mathlib.Algebra.Opposites
{α : Type u_1} : MulOpposite.unop ā MulOpposite.op = id - MulOpposite.op_inj š Mathlib.Algebra.Opposites
{α : Type u_1} {x y : α} : MulOpposite.op x = MulOpposite.op y ā x = y - MulOpposite.exists š Mathlib.Algebra.Opposites
{α : Type u_1} {p : αįµįµįµ ā Prop} : (ā a, p a) ā ā a, p (MulOpposite.op a) - MulOpposite.op_comp_unop š Mathlib.Algebra.Opposites
{α : Type u_1} : MulOpposite.op ā MulOpposite.unop = id - MulOpposite.op_inv š Mathlib.Algebra.Opposites
{α : Type u_1} [Inv α] (x : α) : MulOpposite.op xā»Ā¹ = (MulOpposite.op x)ā»Ā¹ - MulOpposite.op_neg š Mathlib.Algebra.Opposites
{α : Type u_1} [Neg α] (x : α) : MulOpposite.op (-x) = -MulOpposite.op x - MulOpposite.op_one š Mathlib.Algebra.Opposites
{α : Type u_1} [One α] : MulOpposite.op 1 = 1 - MulOpposite.op_zero š Mathlib.Algebra.Opposites
{α : Type u_1} [Zero α] : MulOpposite.op 0 = 0 - MulOpposite.opEquiv_apply š Mathlib.Algebra.Opposites
{α : Type u_1} : āMulOpposite.opEquiv = MulOpposite.op - MulOpposite.op_eq_one_iff š Mathlib.Algebra.Opposites
{α : Type u_1} [One α] (a : α) : MulOpposite.op a = 1 ā a = 1 - MulOpposite.op_eq_zero_iff š Mathlib.Algebra.Opposites
{α : Type u_1} [Zero α] (a : α) : MulOpposite.op a = 0 ā a = 0 - MulOpposite.op_ne_zero_iff š Mathlib.Algebra.Opposites
{α : Type u_1} [Zero α] (a : α) : MulOpposite.op a ā 0 ā a ā 0 - MulOpposite.op_add š Mathlib.Algebra.Opposites
{α : Type u_1} [Add α] (x y : α) : MulOpposite.op (x + y) = MulOpposite.op x + MulOpposite.op y - MulOpposite.op_mul š Mathlib.Algebra.Opposites
{α : Type u_1} [Mul α] (x y : α) : MulOpposite.op (x * y) = MulOpposite.op y * MulOpposite.op x - MulOpposite.op_sub š Mathlib.Algebra.Opposites
{α : Type u_1} [Sub α] (x y : α) : MulOpposite.op (x - y) = MulOpposite.op x - MulOpposite.op y - MulOpposite.op_smul š Mathlib.Algebra.Opposites
{α : Type u_1} {β : Type u_2} [SMul α β] (a : α) (b : β) : MulOpposite.op (a ⢠b) = a ⢠MulOpposite.op b - op_smul_eq_mul š Mathlib.Algebra.Group.Action.Defs
{α : Type u_9} [Mul α] (a b : α) : MulOpposite.op a ⢠b = b * a - IsCentralScalar.mk š Mathlib.Algebra.Group.Action.Defs
{M : Type u_9} {α : Type u_10} [SMul M α] [SMul Mįµįµįµ α] (op_smul_eq_smul : ā (m : M) (a : α), MulOpposite.op m ⢠a = m ⢠a) : IsCentralScalar M α - IsCentralScalar.op_smul_eq_smul š Mathlib.Algebra.Group.Action.Defs
{M : Type u_9} {α : Type u_10} {instā : SMul M α} {instā¹ : SMul Mįµįµįµ α} [self : IsCentralScalar M α] (m : M) (a : α) : MulOpposite.op m ⢠a = m ⢠a - Commute.op š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [Mul α] {x y : α} (h : Commute x y) : Commute (MulOpposite.op x) (MulOpposite.op y) - MulOpposite.commute_op š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [Mul α] {x y : α} : Commute (MulOpposite.op x) (MulOpposite.op y) ā Commute x y - SemiconjBy.op š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [Mul α] {a x y : α} (h : SemiconjBy a x y) : SemiconjBy (MulOpposite.op a) (MulOpposite.op y) (MulOpposite.op x) - MulOpposite.semiconjBy_op š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [Mul α] {a x y : α} : SemiconjBy (MulOpposite.op a) (MulOpposite.op y) (MulOpposite.op x) ā SemiconjBy a x y - MulOpposite.op_pow š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [Monoid α] (x : α) (n : ā) : MulOpposite.op (x ^ n) = MulOpposite.op x ^ n - MulOpposite.op_zpow š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [DivInvMonoid α] (x : α) (z : ā¤) : MulOpposite.op (x ^ z) = MulOpposite.op x ^ z - MulOpposite.op_div š Mathlib.Algebra.Group.Opposite
{α : Type u_1} [DivInvMonoid α] (x y : α) : MulOpposite.op (x / y) = (MulOpposite.op y)ā»Ā¹ * MulOpposite.op x - Units.embedProduct_apply š Mathlib.Algebra.Group.Prod
(α : Type u_6) [Monoid α] (x : αˣ) : (Units.embedProduct α) x = (āx, MulOpposite.op āxā»Ā¹) - MulOpposite.op_smul_eq_op_smul_op š Mathlib.Algebra.Group.Action.Opposite
{M : Type u_1} {α : Type u_3} [SMul M α] [SMul Mįµįµįµ α] [IsCentralScalar M α] (r : M) (a : α) : MulOpposite.op (r ⢠a) = MulOpposite.op r ⢠MulOpposite.op a - op_smul_mul š Mathlib.Algebra.Group.Action.Opposite
{α : Type u_3} {β : Type u_4} [Monoid α] [MulAction αįµįµįµ β] (b : β) (aā aā : α) : MulOpposite.op (aā * aā) ⢠b = MulOpposite.op aā ⢠MulOpposite.op aā ⢠b - op_smul_op_smul š Mathlib.Algebra.Group.Action.Opposite
{α : Type u_3} {β : Type u_4} [Monoid α] [MulAction αįµįµįµ β] (b : β) (aā aā : α) : MulOpposite.op aā ⢠MulOpposite.op aā ⢠b = MulOpposite.op (aā * aā) ⢠b - MulOpposite.opAddEquiv_apply š Mathlib.Algebra.Group.Equiv.Opposite
{α : Type u_2} [Add α] : āMulOpposite.opAddEquiv = MulOpposite.op - MulEquiv.opOp_apply š Mathlib.Algebra.Group.Equiv.Opposite
(M : Type u_3) [Mul M] (aā : M) : (MulEquiv.opOp M) aā = MulOpposite.op (MulOpposite.op aā) - MulOpposite.coe_opMulEquiv š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_1} [CommMonoid M] : āMulOpposite.opMulEquiv = MulOpposite.op - MulOpposite.opMulEquiv_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_1} [CommMonoid M] (aā : M) : MulOpposite.opMulEquiv aā = MulOpposite.op aā - MulHom.toOpposite_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Mul M] [Mul N] (f : M āā* N) (hf : ā (x y : M), Commute (f x) (f y)) : ā(f.toOpposite hf) = MulOpposite.op ā āf - MulEquiv.inv'_apply š Mathlib.Algebra.Group.Equiv.Opposite
(G : Type u_3) [DivisionMonoid G] : ā(MulEquiv.inv' G) = MulOpposite.op ā Inv.inv - MonoidHom.toOpposite_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [MulOneClass M] [MulOneClass N] (f : M ā* N) (hf : ā (x y : M), Commute (f x) (f y)) : ā(f.toOpposite hf) = MulOpposite.op ā āf - AddHom.mulOp_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : M āā+ N) (aā : Mįµįµįµ) : (AddHom.mulOp f) aā = (MulOpposite.op ā āf ā MulOpposite.unop) aā - MulHom.op_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Mul M] [Mul N] (f : M āā* N) (aā : Mįµįµįµ) : (MulHom.op f) aā = (MulOpposite.op ā āf ā MulOpposite.unop) aā - MulEquiv.op_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{α : Type u_3} {β : Type u_4} [Mul α] [Mul β] (f : α ā* β) (aā : αįµįµįµ) : (MulEquiv.op f) aā = (MulOpposite.op ā āf ā MulOpposite.unop) aā - AddHom.mulOp_symm_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Add M] [Add N] (f : Mįµįµįµ āā+ Nįµįµįµ) (aā : M) : (AddHom.mulOp.symm f) aā = (MulOpposite.unop ā āf ā MulOpposite.op) aā - MulHom.op_symm_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [Mul M] [Mul N] (f : Mįµįµįµ āā* Nįµįµįµ) (aā : M) : (MulHom.op.symm f) aā = (MulOpposite.unop ā āf ā MulOpposite.op) aā - MulEquiv.op_apply_symm_apply š Mathlib.Algebra.Group.Equiv.Opposite
{α : Type u_3} {β : Type u_4} [Mul α] [Mul β] (f : α ā* β) (aā : βįµįµįµ) : (MulEquiv.op f).symm aā = (MulOpposite.op ā āf.symm ā MulOpposite.unop) aā - MulEquiv.op_symm_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{α : Type u_3} {β : Type u_4} [Mul α] [Mul β] (f : αįµįµįµ ā* βįµįµįµ) (aā : α) : (MulEquiv.op.symm f) aā = (MulOpposite.unop ā āf ā MulOpposite.op) aā - MonoidHom.op_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [MulOneClass M] [MulOneClass N] (f : M ā* N) (aā : Mįµįµįµ) : (MonoidHom.op f) aā = (MulOpposite.op ā āf ā MulOpposite.unop) aā - MulEquiv.op_symm_apply_symm_apply š Mathlib.Algebra.Group.Equiv.Opposite
{α : Type u_3} {β : Type u_4} [Mul α] [Mul β] (f : αįµįµįµ ā* βįµįµįµ) (aā : β) : (MulEquiv.op.symm f).symm aā = (MulOpposite.unop ā āf.symm ā MulOpposite.op) aā - AddMonoidHom.mulOp_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : M ā+ N) (aā : Mįµįµįµ) : (AddMonoidHom.mulOp f) aā = (MulOpposite.op ā āf ā MulOpposite.unop) aā - MonoidHom.op_symm_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [MulOneClass M] [MulOneClass N] (f : Mįµįµįµ ā* Nįµįµįµ) (aā : M) : (MonoidHom.op.symm f) aā = (MulOpposite.unop ā āf ā MulOpposite.op) aā - AddMonoidHom.mulOp_symm_apply_apply š Mathlib.Algebra.Group.Equiv.Opposite
{M : Type u_3} {N : Type u_4} [AddZeroClass M] [AddZeroClass N] (f : Mįµįµįµ ā+ Nįµįµįµ) (aā : M) : (AddMonoidHom.mulOp.symm f) aā = (MulOpposite.unop ā āf ā MulOpposite.op) aā - isSquare_op_iff š Mathlib.Algebra.Group.Even
{α : Type u_2} [Mul α] {a : α} : IsSquare (MulOpposite.op a) ā IsSquare a - rightDvd_iff_op_dvd_op š Mathlib.Algebra.Divisibility.Basic
{α : Type u_1} [Semigroup α] {a b : α} : a ā£įµ£ b ā MulOpposite.op a ⣠MulOpposite.op b - Set.op_smul_set_smul_eq_smul_smul_set š Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [SMul αįµįµįµ β] [SMul β γ] [SMul α γ] (a : α) (s : Set β) (t : Set γ) (h : ā (a : α) (b : β) (c : γ), (MulOpposite.op a ⢠b) ⢠c = b ⢠a ⢠c) : (MulOpposite.op a ⢠s) ⢠t = s ⢠a ⢠t - Set.image_op_one š Mathlib.Algebra.Group.Pointwise.Set.Basic
{α : Type u_2} [One α] : MulOpposite.op '' 1 = 1 - Set.image_op_inv š Mathlib.Algebra.Group.Pointwise.Set.Basic
{α : Type u_2} [InvolutiveInv α] {s : Set α} : MulOpposite.op '' sā»Ā¹ = (MulOpposite.op '' s)ā»Ā¹ - Set.image_op_mul š Mathlib.Algebra.Group.Pointwise.Set.Basic
{α : Type u_2} [Mul α] {s t : Set α} : MulOpposite.op '' (s * t) = MulOpposite.op '' t * MulOpposite.op '' s - MulOpposite.op_list_prod š Mathlib.Algebra.BigOperators.Group.List.Lemmas
{M : Type u_3} [Monoid M] (l : List M) : MulOpposite.op l.prod = (List.map MulOpposite.op l).reverse.prod - Subsemigroup.unop_closure š Mathlib.Algebra.Group.Subsemigroup.MulOpposite
{M : Type u_2} [Mul M] (s : Set Mįµįµįµ) : (Subsemigroup.closure s).unop = Subsemigroup.closure (MulOpposite.op ā»Ā¹' s) - Subsemigroup.coe_unop š Mathlib.Algebra.Group.Subsemigroup.MulOpposite
{M : Type u_2} [Mul M] (x : Subsemigroup Mįµįµįµ) : āx.unop = MulOpposite.op ā»Ā¹' āx - Subsemigroup.mem_unop š Mathlib.Algebra.Group.Subsemigroup.MulOpposite
{M : Type u_2} [Mul M] {x : M} {S : Subsemigroup Mįµįµįµ} : x ā S.unop ā MulOpposite.op x ā S - Subsemigroup.equivOp_apply_coe š Mathlib.Algebra.Group.Subsemigroup.MulOpposite
{M : Type u_2} [Mul M] (H : Subsemigroup M) (a : ā„H) : ā(H.equivOp a) = MulOpposite.op āa - Submonoid.unop_closure š Mathlib.Algebra.Group.Submonoid.MulOpposite
{M : Type u_2} [MulOneClass M] (s : Set Mįµįµįµ) : (Submonoid.closure s).unop = Submonoid.closure (MulOpposite.op ā»Ā¹' s) - Submonoid.coe_unop š Mathlib.Algebra.Group.Submonoid.MulOpposite
{M : Type u_2} [MulOneClass M] (x : Submonoid Mįµįµįµ) : āx.unop = MulOpposite.op ā»Ā¹' āx - Submonoid.mem_unop š Mathlib.Algebra.Group.Submonoid.MulOpposite
{M : Type u_2} [MulOneClass M] {x : M} {S : Submonoid Mįµįµįµ} : x ā S.unop ā MulOpposite.op x ā S - Submonoid.equivOp_apply_coe š Mathlib.Algebra.Group.Submonoid.MulOpposite
{M : Type u_2} [MulOneClass M] (H : Submonoid M) (a : ā„H) : ā(H.equivOp a) = MulOpposite.op āa - Subgroup.coe_unop š Mathlib.Algebra.Group.Subgroup.MulOpposite
{G : Type u_1} [Group G] (H : Subgroup Gįµįµįµ) : āH.unop = MulOpposite.op ā»Ā¹' āH - Subgroup.mem_unop š Mathlib.Algebra.Group.Subgroup.MulOpposite
{G : Type u_1} [Group G] {x : G} {S : Subgroup Gįµįµįµ} : x ā S.unop ā MulOpposite.op x ā S - Subgroup.equivOp_apply_coe š Mathlib.Algebra.Group.Subgroup.MulOpposite
{G : Type u_1} [Group G] (H : Subgroup G) (a : ā„H) : ā(H.equivOp a) = MulOpposite.op āa - Subgroup.unop_closure š Mathlib.Algebra.Group.Subgroup.MulOppositeLemmas
{G : Type u_2} [Group G] (s : Set Gįµįµįµ) : (Subgroup.closure s).unop = Subgroup.closure (MulOpposite.op ā»Ā¹' s) - Set.image_op_smul š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Mul α] {s t : Set α} : MulOpposite.op '' s ⢠t = t * s - Set.op_smul_set_subset_mul š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Mul α] {s t : Set α} {a : α} : a ā t ā MulOpposite.op a ⢠s ā s * t - Set.mul_subset_iff_right š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Mul α] {s t u : Set α} : s * t ā u ā ā b ā t, MulOpposite.op b ⢠s ā u - Set.iUnion_op_smul_set š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Mul α] (s t : Set α) : ā a ā t, MulOpposite.op a ⢠s = s * t - Set.op_smul_set_mul_eq_mul_smul_set š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Semigroup α] (a : α) (s t : Set α) : MulOpposite.op a ⢠s * t = s * a ⢠t - Set.mul_pair š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Mul α] (s : Set α) (a b : α) : s * {a, b} = MulOpposite.op a ⢠s āŖ MulOpposite.op b ⢠s - Set.image_op_smul_distrib š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{F : Type u_1} {α : Type u_2} {β : Type u_3} [Mul α] [Mul β] [FunLike F α β] [MulHomClass F α β] (f : F) (a : α) (s : Set α) : āf '' (MulOpposite.op a ⢠s) = MulOpposite.op (f a) ⢠āf '' s - Set.inv_op_smul_set_distrib š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Group α] (a : α) (s : Set α) : (MulOpposite.op a ⢠s)ā»Ā¹ = aā»Ā¹ ⢠sā»Ā¹ - Set.inv_smul_set_distrib š Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{α : Type u_2} [Group α] (a : α) (s : Set α) : (a ⢠s)ā»Ā¹ = MulOpposite.op aā»Ā¹ ⢠sā»Ā¹ - MulOpposite.op_mem_center_iff š Mathlib.GroupTheory.Submonoid.Center
{M : Type u_2} [Mul M] {x : M} : MulOpposite.op x ā Set.center Mįµįµįµ ā x ā Set.center M - Submonoid.centerToMulOpposite_apply_coe š Mathlib.GroupTheory.Submonoid.Center
{M : Type u_2} [MulOneClass M] (r : ā„(Subsemigroup.center M)) : ā(Submonoid.centerToMulOpposite r) = MulOpposite.op ār - Subsemigroup.centerToMulOpposite_apply_coe š Mathlib.GroupTheory.Submonoid.Center
{M : Type u_2} [Mul M] (r : ā„(Subsemigroup.center M)) : ā(Subsemigroup.centerToMulOpposite r) = MulOpposite.op ār - Subgroup.centerToMulOpposite_apply_coe š Mathlib.GroupTheory.Subgroup.Center
(G : Type u_1) [Group G] (r : ā„(Subsemigroup.center G)) : ā((Subgroup.centerToMulOpposite G) r) = MulOpposite.op ār - op_smul_coe_set š Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} {S : Type u_4} [Group G] [SetLike S G] [SubgroupClass S G] {s : S} {a : G} (ha : a ā s) : MulOpposite.op a ⢠ās = ās - Finset.op_sum š Mathlib.Algebra.BigOperators.Group.Finset.Defs
{ι : Type u_1} {M : Type u_3} [AddCommMonoid M] (s : Finset ι) (f : ι ā M) : MulOpposite.op (ā x ā s, f x) = ā x ā s, MulOpposite.op (f x) - RingEquiv.opOp_apply š Mathlib.Algebra.Ring.Equiv
(R : Type u_7) [Add R] [Mul R] (aā : R) : (RingEquiv.opOp R) aā = MulOpposite.op (MulOpposite.op aā) - RingEquiv.toOpposite_apply š Mathlib.Algebra.Ring.Equiv
(R : Type u_4) [NonUnitalCommSemiring R] (r : R) : (RingEquiv.toOpposite R) r = MulOpposite.op r - RingEquiv.op_apply_apply š Mathlib.Algebra.Ring.Equiv
{α : Type u_7} {β : Type u_8} [Add α] [Mul α] [Add β] [Mul β] (f : α ā+* β) (aā : αįµįµįµ) : (RingEquiv.op f) aā = MulOpposite.op (f (MulOpposite.unop aā)) - RingEquiv.op_apply_symm_apply š Mathlib.Algebra.Ring.Equiv
{α : Type u_7} {β : Type u_8} [Add α] [Mul α] [Add β] [Mul β] (f : α ā+* β) (aā : βįµįµįµ) : (RingEquiv.op f).symm aā = MulOpposite.op (f.symm (MulOpposite.unop aā)) - RingEquiv.op_symm_apply_apply š Mathlib.Algebra.Ring.Equiv
{α : Type u_7} {β : Type u_8} [Add α] [Mul α] [Add β] [Mul β] (f : αįµįµįµ ā+* βįµįµįµ) (aā : α) : (RingEquiv.op.symm f) aā = MulOpposite.unop (f (MulOpposite.op aā)) - RingEquiv.op_symm_apply_symm_apply š Mathlib.Algebra.Ring.Equiv
{α : Type u_7} {β : Type u_8} [Add α] [Mul α] [Add β] [Mul β] (f : αįµįµįµ ā+* βįµįµįµ) (aā : β) : (RingEquiv.op.symm f).symm aā = MulOpposite.unop (f.symm (MulOpposite.op aā)) - IsRightRegular.isSMulRegular š Mathlib.Algebra.Regular.SMul
{R : Type u_1} [Mul R] {c : R} (h : IsRightRegular c) : IsSMulRegular R (MulOpposite.op c) - IsSMulRegular.isRightRegular š Mathlib.Algebra.Regular.SMul
{R : Type u_1} [Mul R] {a : R} (h : IsSMulRegular R (MulOpposite.op a)) : IsRightRegular a - isRightRegular_iff š Mathlib.Algebra.Regular.SMul
{R : Type u_1} [Mul R] {a : R} : IsRightRegular a ā IsSMulRegular R (MulOpposite.op a) - MulActionHom.End.equivMulOpposite_apply š Mathlib.GroupTheory.GroupAction.Hom
{M : Type u_2} [Monoid M] (f : M āā[id] M) : MulActionHom.End.equivMulOpposite f = MulOpposite.op (f 1) - MulOpposite.op_intCast š Mathlib.Algebra.Ring.Opposite
{R : Type u_1} [IntCast R] (n : ā¤) : MulOpposite.op ān = ān - MulOpposite.op_natCast š Mathlib.Algebra.Ring.Opposite
{R : Type u_1} [NatCast R] (n : ā) : MulOpposite.op ān = ān - MulOpposite.op_ofNat š Mathlib.Algebra.Ring.Opposite
{R : Type u_1} [NatCast R] (n : ā) [n.AtLeastTwo] : MulOpposite.op (OfNat.ofNat n) = OfNat.ofNat n - NonUnitalRingHom.toOpposite_apply š Mathlib.Algebra.Ring.Opposite
{R : Type u_2} {S : Type u_3} [NonUnitalNonAssocSemiring R] [NonUnitalNonAssocSemiring S] (f : R āā+* S) (hf : ā (x y : R), Commute (f x) (f y)) : ā(f.toOpposite hf) = MulOpposite.op ā āf - RingHom.toOpposite_apply š Mathlib.Algebra.Ring.Opposite
{R : Type u_2} {S : Type u_3} [Semiring R] [Semiring S] (f : R ā+* S) (hf : ā (x y : R), Commute (f x) (f y)) : ā(f.toOpposite hf) = MulOpposite.op ā āf - RingHom.op_apply_apply š Mathlib.Algebra.Ring.Opposite
{R : Type u_2} {S : Type u_3} [NonAssocSemiring R] [NonAssocSemiring S] (f : R ā+* S) (aā : Rįµįµįµ) : (RingHom.op f) aā = MulOpposite.op (f (MulOpposite.unop aā)) - RingHom.op_symm_apply_apply š Mathlib.Algebra.Ring.Opposite
{R : Type u_2} {S : Type u_3} [NonAssocSemiring R] [NonAssocSemiring S] (f : Rįµįµįµ ā+* Sįµįµįµ) (aā : R) : (RingHom.op.symm f) aā = MulOpposite.unop (f (MulOpposite.op aā)) - IsLeftRegular.op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsRightRegular a ā IsLeftRegular (MulOpposite.op a) - IsRegular.op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsRegular a ā IsRegular (MulOpposite.op a) - IsRightRegular.op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsLeftRegular a ā IsRightRegular (MulOpposite.op a) - isLeftRegular_op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsLeftRegular (MulOpposite.op a) ā IsRightRegular a - isRegular_op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsRegular (MulOpposite.op a) ā IsRegular a - isRightRegular_op š Mathlib.Algebra.Regular.Opposite
{R : Type u_1} [Mul R] {a : R} : IsRightRegular (MulOpposite.op a) ā IsLeftRegular a - MulOpposite.coe_opLinearEquiv_toLinearMap š Mathlib.Algebra.Module.Equiv.Opposite
(R : Type u) {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : āā(MulOpposite.opLinearEquiv R) = MulOpposite.op - MulOpposite.coe_opLinearEquiv š Mathlib.Algebra.Module.Equiv.Opposite
(R : Type u) {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : ā(MulOpposite.opLinearEquiv R) = MulOpposite.op - RingEquiv.moduleEndSelf_symm_apply š Mathlib.Algebra.Module.LinearMap.End
(R : Type u_1) [Semiring R] (f : Module.End R R) : (RingEquiv.moduleEndSelf R).symm f = MulOpposite.op (f 1) - NonUnitalSubsemiring.centerToMulOpposite_apply_coe š Mathlib.RingTheory.NonUnitalSubsemiring.Basic
{R : Type u} [NonUnitalNonAssocSemiring R] (r : ā„(Subsemigroup.center R)) : ā(NonUnitalSubsemiring.centerToMulOpposite r) = MulOpposite.op ār - Subsemiring.centerToMulOpposite_apply_coe š Mathlib.Algebra.Ring.Subsemiring.Basic
{R : Type u} [NonAssocSemiring R] (r : ā„(Subsemigroup.center R)) : ā(Subsemiring.centerToMulOpposite r) = MulOpposite.op ār - NonUnitalSubring.centerToMulOpposite_apply_coe š Mathlib.RingTheory.NonUnitalSubring.Basic
{R : Type u} [NonUnitalNonAssocRing R] (r : ā„(Subsemigroup.center R)) : ā(NonUnitalSubring.centerToMulOpposite r) = MulOpposite.op ār - Subring.centerToMulOpposite_apply_coe š Mathlib.Algebra.Ring.Subring.Basic
{R : Type u} [NonAssocRing R] (r : ā„(Subsemigroup.center R)) : ā(Subring.centerToMulOpposite r) = MulOpposite.op ār - Set.inv_op_smul_set_distribā š Mathlib.Algebra.GroupWithZero.Action.Pointwise.Set
{α : Type u_1} [GroupWithZero α] (a : α) (s : Set α) : (MulOpposite.op a ⢠s)ā»Ā¹ = aā»Ā¹ ⢠sā»Ā¹ - Set.inv_smul_set_distribā š Mathlib.Algebra.GroupWithZero.Action.Pointwise.Set
{α : Type u_1} [GroupWithZero α] (a : α) (s : Set α) : (a ⢠s)ā»Ā¹ = MulOpposite.op aā»Ā¹ ⢠sā»Ā¹ - MulOpposite.op_finsuppSum š Mathlib.Algebra.BigOperators.Finsupp.Basic
{ι : Type u_16} {M : Type u_17} {N : Type u_18} [AddCommMonoid M] [Zero N] (f : ι āā N) (g : ι ā N ā M) : MulOpposite.op (f.sum g) = f.sum fun i n => MulOpposite.op (g i n) - mem_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Mul α] {s : Set α} {x : α} (a : α) (hxS : x ā s) : x * a ā MulOpposite.op a ⢠s - rightCoset_one š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Monoid α] (s : Set α) : MulOpposite.op 1 ⢠s = s - mem_own_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Monoid α] (s : Submonoid α) (a : α) : a ā MulOpposite.op a ⢠ās - Subgroup.rightCosetEquivSubgroup š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] {s : Subgroup α} (g : α) : ā(MulOpposite.op g ⢠ās) ā ā„s - rightCoset_assoc š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Semigroup α] (s : Set α) (a b : α) : MulOpposite.op b ⢠MulOpposite.op a ⢠s = MulOpposite.op (a * b) ⢠s - rightCoset_mem_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) {a : α} (ha : a ā s) : MulOpposite.op a ⢠ās = ās - leftCoset_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Semigroup α] (s : Set α) (a b : α) : MulOpposite.op b ⢠a ⢠s = a ⢠MulOpposite.op b ⢠s - mem_rightCoset_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Monoid α] (s : Submonoid α) {a : α} (ha : MulOpposite.op a ⢠ās = ās) : a ā s - mem_rightCoset_iff š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] {s : Set α} {x : α} (a : α) : x ā MulOpposite.op a ⢠s ā x * aā»Ā¹ ā s - eq_cosets_of_normal š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) (N : s.Normal) (g : α) : g ⢠ās = MulOpposite.op g ⢠ās - normal_of_eq_cosets š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) (h : ā (g : α), g ⢠ās = MulOpposite.op g ⢠ās) : s.Normal - normal_iff_eq_cosets š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) : s.Normal ā ā (g : α), g ⢠ās = MulOpposite.op g ⢠ās - rightCoset_eq_iff š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) {x y : α} : MulOpposite.op x ⢠ās = MulOpposite.op y ⢠ās ā y * xā»Ā¹ ā s - orbit_subgroup_eq_rightCoset š Mathlib.GroupTheory.Coset.Basic
{α : Type u_1} [Group α] (s : Subgroup α) (a : α) : MulAction.orbit (ā„s) a = MulOpposite.op a ⢠ās - AlgEquiv.toOpposite_apply š Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) (A : Type u_3) [CommSemiring R] [CommSemiring A] [Algebra R A] (aā : A) : (AlgEquiv.toOpposite R A) aā = MulOpposite.op aā - AlgEquiv.opOp_apply š Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) (A : Type u_3) [CommSemiring R] [Semiring A] [Algebra R A] (aā : A) : (AlgEquiv.opOp R A) aā = MulOpposite.op (MulOpposite.op aā) - MulOpposite.algebraMap_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (c : R) : (algebraMap R Aįµįµįµ) c = MulOpposite.op ((algebraMap R A) c) - AlgHom.toOpposite_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A āā[R] B) (hf : ā (x y : A), Commute (f x) (f y)) : ā(f.toOpposite hf) = MulOpposite.op ā āf - AlgHom.op_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A āā[R] B) (aā : Aįµįµįµ) : (AlgHom.op f) aā = MulOpposite.op (f (MulOpposite.unop aā)) - AlgEquiv.op_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A āā[R] B) (aā : Aįµįµįµ) : (AlgEquiv.op f) aā = MulOpposite.op (f (MulOpposite.unop aā)) - AlgEquiv.op_apply_symm_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : A āā[R] B) (aā : Bįµįµįµ) : (AlgEquiv.op f).symm aā = MulOpposite.op (f.symm (MulOpposite.unop aā)) - AlgEquiv.opComm_symm_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (aā : Aįµįµįµ āā[R] B) (aā¹ : A) : (AlgEquiv.opComm.symm aā) aā¹ = MulOpposite.op (aā (MulOpposite.op aā¹)) - AlgHom.opComm_symm_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (aā : Aįµįµįµ āā[R] B) (aā¹ : A) : (AlgHom.opComm.symm aā) aā¹ = MulOpposite.op (aā (MulOpposite.op aā¹)) - AlgEquiv.moduleEndSelf_symm_apply š Mathlib.Algebra.Algebra.Opposite
(R : Type u_1) {A : Type u_3} [CommSemiring R] [Semiring A] [Algebra R A] (f : Module.End A A) : (AlgEquiv.moduleEndSelf R).symm f = MulOpposite.op (f 1) - AlgHom.op_symm_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : Aįµįµįµ āā[R] Bįµįµįµ) (aā : A) : (AlgHom.op.symm f) aā = MulOpposite.unop (f (MulOpposite.op aā)) - AlgEquiv.opComm_apply_symm_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (aā : A āā[R] Bįµįµįµ) (aā¹ : B) : (AlgEquiv.opComm aā).symm aā¹ = MulOpposite.op (aā.symm (MulOpposite.op aā¹)) - AlgEquiv.op_symm_apply_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : Aįµįµįµ āā[R] Bįµįµįµ) (aā : A) : (AlgEquiv.op.symm f) aā = MulOpposite.unop (f (MulOpposite.op aā)) - AlgEquiv.op_symm_apply_symm_apply š Mathlib.Algebra.Algebra.Opposite
{R : Type u_1} {A : Type u_3} {B : Type u_4} [CommSemiring R] [Semiring A] [Semiring B] [Algebra R A] [Algebra R B] (f : Aįµįµįµ āā[R] Bįµįµįµ) (aā : B) : (AlgEquiv.op.symm f).symm aā = MulOpposite.unop (f.symm (MulOpposite.op aā)) - Finset.image_op_one š Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [One α] [DecidableEq α] : Finset.image MulOpposite.op 1 = 1 - Finset.image_op_inv š Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Inv α] (s : Finset α) : Finset.image MulOpposite.op sā»Ā¹ = (Finset.image MulOpposite.op s)ā»Ā¹ - Finset.image_op_mul š Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Mul α] (s t : Finset α) : Finset.image MulOpposite.op (s * t) = Finset.image MulOpposite.op t * Finset.image MulOpposite.op s - Finset.image_op_pow š Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Monoid α] (s : Finset α) (n : ā) : Finset.image MulOpposite.op (s ^ n) = Finset.image MulOpposite.op s ^ n - UniqueMul.of_mulOpposite š Mathlib.Algebra.Group.UniqueProds.Basic
{G : Type u_1} [Mul G] {A B : Finset G} {a0 b0 : G} (h : UniqueMul (Finset.map { toFun := MulOpposite.op, inj' := ⯠} B) (Finset.map { toFun := MulOpposite.op, inj' := ⯠} A) (MulOpposite.op b0) (MulOpposite.op a0)) : UniqueMul A B a0 b0 - UniqueMul.to_mulOpposite š Mathlib.Algebra.Group.UniqueProds.Basic
{G : Type u_1} [Mul G] {A B : Finset G} {a0 b0 : G} (h : UniqueMul A B a0 b0) : UniqueMul (Finset.map { toFun := MulOpposite.op, inj' := ⯠} B) (Finset.map { toFun := MulOpposite.op, inj' := ⯠} A) (MulOpposite.op b0) (MulOpposite.op a0) - UniqueMul.iff_mulOpposite š Mathlib.Algebra.Group.UniqueProds.Basic
{G : Type u_1} [Mul G] {A B : Finset G} {a0 b0 : G} : UniqueMul (Finset.map { toFun := MulOpposite.op, inj' := ⯠} B) (Finset.map { toFun := MulOpposite.op, inj' := ⯠} A) (MulOpposite.op b0) (MulOpposite.op a0) ā UniqueMul A B a0 b0 - AddMonoidAlgebra.opRingEquiv_single š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Add M] (r : R) (x : M) : AddMonoidAlgebra.opRingEquiv (MulOpposite.op (AddMonoidAlgebra.single x r)) = AddMonoidAlgebra.single (AddOpposite.op x) (MulOpposite.op r) - MonoidAlgebra.opRingEquiv_single š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] (r : R) (x : M) : MonoidAlgebra.opRingEquiv (MulOpposite.op (MonoidAlgebra.single x r)) = MonoidAlgebra.single (MulOpposite.op x) (MulOpposite.op r) - AddMonoidAlgebra.opRingEquiv_symm_single š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Add M] (r : Rįµįµįµ) (x : Mįµįµįµ) : AddMonoidAlgebra.opRingEquiv.symm (AddMonoidAlgebra.single x r) = MulOpposite.op (AddMonoidAlgebra.single (AddOpposite.unop x) (MulOpposite.unop r)) - MonoidAlgebra.opRingEquiv_symm_single š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] (r : Rįµįµįµ) (x : Mįµįµįµ) : MonoidAlgebra.opRingEquiv.symm (MonoidAlgebra.single x r) = MulOpposite.op (MonoidAlgebra.single (MulOpposite.unop x) (MulOpposite.unop r)) - AddMonoidAlgebra.opRingEquiv_symm_apply š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Add M] (aā : AddMonoidAlgebra Rįµįµįµ Mįµįµįµ) : AddMonoidAlgebra.opRingEquiv.symm aā = MulOpposite.op ((AddMonoidAlgebra.mapDomainAddEquiv R AddOpposite.opEquiv.symm) ((AddMonoidAlgebra.mapAddEquiv Mįµįµįµ MulOpposite.opAddEquiv.symm) aā)) - MonoidAlgebra.opRingEquiv_symm_apply š Mathlib.Algebra.MonoidAlgebra.Opposite
{R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] (aā : MonoidAlgebra Rįµįµįµ Mįµįµįµ) : MonoidAlgebra.opRingEquiv.symm aā = MulOpposite.op ((MonoidAlgebra.mapDomainAddEquiv R MulOpposite.opEquiv.symm) ((MonoidAlgebra.mapAddEquiv Mįµįµįµ MulOpposite.opAddEquiv.symm) aā)) - Submodule.equivOpposite_apply š Mathlib.Algebra.Algebra.Operations
{R : Type u} [CommSemiring R] {A : Type v} [Semiring A] [Algebra R A] (p : Submodule R Aįµįµįµ) : Submodule.equivOpposite p = MulOpposite.op (Submodule.comap (ā(MulOpposite.opLinearEquiv R)) p) - Matrix.map_op_smul' š Mathlib.LinearAlgebra.Matrix.Defs
{n : Type u_3} {α : Type v} {β : Type w} [Mul α] [Mul β] (f : α ā β) (r : α) (A : Matrix n n α) (hf : ā (aā aā : α), f (aā * aā) = f aā * f aā) : (MulOpposite.op r ⢠A).map f = MulOpposite.op (f r) ⢠A.map f - Matrix.col_vecMulVec š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [Mul α] (w : m ā α) (v : n ā α) (j : n) : (Matrix.vecMulVec w v).col j = MulOpposite.op (v j) ⢠w - Matrix.vecMulVec_smul' š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [Semigroup α] (w : m ā α) (r : α) (v : n ā α) : Matrix.vecMulVec w (r ⢠v) = Matrix.vecMulVec (MulOpposite.op r ⢠w) v - Matrix.mulVec_single š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {R : Type u_5} [Fintype n] [DecidableEq n] [NonUnitalNonAssocSemiring R] (M : Matrix m n R) (j : n) (x : R) : M.mulVec (Pi.single j x) = MulOpposite.op x ⢠M.col j - Matrix.vecMul_diagonal_const š Mathlib.Data.Matrix.Mul
{m : Type u_2} {α : Type v} [NonAssocSemiring α] [Fintype m] [DecidableEq m] (x : α) (v : m ā α) : Matrix.vecMul v (Matrix.diagonal fun x_1 => x) = MulOpposite.op x ⢠v - Matrix.mulVec_eq_sum š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (v : n ā α) (M : Matrix m n α) : M.mulVec v = ā i, MulOpposite.op (v i) ⢠M.transpose i - Matrix.vecMulVec_mulVec š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalSemiring α] [Fintype n] (u : m ā α) (v w : n ā α) : (Matrix.vecMulVec u v).mulVec w = MulOpposite.op (v ā¬įµ„ w) ⢠u - Matrix.vecMul_natCast š Mathlib.Data.Matrix.Mul
{m : Type u_2} {α : Type v} [NonAssocSemiring α] [Fintype m] [DecidableEq m] (x : ā) (v : m ā α) : Matrix.vecMul v āx = MulOpposite.op āx ⢠v - Matrix.op_smul_eq_mul_diagonal š Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] [DecidableEq n] (M : Matrix m n α) (a : α) : MulOpposite.op a ⢠M = M * Matrix.diagonal fun x => a - Matrix.op_smul_one_eq_diagonal š Mathlib.Data.Matrix.Mul
{m : Type u_2} {α : Type v} [NonAssocSemiring α] [DecidableEq m] (a : α) : MulOpposite.op a ⢠1 = Matrix.diagonal fun x => a - Matrix.vecMul_intCast š Mathlib.Data.Matrix.Mul
{m : Type u_2} {α : Type v} [NonAssocRing α] [Fintype m] [DecidableEq m] (x : ā¤) (v : m ā α) : Matrix.vecMul v āx = MulOpposite.op āx ⢠v - Matrix.vecMul_ofNat š Mathlib.Data.Matrix.Mul
{m : Type u_2} {α : Type v} [NonAssocSemiring α] [Fintype m] [DecidableEq m] (x : ā) [x.AtLeastTwo] (v : m ā α) : Matrix.vecMul v (OfNat.ofNat x) = MulOpposite.op (OfNat.ofNat x) ⢠v - Matrix.transposeAlgEquiv_apply š Mathlib.Data.Matrix.Basic
(m : Type u_2) (R : Type u_4) (α : Type u_8) [CommSemiring R] [CommSemiring α] [Fintype m] [DecidableEq m] [Algebra R α] (aā : Matrix m m α) : (Matrix.transposeAlgEquiv m R α) aā = MulOpposite.op aā.transpose - Matrix.scalar_commute_iff š Mathlib.Data.Matrix.Basic
{n : Type u_3} {α : Type u_8} [Semiring α] [DecidableEq n] [Fintype n] {r : α} {M : Matrix n n α} : Commute ((Matrix.scalar n) r) M ā r ⢠M = MulOpposite.op r ⢠M - AlgEquiv.mopMatrix_apply š Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : Matrix m m αįµįµįµ) : AlgEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - Matrix.transposeRingEquiv_apply š Mathlib.Data.Matrix.Basic
(m : Type u_2) (α : Type u_8) [AddCommMonoid α] [CommMagma α] [Fintype m] (aā : Matrix m m α) : (Matrix.transposeRingEquiv m α) aā = MulOpposite.op aā.transpose - RingEquiv.mopMatrix_apply š Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_11} [Mul α] [AddCommMonoid α] (M : Matrix m m αįµįµįµ) : RingEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - AlgEquiv.mopMatrix_symm_apply š Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : (Matrix m m α)įµįµįµ) : AlgEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - Matrix.scalar_comm_iff š Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_8} [Semiring α] [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] {r : α} {M : Matrix m n α} : (Matrix.scalar m) r * M = M * (Matrix.scalar n) r ā r ⢠M = MulOpposite.op r ⢠M - RingEquiv.mopMatrix_symm_apply š Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_11} [Mul α] [AddCommMonoid α] (M : (Matrix m m α)įµįµįµ) : RingEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - RingCon.unop_iff š Mathlib.RingTheory.Congruence.Opposite
{R : Type u_1} [Add R] [Mul R] {c : RingCon Rįµįµįµ} {x y : R} : c.unop x y ā c (MulOpposite.op y) (MulOpposite.op x) - TwoSidedIdeal.coe_unop š Mathlib.RingTheory.TwoSidedIdeal.Basic
{R : Type u_1} [NonUnitalNonAssocRing R] {I : TwoSidedIdeal Rįµįµįµ} : āI.unop = MulOpposite.op ā»Ā¹' āI - TwoSidedIdeal.mem_unop_iff š Mathlib.RingTheory.TwoSidedIdeal.Basic
{R : Type u_1} [NonUnitalNonAssocRing R] {I : TwoSidedIdeal Rįµįµįµ} {x : R} : x ā I.unop ā MulOpposite.op x ā I - MulOpposite.op_nnratCast š Mathlib.Algebra.Field.Opposite
{α : Type u_1} [NNRatCast α] (q : āā„0) : MulOpposite.op āq = āq - MulOpposite.op_ratCast š Mathlib.Algebra.Field.Opposite
{α : Type u_1} [RatCast α] (q : ā) : MulOpposite.op āq = āq - MulOpposite.op_star š Mathlib.Algebra.Star.Basic
{R : Type u} [Star R] (r : R) : MulOpposite.op (star r) = star (MulOpposite.op r) - starMulEquiv_apply š Mathlib.Algebra.Star.Basic
{R : Type u} [Mul R] [StarMul R] (x : R) : starMulEquiv x = MulOpposite.op (star x) - starRingEquiv_apply š Mathlib.Algebra.Star.Basic
{R : Type u} [NonUnitalNonAssocSemiring R] [StarRing R] (x : R) : starRingEquiv x = MulOpposite.op (star x) - Matrix.conjTranspose_smul_self š Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Mul α] [StarMul α] (c : α) (M : Matrix m n α) : (c ⢠M).conjTranspose = MulOpposite.op (star c) ⢠M.conjTranspose - Matrix.conjTranspose_smul_non_comm š Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {R : Type u_5} {α : Type v} [Star R] [Star α] [SMul R α] [SMul Rįµįµįµ α] (c : R) (M : Matrix m n α) (h : ā (r : R) (a : α), star (r ⢠a) = MulOpposite.op (star r) ⢠star a) : (c ⢠M).conjTranspose = MulOpposite.op (star c) ⢠M.conjTranspose - Matrix.conjTransposeRingEquiv_apply š Mathlib.LinearAlgebra.Matrix.ConjTranspose
(m : Type u_2) (α : Type v) [NonUnitalNonAssocSemiring α] [StarRing α] [Fintype m] (aā : Matrix m m α) : (Matrix.conjTransposeRingEquiv m α) aā = MulOpposite.op aā.conjTranspose - Matrix.conjTransposeAlgEquiv_apply š Mathlib.LinearAlgebra.Matrix.ConjTranspose
(n : Type u_3) {R : Type u_5} (α : Type v) [Fintype n] [CommSemiring R] [StarRing R] [TrivialStar R] [Semiring α] [StarRing α] [Algebra R α] [StarModule R α] (aā : Matrix n n α) : (Matrix.conjTransposeAlgEquiv n α) aā = MulOpposite.op aā.conjTranspose - Matrix.vecMulVec_update š Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} [DecidableEq n] [Mul α] (u : m ā α) (v : n ā α) (j : n) (a : α) : Matrix.vecMulVec u (Function.update v j a) = (Matrix.vecMulVec u v).updateCol j (MulOpposite.op a ⢠u) - Matrix.mul_single_eq_updateCol_zero š Mathlib.LinearAlgebra.Matrix.RowCol
{l : Type u_1} {m : Type u_2} {n : Type u_3} {α : Type v} [DecidableEq m] [DecidableEq n] [Fintype m] [NonUnitalNonAssocSemiring α] (A : Matrix l m α) (i : m) (j : n) (r : α) : A * Matrix.single i j r = Matrix.updateCol 0 j (MulOpposite.op r ⢠A.col i)
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 69fae59