Additional instances for ordered commutative groups.

theorem OrderDual.orderedAddCommGroup.proof_4 {α : Type u_1} [OrderedAddCommGroup α] (n : ℕ) (a : αᵒᵈ) : SubNegMonoid.zsmul (Int.negSucc n) a = -SubNegMonoid.zsmul (↑(Nat.succ n)) a

theorem OrderDual.orderedAddCommGroup.proof_1 {α : Type u_1} [OrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : a - b = a + -b

theorem OrderDual.orderedAddCommGroup.proof_3 {α : Type u_1} [OrderedAddCommGroup α] (n : ℕ) (a : αᵒᵈ) : SubNegMonoid.zsmul (Int.ofNat (Nat.succ n)) a = SubNegMonoid.zsmul (Int.ofNat n) a + a

instance OrderDual.orderedAddCommGroup {α : Type u_1} [OrderedAddCommGroup α] : OrderedAddCommGroup αᵒᵈ

Equations

• OrderDual.orderedAddCommGroup = let __src := OrderDual.orderedAddCommMonoid; let __src_1 := OrderDual.instAddGroup; OrderedAddCommGroup.mk ⋯

theorem OrderDual.orderedAddCommGroup.proof_7 {α : Type u_1} [OrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : a ≤ b → ∀ (c : αᵒᵈ), c + a ≤ c + b

theorem OrderDual.orderedAddCommGroup.proof_2 {α : Type u_1} [OrderedAddCommGroup α] (a : αᵒᵈ) : SubNegMonoid.zsmul 0 a = 0

theorem OrderDual.orderedAddCommGroup.proof_5 {α : Type u_1} [OrderedAddCommGroup α] (a : αᵒᵈ) : -a + a = 0

theorem OrderDual.orderedAddCommGroup.proof_6 {α : Type u_1} [OrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : a + b = b + a

instance OrderDual.orderedCommGroup {α : Type u_1} [OrderedCommGroup α] : OrderedCommGroup αᵒᵈ

Equations

• OrderDual.orderedCommGroup = let __src := OrderDual.orderedCommMonoid; let __src_1 := OrderDual.instGroup; OrderedCommGroup.mk ⋯

instance OrderDual.linearOrderedAddCommGroup {α : Type u_1} [LinearOrderedAddCommGroup α] : LinearOrderedAddCommGroup αᵒᵈ

Equations

• One or more equations did not get rendered due to their size.

theorem OrderDual.linearOrderedAddCommGroup.proof_3 {α : Type u_1} [LinearOrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : max a b = if a ≤ b then b else a

theorem OrderDual.linearOrderedAddCommGroup.proof_4 {α : Type u_1} [LinearOrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : compare a b = compareOfLessAndEq a b

theorem OrderDual.linearOrderedAddCommGroup.proof_2 {α : Type u_1} [LinearOrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : min a b = if a ≤ b then a else b

theorem OrderDual.linearOrderedAddCommGroup.proof_1 {α : Type u_1} [LinearOrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : a ≤ b ∨ b ≤ a

instance OrderDual.linearOrderedCommGroup {α : Type u_1} [LinearOrderedCommGroup α] : LinearOrderedCommGroup αᵒᵈ

Equations

• One or more equations did not get rendered due to their size.