Order instances for MulOpposite/AddOpposite

This files transfers order instances and ordered monoid/group instances from α to αᵐᵒᵖ and αᵃᵒᵖ.

instance MulOpposite.instPreorder {α : Type u_1} [Preorder α] : Preorder αᵐᵒᵖ

Equations

• MulOpposite.instPreorder = Preorder.lift MulOpposite.unop

instance AddOpposite.instPreorder {α : Type u_1} [Preorder α] : Preorder αᵃᵒᵖ

Equations

• AddOpposite.instPreorder = Preorder.lift AddOpposite.unop

@[simp]

theorem MulOpposite.unop_le_unop {α : Type u_1} [Preorder α] {a b : αᵐᵒᵖ} : unop a ≤ unop b ↔ a ≤ b

@[simp]

theorem AddOpposite.unop_le_unop {α : Type u_1} [Preorder α] {a b : αᵃᵒᵖ} : unop a ≤ unop b ↔ a ≤ b

@[simp]

theorem MulOpposite.op_le_op {α : Type u_1} [Preorder α] {a b : α} : op a ≤ op b ↔ a ≤ b

@[simp]

theorem AddOpposite.op_le_op {α : Type u_1} [Preorder α] {a b : α} : op a ≤ op b ↔ a ≤ b

instance MulOpposite.instPartialOrder {α : Type u_1} [PartialOrder α] : PartialOrder αᵐᵒᵖ

Equations

• MulOpposite.instPartialOrder = PartialOrder.lift MulOpposite.unop ⋯

instance AddOpposite.instPartialOrder {α : Type u_1} [PartialOrder α] : PartialOrder αᵃᵒᵖ

Equations

• AddOpposite.instPartialOrder = PartialOrder.lift AddOpposite.unop ⋯

instance MulOpposite.instOrderedCommMonoid {α : Type u_1} [OrderedCommMonoid α] : OrderedCommMonoid αᵐᵒᵖ

Equations

• MulOpposite.instOrderedCommMonoid = { toCommMonoid := MulOpposite.instCommMonoid, toPartialOrder := MulOpposite.instPartialOrder, mul_le_mul_left := ⋯ }

instance AddOpposite.instOrderedAddCommMonoid {α : Type u_1} [OrderedAddCommMonoid α] : OrderedAddCommMonoid αᵃᵒᵖ

Equations

• AddOpposite.instOrderedAddCommMonoid = { toAddCommMonoid := AddOpposite.instAddCommMonoid, toPartialOrder := AddOpposite.instPartialOrder, add_le_add_left := ⋯ }

@[simp]

theorem MulOpposite.unop_le_one {α : Type u_1} [OrderedCommMonoid α] {a : αᵐᵒᵖ} : unop a ≤ 1 ↔ a ≤ 1

@[simp]

theorem AddOpposite.unop_nonpos {α : Type u_1} [OrderedAddCommMonoid α] {a : αᵃᵒᵖ} : unop a ≤ 0 ↔ a ≤ 0

@[simp]

theorem MulOpposite.one_le_unop {α : Type u_1} [OrderedCommMonoid α] {a : αᵐᵒᵖ} : 1 ≤ unop a ↔ 1 ≤ a

@[simp]

theorem AddOpposite.nonneg_unop {α : Type u_1} [OrderedAddCommMonoid α] {a : αᵃᵒᵖ} : 0 ≤ unop a ↔ 0 ≤ a

@[simp]

theorem MulOpposite.op_le_one {α : Type u_1} [OrderedCommMonoid α] {a : α} : op a ≤ 1 ↔ a ≤ 1

@[simp]

theorem AddOpposite.op_nonpos {α : Type u_1} [OrderedAddCommMonoid α] {a : α} : op a ≤ 0 ↔ a ≤ 0

@[simp]

theorem MulOpposite.one_le_op {α : Type u_1} [OrderedCommMonoid α] {a : α} : 1 ≤ op a ↔ 1 ≤ a

@[simp]

theorem AddOpposite.nonneg_op {α : Type u_1} [OrderedAddCommMonoid α] {a : α} : 0 ≤ op a ↔ 0 ≤ a

instance MulOpposite.instOrderedCommGroup {α : Type u_1} [OrderedCommGroup α] : OrderedCommGroup αᵐᵒᵖ

Equations

• MulOpposite.instOrderedCommGroup = { toCommGroup := MulOpposite.instCommGroup, toPartialOrder := OrderedCommMonoid.toPartialOrder, mul_le_mul_left := ⋯ }

instance AddOpposite.instOrderedAddCommGroup {α : Type u_1} [OrderedAddCommGroup α] : OrderedAddCommGroup αᵃᵒᵖ

Equations

• AddOpposite.instOrderedAddCommGroup = { toAddCommGroup := AddOpposite.instAddCommGroup, toPartialOrder := OrderedAddCommMonoid.toPartialOrder, add_le_add_left := ⋯ }

instance MulOpposite.instOrderedAddCommMonoid {α : Type u_1} [OrderedAddCommMonoid α] : OrderedAddCommMonoid αᵐᵒᵖ

Equations

• MulOpposite.instOrderedAddCommMonoid = { toAddCommMonoid := MulOpposite.instAddCommMonoid, toPartialOrder := MulOpposite.instPartialOrder, add_le_add_left := ⋯ }

@[simp]

theorem MulOpposite.unop_nonpos {α : Type u_1} [OrderedAddCommMonoid α] {a : αᵐᵒᵖ} : unop a ≤ 0 ↔ a ≤ 0

@[simp]

theorem MulOpposite.unop_nonneg {α : Type u_1} [OrderedAddCommMonoid α] {a : αᵐᵒᵖ} : 0 ≤ unop a ↔ 0 ≤ a

@[simp]

theorem MulOpposite.op_nonpos {α : Type u_1} [OrderedAddCommMonoid α] {a : α} : op a ≤ 0 ↔ a ≤ 0

@[simp]

theorem MulOpposite.op_nonneg {α : Type u_1} [OrderedAddCommMonoid α] {a : α} : 0 ≤ op a ↔ 0 ≤ a

instance MulOpposite.instOrderedAddCommGroup {α : Type u_1} [OrderedAddCommGroup α] : OrderedAddCommGroup αᵐᵒᵖ

Equations

• MulOpposite.instOrderedAddCommGroup = { toAddCommGroup := MulOpposite.instAddCommGroup, toPartialOrder := OrderedAddCommMonoid.toPartialOrder, add_le_add_left := ⋯ }

instance AddOpposite.instOrderedCommMonoid {α : Type u_1} [OrderedCommMonoid α] : OrderedCommMonoid αᵃᵒᵖ

Equations

• AddOpposite.instOrderedCommMonoid = { toCommMonoid := AddOpposite.instCommMonoid, toPartialOrder := AddOpposite.instPartialOrder, mul_le_mul_left := ⋯ }

@[simp]

theorem AddOpposite.unop_le_one {α : Type u_1} [OrderedCommMonoid α] {a : αᵃᵒᵖ} : unop a ≤ 1 ↔ a ≤ 1

@[simp]

theorem AddOpposite.one_le_unop {α : Type u_1} [OrderedCommMonoid α] {a : αᵃᵒᵖ} : 1 ≤ unop a ↔ 1 ≤ a

@[simp]

theorem AddOpposite.op_le_one {α : Type u_1} [OrderedCommMonoid α] {a : α} : op a ≤ 1 ↔ a ≤ 1

@[simp]

theorem AddOpposite.one_le_op {α : Type u_1} [OrderedCommMonoid α] {a : α} : 1 ≤ op a ↔ 1 ≤ a

instance AddOpposite.instOrderedCommGroup {α : Type u_1} [OrderedCommGroup α] : OrderedCommGroup αᵃᵒᵖ

Equations

• AddOpposite.instOrderedCommGroup = { toCommGroup := AddOpposite.instCommGroup, toPartialOrder := OrderedCommMonoid.toPartialOrder, mul_le_mul_left := ⋯ }