Additional instances for ordered commutative groups.

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

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

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

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

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

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

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

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

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

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

theorem OrderDual.linearOrderedAddCommGroup.proof_1 {α : Type u_1} [LinearOrderedAddCommGroup α] (a : αᵒᵈ) (b : αᵒᵈ) : a ≤ b → ∀ (c : αᵒᵈ), c + a ≤ c + b

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