Documentation

Mathlib.Algebra.Order.Group.Synonym

Group structure on the order type synonyms #

Transfer algebraic instances from α to αᵒᵈ and Lex α.

OrderDual #

source
instance instOneOrderDual {α : Type u_1} [h : One α] :
One αᵒᵈ
Equations
  • instOneOrderDual = h
source
instance instZeroOrderDual {α : Type u_1} [h : Zero α] :
Zero αᵒᵈ
Equations
  • instZeroOrderDual = h
source
instance instMulOrderDual {α : Type u_1} [h : Mul α] :
Mul αᵒᵈ
Equations
  • instMulOrderDual = h
source
instance instAddOrderDual {α : Type u_1} [h : Add α] :
Add αᵒᵈ
Equations
  • instAddOrderDual = h
source
instance instInvOrderDual {α : Type u_1} [h : Inv α] :
Inv αᵒᵈ
Equations
  • instInvOrderDual = h
source
instance instNegOrderDual {α : Type u_1} [h : Neg α] :
Neg αᵒᵈ
Equations
  • instNegOrderDual = h
source
instance instDivOrderDual {α : Type u_1} [h : Div α] :
Div αᵒᵈ
Equations
  • instDivOrderDual = h
source
instance instSubOrderDual {α : Type u_1} [h : Sub α] :
Sub αᵒᵈ
Equations
  • instSubOrderDual = h
source
instance OrderDual.instPow {α : Type u_1} {β : Type u_2} [h : Pow α β] :
Pow αᵒᵈ β
Equations
  • OrderDual.instPow = h
source
instance OrderDual.instSMul {β : Type u_2} {α : Type u_1} [h : SMul β α] :
SMul β αᵒᵈ
Equations
  • OrderDual.instSMul = h
source
instance OrderDual.instVAdd {β : Type u_2} {α : Type u_1} [h : VAdd β α] :
VAdd β αᵒᵈ
Equations
  • OrderDual.instVAdd = h
source
instance OrderDual.instPow' {α : Type u_1} {β : Type u_2} [h : Pow α β] :
Pow α βᵒᵈ
Equations
  • OrderDual.instPow' = h
source
instance OrderDual.instVAdd' {β : Type u_2} {α : Type u_1} [h : VAdd β α] :
VAdd βᵒᵈ α
Equations
  • OrderDual.instVAdd' = h
source
instance OrderDual.instSMul' {β : Type u_2} {α : Type u_1} [h : SMul β α] :
SMul βᵒᵈ α
Equations
  • OrderDual.instSMul' = h
source
instance instSemigroupOrderDual {α : Type u_1} [h : Semigroup α] :
Semigroup αᵒᵈ
Equations
  • instSemigroupOrderDual = h
source
instance instAddSemigroupOrderDual {α : Type u_1} [h : AddSemigroup α] :
AddSemigroup αᵒᵈ
Equations
  • instAddSemigroupOrderDual = h
source
instance instCommSemigroupOrderDual {α : Type u_1} [h : CommSemigroup α] :
CommSemigroup αᵒᵈ
Equations
  • instCommSemigroupOrderDual = h
source
instance instAddCommSemigroupOrderDual {α : Type u_1} [h : AddCommSemigroup α] :
AddCommSemigroup αᵒᵈ
Equations
  • instAddCommSemigroupOrderDual = h
source
theorem instIsLeftCancelMulOrderDual {α : Type u_1} [Mul α] [h : IsLeftCancelMul α] :
IsLeftCancelMul αᵒᵈ
source
theorem instIsAddLeftCancelOrderDual {α : Type u_1} [Add α] [h : IsLeftCancelAdd α] :
IsLeftCancelAdd αᵒᵈ
source
theorem instIsRightCancelMulOrderDual {α : Type u_1} [Mul α] [h : IsRightCancelMul α] :
IsRightCancelMul αᵒᵈ
source
theorem instIsAddRightCancelOrderDual {α : Type u_1} [Add α] [h : IsRightCancelAdd α] :
IsRightCancelAdd αᵒᵈ
source
theorem instIsCancelMulOrderDual {α : Type u_1} [Mul α] [h : IsCancelMul α] :
IsCancelMul αᵒᵈ
source
theorem instIsAddCancelOrderDual {α : Type u_1} [Add α] [h : IsCancelAdd α] :
IsCancelAdd αᵒᵈ
source
instance instLeftCancelSemigroupOrderDual {α : Type u_1} [h : LeftCancelSemigroup α] :
LeftCancelSemigroup αᵒᵈ
Equations
  • instLeftCancelSemigroupOrderDual = h
source
instance instAddLeftCancelSemigroupOrderDual {α : Type u_1} [h : AddLeftCancelSemigroup α] :
AddLeftCancelSemigroup αᵒᵈ
Equations
  • instAddLeftCancelSemigroupOrderDual = h
source
instance instRightCancelSemigroupOrderDual {α : Type u_1} [h : RightCancelSemigroup α] :
RightCancelSemigroup αᵒᵈ
Equations
  • instRightCancelSemigroupOrderDual = h
source
instance instAddRightCancelSemigroupOrderDual {α : Type u_1} [h : AddRightCancelSemigroup α] :
AddRightCancelSemigroup αᵒᵈ
Equations
  • instAddRightCancelSemigroupOrderDual = h
source
instance instMulOneClassOrderDual {α : Type u_1} [h : MulOneClass α] :
MulOneClass αᵒᵈ
Equations
  • instMulOneClassOrderDual = h
source
instance instAddZeroClassOrderDual {α : Type u_1} [h : AddZeroClass α] :
AddZeroClass αᵒᵈ
Equations
  • instAddZeroClassOrderDual = h
source
instance instMonoidOrderDual {α : Type u_1} [h : Monoid α] :
Monoid αᵒᵈ
Equations
  • instMonoidOrderDual = h
source
instance instAddMonoidOrderDual {α : Type u_1} [h : AddMonoid α] :
AddMonoid αᵒᵈ
Equations
  • instAddMonoidOrderDual = h
source
instance OrderDual.instCommMonoid {α : Type u_1} [h : CommMonoid α] :
CommMonoid αᵒᵈ
Equations
  • OrderDual.instCommMonoid = h
source
instance OrderDual.instAddCommMonoid {α : Type u_1} [h : AddCommMonoid α] :
AddCommMonoid αᵒᵈ
Equations
  • OrderDual.instAddCommMonoid = h
source
instance instLeftCancelMonoidOrderDual {α : Type u_1} [h : LeftCancelMonoid α] :
LeftCancelMonoid αᵒᵈ
Equations
  • instLeftCancelMonoidOrderDual = h
source
instance instAddLeftCancelMonoidOrderDual {α : Type u_1} [h : AddLeftCancelMonoid α] :
AddLeftCancelMonoid αᵒᵈ
Equations
  • instAddLeftCancelMonoidOrderDual = h
source
instance instRightCancelMonoidOrderDual {α : Type u_1} [h : RightCancelMonoid α] :
RightCancelMonoid αᵒᵈ
Equations
  • instRightCancelMonoidOrderDual = h
source
instance instAddRightCancelMonoidOrderDual {α : Type u_1} [h : AddRightCancelMonoid α] :
AddRightCancelMonoid αᵒᵈ
Equations
  • instAddRightCancelMonoidOrderDual = h
source
instance instCancelMonoidOrderDual {α : Type u_1} [h : CancelMonoid α] :
CancelMonoid αᵒᵈ
Equations
  • instCancelMonoidOrderDual = h
source
instance instAddCancelMonoidOrderDual {α : Type u_1} [h : AddCancelMonoid α] :
AddCancelMonoid αᵒᵈ
Equations
  • instAddCancelMonoidOrderDual = h
source
instance OrderDual.instCancelCommMonoid {α : Type u_1} [h : CancelCommMonoid α] :
CancelCommMonoid αᵒᵈ
Equations
  • OrderDual.instCancelCommMonoid = h
source
instance OrderDual.instAddCancelCommMonoid {α : Type u_1} [h : AddCancelCommMonoid α] :
AddCancelCommMonoid αᵒᵈ
Equations
  • OrderDual.instAddCancelCommMonoid = h
source
instance instInvolutiveInvOrderDual {α : Type u_1} [h : InvolutiveInv α] :
InvolutiveInv αᵒᵈ
Equations
  • instInvolutiveInvOrderDual = h
source
instance instInvolutiveNegOrderDual {α : Type u_1} [h : InvolutiveNeg α] :
InvolutiveNeg αᵒᵈ
Equations
  • instInvolutiveNegOrderDual = h
source
instance instDivInvMonoidOrderDual {α : Type u_1} [h : DivInvMonoid α] :
DivInvMonoid αᵒᵈ
Equations
  • instDivInvMonoidOrderDual = h
source
instance instSubNegAddMonoidOrderDual {α : Type u_1} [h : SubNegMonoid α] :
SubNegMonoid αᵒᵈ
Equations
  • instSubNegAddMonoidOrderDual = h
source
instance instDivisionMonoidOrderDual {α : Type u_1} [h : DivisionMonoid α] :
DivisionMonoid αᵒᵈ
Equations
  • instDivisionMonoidOrderDual = h
source
instance instSubtractionMonoidOrderDual {α : Type u_1} [h : SubtractionMonoid α] :
SubtractionMonoid αᵒᵈ
Equations
  • instSubtractionMonoidOrderDual = h
source
instance instDivisionCommMonoidOrderDual {α : Type u_1} [h : DivisionCommMonoid α] :
DivisionCommMonoid αᵒᵈ
Equations
  • instDivisionCommMonoidOrderDual = h
source
instance OrderDual.subtractionCommMonoid {α : Type u_1} [h : SubtractionCommMonoid α] :
SubtractionCommMonoid αᵒᵈ
Equations
  • OrderDual.subtractionCommMonoid = h
source
instance OrderDual.instGroup {α : Type u_1} [h : Group α] :
Group αᵒᵈ
Equations
  • OrderDual.instGroup = h
source
instance OrderDual.instAddGroup {α : Type u_1} [h : AddGroup α] :
AddGroup αᵒᵈ
Equations
  • OrderDual.instAddGroup = h
source
instance instCommGroupOrderDual {α : Type u_1} [h : CommGroup α] :
CommGroup αᵒᵈ
Equations
  • instCommGroupOrderDual = h
source
instance instAddCommGroupOrderDual {α : Type u_1} [h : AddCommGroup α] :
AddCommGroup αᵒᵈ
Equations
  • instAddCommGroupOrderDual = h
source
@[simp]
theorem toDual_one {α : Type u_1} [One α] :
OrderDual.toDual 1 = 1
source
@[simp]
theorem toDual_zero {α : Type u_1} [Zero α] :
OrderDual.toDual 0 = 0
source
@[simp]
theorem ofDual_one {α : Type u_1} [One α] :
OrderDual.ofDual 1 = 1
source
@[simp]
theorem ofDual_zero {α : Type u_1} [Zero α] :
OrderDual.ofDual 0 = 0
source
@[simp]
theorem toDual_mul {α : Type u_1} [Mul α] (a b : α) :
OrderDual.toDual (a * b) = OrderDual.toDual a * OrderDual.toDual b
source
@[simp]
theorem toDual_add {α : Type u_1} [Add α] (a b : α) :
OrderDual.toDual (a + b) = OrderDual.toDual a + OrderDual.toDual b
source
@[simp]
theorem ofDual_mul {α : Type u_1} [Mul α] (a b : αᵒᵈ) :
OrderDual.ofDual (a * b) = OrderDual.ofDual a * OrderDual.ofDual b
source
@[simp]
theorem ofDual_add {α : Type u_1} [Add α] (a b : αᵒᵈ) :
OrderDual.ofDual (a + b) = OrderDual.ofDual a + OrderDual.ofDual b
source
@[simp]
theorem toDual_inv {α : Type u_1} [Inv α] (a : α) :
OrderDual.toDual a⁻¹ = (OrderDual.toDual a)⁻¹
source
@[simp]
theorem toDual_neg {α : Type u_1} [Neg α] (a : α) :
OrderDual.toDual (-a) = -OrderDual.toDual a
source
@[simp]
theorem ofDual_inv {α : Type u_1} [Inv α] (a : αᵒᵈ) :
OrderDual.ofDual a⁻¹ = (OrderDual.ofDual a)⁻¹
source
@[simp]
theorem ofDual_neg {α : Type u_1} [Neg α] (a : αᵒᵈ) :
OrderDual.ofDual (-a) = -OrderDual.ofDual a
source
@[simp]
theorem toDual_div {α : Type u_1} [Div α] (a b : α) :
OrderDual.toDual (a / b) = OrderDual.toDual a / OrderDual.toDual b
source
@[simp]
theorem toDual_sub {α : Type u_1} [Sub α] (a b : α) :
OrderDual.toDual (a - b) = OrderDual.toDual a - OrderDual.toDual b
source
@[simp]
theorem ofDual_div {α : Type u_1} [Div α] (a b : αᵒᵈ) :
OrderDual.ofDual (a / b) = OrderDual.ofDual a / OrderDual.ofDual b
source
@[simp]
theorem ofDual_sub {α : Type u_1} [Sub α] (a b : αᵒᵈ) :
OrderDual.ofDual (a - b) = OrderDual.ofDual a - OrderDual.ofDual b
source
@[simp]
theorem toDual_pow {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) :
OrderDual.toDual (a ^ b) = OrderDual.toDual a ^ b
source
@[simp]
theorem toDual_smul {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) :
OrderDual.toDual (b • a) = b • OrderDual.toDual a
source
@[simp]
theorem toDual_vadd {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) :
OrderDual.toDual (b +ᵥ a) = b +ᵥ OrderDual.toDual a
source
@[simp]
theorem ofDual_pow {α : Type u_1} {β : Type u_2} [Pow α β] (a : αᵒᵈ) (b : β) :
OrderDual.ofDual (a ^ b) = OrderDual.ofDual a ^ b
source
@[simp]
theorem ofDual_vadd {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : αᵒᵈ) :
OrderDual.ofDual (b +ᵥ a) = b +ᵥ OrderDual.ofDual a
source
@[simp]
theorem ofDual_smul {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : αᵒᵈ) :
OrderDual.ofDual (b • a) = b • OrderDual.ofDual a
source
@[simp]
theorem pow_toDual {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) :
a ^ OrderDual.toDual b = a ^ b
source
@[simp]
theorem toDual_vadd' {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) :
OrderDual.toDual b +ᵥ a = b +ᵥ a
source
@[simp]
theorem toDual_smul' {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) :
OrderDual.toDual b • a = b • a
source
@[simp]
theorem pow_ofDual {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : βᵒᵈ) :
a ^ OrderDual.ofDual b = a ^ b
source
@[simp]
theorem ofDual_vadd' {β : Type u_2} {α : Type u_1} [VAdd β α] (b : βᵒᵈ) (a : α) :
OrderDual.ofDual b +ᵥ a = b +ᵥ a
source
@[simp]
theorem ofDual_smul' {β : Type u_2} {α : Type u_1} [SMul β α] (b : βᵒᵈ) (a : α) :
OrderDual.ofDual b • a = b • a

Lexicographical order #

source
instance instOneLex {α : Type u_1} [h : One α] :
One (Lex α)
Equations
  • instOneLex = h
source
instance instZeroLex {α : Type u_1} [h : Zero α] :
Zero (Lex α)
Equations
  • instZeroLex = h
source
instance instMulLex {α : Type u_1} [h : Mul α] :
Mul (Lex α)
Equations
  • instMulLex = h
source
instance instAddLex {α : Type u_1} [h : Add α] :
Add (Lex α)
Equations
  • instAddLex = h
source
instance instInvLex {α : Type u_1} [h : Inv α] :
Inv (Lex α)
Equations
  • instInvLex = h
source
instance instNegLex {α : Type u_1} [h : Neg α] :
Neg (Lex α)
Equations
  • instNegLex = h
source
instance instDivLex {α : Type u_1} [h : Div α] :
Div (Lex α)
Equations
  • instDivLex = h
source
instance instSubLex {α : Type u_1} [h : Sub α] :
Sub (Lex α)
Equations
  • instSubLex = h
source
instance Lex.instPow {α : Type u_1} {β : Type u_2} [h : Pow α β] :
Pow (Lex α) β
Equations
  • Lex.instPow = h
source
instance Lex.instSMul {β : Type u_2} {α : Type u_1} [h : SMul β α] :
SMul β (Lex α)
Equations
  • Lex.instSMul = h
source
instance Lex.instVAdd {β : Type u_2} {α : Type u_1} [h : VAdd β α] :
VAdd β (Lex α)
Equations
  • Lex.instVAdd = h
source
instance Lex.instPow' {α : Type u_1} {β : Type u_2} [h : Pow α β] :
Pow α (Lex β)
Equations
  • Lex.instPow' = h
source
instance Lex.instSMul' {β : Type u_2} {α : Type u_1} [h : SMul β α] :
SMul (Lex β) α
Equations
  • Lex.instSMul' = h
source
instance Lex.instVAdd' {β : Type u_2} {α : Type u_1} [h : VAdd β α] :
VAdd (Lex β) α
Equations
  • Lex.instVAdd' = h
source
instance instSemigroupLex {α : Type u_1} [h : Semigroup α] :
Semigroup (Lex α)
Equations
  • instSemigroupLex = h
source
instance instAddSemigroupLex {α : Type u_1} [h : AddSemigroup α] :
AddSemigroup (Lex α)
Equations
  • instAddSemigroupLex = h
source
instance instCommSemigroupLex {α : Type u_1} [h : CommSemigroup α] :
CommSemigroup (Lex α)
Equations
  • instCommSemigroupLex = h
source
instance instAddCommSemigroupLex {α : Type u_1} [h : AddCommSemigroup α] :
AddCommSemigroup (Lex α)
Equations
  • instAddCommSemigroupLex = h
source
instance instLeftCancelSemigroupLex {α : Type u_1} [h : LeftCancelSemigroup α] :
LeftCancelSemigroup (Lex α)
Equations
  • instLeftCancelSemigroupLex = h
source
instance instAddLeftCancelSemigroupLex {α : Type u_1} [h : AddLeftCancelSemigroup α] :
AddLeftCancelSemigroup (Lex α)
Equations
  • instAddLeftCancelSemigroupLex = h
source
instance instRightCancelSemigroupLex {α : Type u_1} [h : RightCancelSemigroup α] :
RightCancelSemigroup (Lex α)
Equations
  • instRightCancelSemigroupLex = h
source
instance instAddRightCancelSemigroupLex {α : Type u_1} [h : AddRightCancelSemigroup α] :
AddRightCancelSemigroup (Lex α)
Equations
  • instAddRightCancelSemigroupLex = h
source
instance instMulOneClassLex {α : Type u_1} [h : MulOneClass α] :
MulOneClass (Lex α)
Equations
  • instMulOneClassLex = h
source
instance instAddZeroClassLex {α : Type u_1} [h : AddZeroClass α] :
AddZeroClass (Lex α)
Equations
  • instAddZeroClassLex = h
source
instance instMonoidLex {α : Type u_1} [h : Monoid α] :
Monoid (Lex α)
Equations
  • instMonoidLex = h
source
instance instAddMonoidLex {α : Type u_1} [h : AddMonoid α] :
AddMonoid (Lex α)
Equations
  • instAddMonoidLex = h
source
instance instCommMonoidLex {α : Type u_1} [h : CommMonoid α] :
CommMonoid (Lex α)
Equations
  • instCommMonoidLex = h
source
instance instAddCommMonoidLex {α : Type u_1} [h : AddCommMonoid α] :
AddCommMonoid (Lex α)
Equations
  • instAddCommMonoidLex = h
source
instance instLeftCancelMonoidLex {α : Type u_1} [h : LeftCancelMonoid α] :
LeftCancelMonoid (Lex α)
Equations
  • instLeftCancelMonoidLex = h
source
instance instAddLeftCancelMonoidLex {α : Type u_1} [h : AddLeftCancelMonoid α] :
AddLeftCancelMonoid (Lex α)
Equations
  • instAddLeftCancelMonoidLex = h
source
instance instRightCancelMonoidLex {α : Type u_1} [h : RightCancelMonoid α] :
RightCancelMonoid (Lex α)
Equations
  • instRightCancelMonoidLex = h
source
instance instAddRightCancelMonoidLex {α : Type u_1} [h : AddRightCancelMonoid α] :
AddRightCancelMonoid (Lex α)
Equations
  • instAddRightCancelMonoidLex = h
source
instance instCancelMonoidLex {α : Type u_1} [h : CancelMonoid α] :
CancelMonoid (Lex α)
Equations
  • instCancelMonoidLex = h
source
instance instAddCancelMonoidLex {α : Type u_1} [h : AddCancelMonoid α] :
AddCancelMonoid (Lex α)
Equations
  • instAddCancelMonoidLex = h
source
instance instCancelCommMonoidLex {α : Type u_1} [h : CancelCommMonoid α] :
CancelCommMonoid (Lex α)
Equations
  • instCancelCommMonoidLex = h
source
instance instAddCancelCommMonoidLex {α : Type u_1} [h : AddCancelCommMonoid α] :
AddCancelCommMonoid (Lex α)
Equations
  • instAddCancelCommMonoidLex = h
source
instance instInvolutiveInvLex {α : Type u_1} [h : InvolutiveInv α] :
InvolutiveInv (Lex α)
Equations
  • instInvolutiveInvLex = h
source
instance instInvolutiveNegLex {α : Type u_1} [h : InvolutiveNeg α] :
InvolutiveNeg (Lex α)
Equations
  • instInvolutiveNegLex = h
source
instance instDivInvMonoidLex {α : Type u_1} [h : DivInvMonoid α] :
DivInvMonoid (Lex α)
Equations
  • instDivInvMonoidLex = h
source
instance instSubNegAddMonoidLex {α : Type u_1} [h : SubNegMonoid α] :
SubNegMonoid (Lex α)
Equations
  • instSubNegAddMonoidLex = h
source
instance instDivisionMonoidLex {α : Type u_1} [h : DivisionMonoid α] :
DivisionMonoid (Lex α)
Equations
  • instDivisionMonoidLex = h
source
instance instSubtractionMonoidLex {α : Type u_1} [h : SubtractionMonoid α] :
SubtractionMonoid (Lex α)
Equations
  • instSubtractionMonoidLex = h
source
instance instDivisionCommMonoidLex {α : Type u_1} [h : DivisionCommMonoid α] :
DivisionCommMonoid (Lex α)
Equations
  • instDivisionCommMonoidLex = h
source
instance instGroupLex {α : Type u_1} [h : Group α] :
Group (Lex α)
Equations
  • instGroupLex = h
source
instance instAddGroupLex {α : Type u_1} [h : AddGroup α] :
AddGroup (Lex α)
Equations
  • instAddGroupLex = h
source
instance instCommGroupLex {α : Type u_1} [h : CommGroup α] :
CommGroup (Lex α)
Equations
  • instCommGroupLex = h
source
instance instAddCommGroupLex {α : Type u_1} [h : AddCommGroup α] :
AddCommGroup (Lex α)
Equations
  • instAddCommGroupLex = h
source
@[simp]
theorem toLex_one {α : Type u_1} [One α] :
toLex 1 = 1
source
@[simp]
theorem toLex_zero {α : Type u_1} [Zero α] :
toLex 0 = 0
source
@[simp]
theorem ofLex_one {α : Type u_1} [One α] :
ofLex 1 = 1
source
@[simp]
theorem ofLex_zero {α : Type u_1} [Zero α] :
ofLex 0 = 0
source
@[simp]
theorem toLex_mul {α : Type u_1} [Mul α] (a b : α) :
toLex (a * b) = toLex a * toLex b
source
@[simp]
theorem toLex_add {α : Type u_1} [Add α] (a b : α) :
toLex (a + b) = toLex a + toLex b
source
@[simp]
theorem ofLex_mul {α : Type u_1} [Mul α] (a b : Lex α) :
ofLex (a * b) = ofLex a * ofLex b
source
@[simp]
theorem ofLex_add {α : Type u_1} [Add α] (a b : Lex α) :
ofLex (a + b) = ofLex a + ofLex b
source
@[simp]
theorem toLex_inv {α : Type u_1} [Inv α] (a : α) :
toLex a⁻¹ = (toLex a)⁻¹
source
@[simp]
theorem toLex_neg {α : Type u_1} [Neg α] (a : α) :
toLex (-a) = -toLex a
source
@[simp]
theorem ofLex_inv {α : Type u_1} [Inv α] (a : Lex α) :
ofLex a⁻¹ = (ofLex a)⁻¹
source
@[simp]
theorem ofLex_neg {α : Type u_1} [Neg α] (a : Lex α) :
ofLex (-a) = -ofLex a
source
@[simp]
theorem toLex_div {α : Type u_1} [Div α] (a b : α) :
toLex (a / b) = toLex a / toLex b
source
@[simp]
theorem toLex_sub {α : Type u_1} [Sub α] (a b : α) :
toLex (a - b) = toLex a - toLex b
source
@[simp]
theorem ofLex_div {α : Type u_1} [Div α] (a b : Lex α) :
ofLex (a / b) = ofLex a / ofLex b
source
@[simp]
theorem ofLex_sub {α : Type u_1} [Sub α] (a b : Lex α) :
ofLex (a - b) = ofLex a - ofLex b
source
@[simp]
theorem toLex_pow {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) :
toLex (a ^ b) = toLex a ^ b
source
@[simp]
theorem toLex_smul {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) :
toLex (b • a) = b • toLex a
source
@[simp]
theorem toLex_vadd {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) :
toLex (b +ᵥ a) = b +ᵥ toLex a
source
@[simp]
theorem ofLex_pow {α : Type u_1} {β : Type u_2} [Pow α β] (a : Lex α) (b : β) :
ofLex (a ^ b) = ofLex a ^ b
source
@[simp]
theorem ofLex_vadd {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : Lex α) :
ofLex (b +ᵥ a) = b +ᵥ ofLex a
source
@[simp]
theorem ofLex_smul {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : Lex α) :
ofLex (b • a) = b • ofLex a
source
@[simp]
theorem pow_toLex {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : β) :
a ^ toLex b = a ^ b
source
@[simp]
theorem toLex_vadd' {β : Type u_2} {α : Type u_1} [VAdd β α] (b : β) (a : α) :
toLex b +ᵥ a = b +ᵥ a
source
@[simp]
theorem toLex_smul' {β : Type u_2} {α : Type u_1} [SMul β α] (b : β) (a : α) :
toLex b • a = b • a
source
@[simp]
theorem pow_ofLex {α : Type u_1} {β : Type u_2} [Pow α β] (a : α) (b : Lex β) :
a ^ ofLex b = a ^ b
source
@[simp]
theorem ofLex_vadd' {β : Type u_2} {α : Type u_1} [VAdd β α] (b : Lex β) (a : α) :
ofLex b +ᵥ a = b +ᵥ a
source
@[simp]
theorem ofLex_smul' {β : Type u_2} {α : Type u_1} [SMul β α] (b : Lex β) (a : α) :
ofLex b • a = b • a