order.monotone.odd | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

9116dd67

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

c3291da4

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.Order.Monotone.Union
-import Mathbin.Algebra.Order.Group.Instances
+import Order.Monotone.Union
+import Algebra.Order.Group.Instances
 
 #align_import order.monotone.odd from "leanprover-community/mathlib"@"c3291da49cfa65f0d43b094750541c0731edc932"

c3291da4

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module order.monotone.odd
-! leanprover-community/mathlib commit c3291da49cfa65f0d43b094750541c0731edc932
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Order.Monotone.Union
 import Mathbin.Algebra.Order.Group.Instances
 
+#align_import order.monotone.odd from "leanprover-community/mathlib"@"c3291da49cfa65f0d43b094750541c0731edc932"
+
 /-!
 # Monotonicity of odd functions

c3291da4

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -27,6 +27,7 @@ open Set
 
 variable {G H : Type _} [LinearOrderedAddCommGroup G] [OrderedAddCommGroup H]
 
+#print strictMono_of_odd_strictMonoOn_nonneg /-
 /-- An odd function on a linear ordered additive commutative group is strictly monotone on the whole
 group provided that it is strictly monotone on `set.Ici 0`. -/
 theorem strictMono_of_odd_strictMonoOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
@@ -36,14 +37,18 @@ theorem strictMono_of_odd_strictMonoOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x
   rw [← h₁, ← h₁]
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_lt_neg hxy)
 #align strict_mono_of_odd_strict_mono_on_nonneg strictMono_of_odd_strictMonoOn_nonneg
+-/
 
+#print strictAnti_of_odd_strictAntiOn_nonneg /-
 /-- An odd function on a linear ordered additive commutative group is strictly antitone on the whole
 group provided that it is strictly antitone on `set.Ici 0`. -/
 theorem strictAnti_of_odd_strictAntiOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : StrictAntiOn f (Ici 0)) : StrictAnti f :=
   @strictMono_of_odd_strictMonoOn_nonneg G Hᵒᵈ _ _ _ h₁ h₂
 #align strict_anti_of_odd_strict_anti_on_nonneg strictAnti_of_odd_strictAntiOn_nonneg
+-/
 
+#print monotone_of_odd_of_monotoneOn_nonneg /-
 /-- An odd function on a linear ordered additive commutative group is monotone on the whole group
 provided that it is monotone on `set.Ici 0`. -/
 theorem monotone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
@@ -53,11 +58,14 @@ theorem monotone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x)
   rw [← h₁, ← h₁]
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_le_neg hxy)
 #align monotone_of_odd_of_monotone_on_nonneg monotone_of_odd_of_monotoneOn_nonneg
+-/
 
+#print antitone_of_odd_of_monotoneOn_nonneg /-
 /-- An odd function on a linear ordered additive commutative group is antitone on the whole group
 provided that it is monotone on `set.Ici 0`. -/
 theorem antitone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : AntitoneOn f (Ici 0)) : Antitone f :=
   @monotone_of_odd_of_monotoneOn_nonneg G Hᵒᵈ _ _ _ h₁ h₂
 #align antitone_of_odd_of_monotone_on_nonneg antitone_of_odd_of_monotoneOn_nonneg
+-/

c3291da4

bump to nightly-2023-05-28-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

ba5d8b97

Diff

@@ -27,12 +27,6 @@ open Set
 
 variable {G H : Type _} [LinearOrderedAddCommGroup G] [OrderedAddCommGroup H]
 
-/- warning: strict_mono_of_odd_strict_mono_on_nonneg -> strictMono_of_odd_strictMonoOn_nonneg is a dubious translation:
-lean 3 declaration is
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (SubNegMonoid.toHasNeg.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))) x)) (Neg.neg.{u2} H (SubNegMonoid.toHasNeg.{u2} H (AddGroup.toSubNegMonoid.{u2} H (AddCommGroup.toAddGroup.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))) (f x))) -> (StrictMonoOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (OfNat.mk.{u1} G 0 (Zero.zero.{u1} G (AddZeroClass.toHasZero.{u1} G (AddMonoid.toAddZeroClass.{u1} G (SubNegMonoid.toAddMonoid.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1)))))))))))) -> (StrictMono.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-but is expected to have type
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (NegZeroClass.toNeg.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))) x)) (Neg.neg.{u2} H (NegZeroClass.toNeg.{u2} H (SubNegZeroMonoid.toNegZeroClass.{u2} H (SubtractionMonoid.toSubNegZeroMonoid.{u2} H (SubtractionCommMonoid.toSubtractionMonoid.{u2} H (AddCommGroup.toDivisionAddCommMonoid.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))))) (f x))) -> (StrictMonoOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (Zero.toOfNat0.{u1} G (NegZeroClass.toZero.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))))))) -> (StrictMono.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-Case conversion may be inaccurate. Consider using '#align strict_mono_of_odd_strict_mono_on_nonneg strictMono_of_odd_strictMonoOn_nonnegₓ'. -/
 /-- An odd function on a linear ordered additive commutative group is strictly monotone on the whole
 group provided that it is strictly monotone on `set.Ici 0`. -/
 theorem strictMono_of_odd_strictMonoOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
@@ -43,12 +37,6 @@ theorem strictMono_of_odd_strictMonoOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_lt_neg hxy)
 #align strict_mono_of_odd_strict_mono_on_nonneg strictMono_of_odd_strictMonoOn_nonneg
 
-/- warning: strict_anti_of_odd_strict_anti_on_nonneg -> strictAnti_of_odd_strictAntiOn_nonneg is a dubious translation:
-lean 3 declaration is
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (SubNegMonoid.toHasNeg.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))) x)) (Neg.neg.{u2} H (SubNegMonoid.toHasNeg.{u2} H (AddGroup.toSubNegMonoid.{u2} H (AddCommGroup.toAddGroup.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))) (f x))) -> (StrictAntiOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (OfNat.mk.{u1} G 0 (Zero.zero.{u1} G (AddZeroClass.toHasZero.{u1} G (AddMonoid.toAddZeroClass.{u1} G (SubNegMonoid.toAddMonoid.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1)))))))))))) -> (StrictAnti.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-but is expected to have type
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (NegZeroClass.toNeg.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))) x)) (Neg.neg.{u2} H (NegZeroClass.toNeg.{u2} H (SubNegZeroMonoid.toNegZeroClass.{u2} H (SubtractionMonoid.toSubNegZeroMonoid.{u2} H (SubtractionCommMonoid.toSubtractionMonoid.{u2} H (AddCommGroup.toDivisionAddCommMonoid.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))))) (f x))) -> (StrictAntiOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (Zero.toOfNat0.{u1} G (NegZeroClass.toZero.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))))))) -> (StrictAnti.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-Case conversion may be inaccurate. Consider using '#align strict_anti_of_odd_strict_anti_on_nonneg strictAnti_of_odd_strictAntiOn_nonnegₓ'. -/
 /-- An odd function on a linear ordered additive commutative group is strictly antitone on the whole
 group provided that it is strictly antitone on `set.Ici 0`. -/
 theorem strictAnti_of_odd_strictAntiOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
@@ -56,12 +44,6 @@ theorem strictAnti_of_odd_strictAntiOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x
   @strictMono_of_odd_strictMonoOn_nonneg G Hᵒᵈ _ _ _ h₁ h₂
 #align strict_anti_of_odd_strict_anti_on_nonneg strictAnti_of_odd_strictAntiOn_nonneg
 
-/- warning: monotone_of_odd_of_monotone_on_nonneg -> monotone_of_odd_of_monotoneOn_nonneg is a dubious translation:
-lean 3 declaration is
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (SubNegMonoid.toHasNeg.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))) x)) (Neg.neg.{u2} H (SubNegMonoid.toHasNeg.{u2} H (AddGroup.toSubNegMonoid.{u2} H (AddCommGroup.toAddGroup.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))) (f x))) -> (MonotoneOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (OfNat.mk.{u1} G 0 (Zero.zero.{u1} G (AddZeroClass.toHasZero.{u1} G (AddMonoid.toAddZeroClass.{u1} G (SubNegMonoid.toAddMonoid.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1)))))))))))) -> (Monotone.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-but is expected to have type
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (NegZeroClass.toNeg.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))) x)) (Neg.neg.{u2} H (NegZeroClass.toNeg.{u2} H (SubNegZeroMonoid.toNegZeroClass.{u2} H (SubtractionMonoid.toSubNegZeroMonoid.{u2} H (SubtractionCommMonoid.toSubtractionMonoid.{u2} H (AddCommGroup.toDivisionAddCommMonoid.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))))) (f x))) -> (MonotoneOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (Zero.toOfNat0.{u1} G (NegZeroClass.toZero.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))))))) -> (Monotone.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-Case conversion may be inaccurate. Consider using '#align monotone_of_odd_of_monotone_on_nonneg monotone_of_odd_of_monotoneOn_nonnegₓ'. -/
 /-- An odd function on a linear ordered additive commutative group is monotone on the whole group
 provided that it is monotone on `set.Ici 0`. -/
 theorem monotone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
@@ -72,12 +54,6 @@ theorem monotone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x)
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_le_neg hxy)
 #align monotone_of_odd_of_monotone_on_nonneg monotone_of_odd_of_monotoneOn_nonneg
 
-/- warning: antitone_of_odd_of_monotone_on_nonneg -> antitone_of_odd_of_monotoneOn_nonneg is a dubious translation:
-lean 3 declaration is
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (SubNegMonoid.toHasNeg.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))) x)) (Neg.neg.{u2} H (SubNegMonoid.toHasNeg.{u2} H (AddGroup.toSubNegMonoid.{u2} H (AddCommGroup.toAddGroup.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))) (f x))) -> (AntitoneOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (OfNat.mk.{u1} G 0 (Zero.zero.{u1} G (AddZeroClass.toHasZero.{u1} G (AddMonoid.toAddZeroClass.{u1} G (SubNegMonoid.toAddMonoid.{u1} G (AddGroup.toSubNegMonoid.{u1} G (AddCommGroup.toAddGroup.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1)))))))))))) -> (Antitone.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-but is expected to have type
-  forall {G : Type.{u1}} {H : Type.{u2}} [_inst_1 : LinearOrderedAddCommGroup.{u1} G] [_inst_2 : OrderedAddCommGroup.{u2} H] {f : G -> H}, (forall (x : G), Eq.{succ u2} H (f (Neg.neg.{u1} G (NegZeroClass.toNeg.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))) x)) (Neg.neg.{u2} H (NegZeroClass.toNeg.{u2} H (SubNegZeroMonoid.toNegZeroClass.{u2} H (SubtractionMonoid.toSubNegZeroMonoid.{u2} H (SubtractionCommMonoid.toSubtractionMonoid.{u2} H (AddCommGroup.toDivisionAddCommMonoid.{u2} H (OrderedAddCommGroup.toAddCommGroup.{u2} H _inst_2)))))) (f x))) -> (AntitoneOn.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f (Set.Ici.{u1} G (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (OfNat.ofNat.{u1} G 0 (Zero.toOfNat0.{u1} G (NegZeroClass.toZero.{u1} G (SubNegZeroMonoid.toNegZeroClass.{u1} G (SubtractionMonoid.toSubNegZeroMonoid.{u1} G (SubtractionCommMonoid.toSubtractionMonoid.{u1} G (AddCommGroup.toDivisionAddCommMonoid.{u1} G (OrderedAddCommGroup.toAddCommGroup.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))))))))))) -> (Antitone.{u1, u2} G H (PartialOrder.toPreorder.{u1} G (OrderedAddCommGroup.toPartialOrder.{u1} G (LinearOrderedAddCommGroup.toOrderedAddCommGroup.{u1} G _inst_1))) (PartialOrder.toPreorder.{u2} H (OrderedAddCommGroup.toPartialOrder.{u2} H _inst_2)) f)
-Case conversion may be inaccurate. Consider using '#align antitone_of_odd_of_monotone_on_nonneg antitone_of_odd_of_monotoneOn_nonnegₓ'. -/
 /-- An odd function on a linear ordered additive commutative group is antitone on the whole group
 provided that it is monotone on `set.Ici 0`. -/
 theorem antitone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)

c3291da4

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

9116dd67

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -19,7 +19,7 @@ prove versions of this lemma for `Antitone`, `StrictMono`, and `StrictAnti`.
 
 open Set
 
-variable {G H : Type _} [LinearOrderedAddCommGroup G] [OrderedAddCommGroup H]
+variable {G H : Type*} [LinearOrderedAddCommGroup G] [OrderedAddCommGroup H]
 
 /-- An odd function on a linear ordered additive commutative group is strictly monotone on the whole
 group provided that it is strictly monotone on `Set.Ici 0`. -/

9116dd67

chore: fix grammar mistakes (#6121)

a16538af

Diff

@@ -12,7 +12,7 @@ import Mathlib.Algebra.Order.Group.Instances
 # Monotonicity of odd functions
 
 An odd function on a linear ordered additive commutative group `G` is monotone on the whole group
-provided that is is monotone on `Set.Ici 0`, see `monotone_of_odd_of_monotoneOn_nonneg`. We also
+provided that it is monotone on `Set.Ici 0`, see `monotone_of_odd_of_monotoneOn_nonneg`. We also
 prove versions of this lemma for `Antitone`, `StrictMono`, and `StrictAnti`.
 -/

9116dd67

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module order.monotone.odd
-! leanprover-community/mathlib commit 9116dd6709f303dcf781632e15fdef382b0fc579
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Order.Monotone.Union
 import Mathlib.Algebra.Order.Group.Instances
 
+#align_import order.monotone.odd from "leanprover-community/mathlib"@"9116dd6709f303dcf781632e15fdef382b0fc579"
+
 /-!
 # Monotonicity of odd functions

9116dd67

chore: fix casing errors per naming scheme (#1670)

526ab32a

Diff

@@ -15,7 +15,7 @@ import Mathlib.Algebra.Order.Group.Instances
 # Monotonicity of odd functions
 
 An odd function on a linear ordered additive commutative group `G` is monotone on the whole group
-provided that is is monotone on `Set.Ici 0`, see `monotone_of_odd_of_monotone_on_nonneg`. We also
+provided that is is monotone on `Set.Ici 0`, see `monotone_of_odd_of_monotoneOn_nonneg`. We also
 prove versions of this lemma for `Antitone`, `StrictMono`, and `StrictAnti`.
 -/
 
@@ -26,32 +26,32 @@ variable {G H : Type _} [LinearOrderedAddCommGroup G] [OrderedAddCommGroup H]
 
 /-- An odd function on a linear ordered additive commutative group is strictly monotone on the whole
 group provided that it is strictly monotone on `Set.Ici 0`. -/
-theorem strictMono_of_odd_strictMono_on_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
+theorem strictMono_of_odd_strictMonoOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : StrictMonoOn f (Ici 0)) : StrictMono f := by
   refine' StrictMonoOn.Iic_union_Ici (fun x hx y hy hxy => neg_lt_neg_iff.1 _) h₂
   rw [← h₁, ← h₁]
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_lt_neg hxy)
-#align strict_mono_of_odd_strict_mono_on_nonneg strictMono_of_odd_strictMono_on_nonneg
+#align strict_mono_of_odd_strict_mono_on_nonneg strictMono_of_odd_strictMonoOn_nonneg
 
 /-- An odd function on a linear ordered additive commutative group is strictly antitone on the whole
 group provided that it is strictly antitone on `Set.Ici 0`. -/
-theorem strictAnti_of_odd_strictAnti_on_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
+theorem strictAnti_of_odd_strictAntiOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : StrictAntiOn f (Ici 0)) : StrictAnti f :=
-  @strictMono_of_odd_strictMono_on_nonneg G Hᵒᵈ _ _ _ h₁ h₂
-#align strict_anti_of_odd_strict_anti_on_nonneg strictAnti_of_odd_strictAnti_on_nonneg
+  @strictMono_of_odd_strictMonoOn_nonneg G Hᵒᵈ _ _ _ h₁ h₂
+#align strict_anti_of_odd_strict_anti_on_nonneg strictAnti_of_odd_strictAntiOn_nonneg
 
 /-- An odd function on a linear ordered additive commutative group is monotone on the whole group
 provided that it is monotone on `Set.Ici 0`. -/
-theorem monotone_of_odd_of_monotone_on_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
+theorem monotone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : MonotoneOn f (Ici 0)) : Monotone f := by
   refine' MonotoneOn.Iic_union_Ici (fun x hx y hy hxy => neg_le_neg_iff.1 _) h₂
   rw [← h₁, ← h₁]
   exact h₂ (neg_nonneg.2 hy) (neg_nonneg.2 hx) (neg_le_neg hxy)
-#align monotone_of_odd_of_monotone_on_nonneg monotone_of_odd_of_monotone_on_nonneg
+#align monotone_of_odd_of_monotone_on_nonneg monotone_of_odd_of_monotoneOn_nonneg
 
 /-- An odd function on a linear ordered additive commutative group is antitone on the whole group
 provided that it is monotone on `Set.Ici 0`. -/
-theorem antitone_of_odd_of_monotone_on_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
+theorem antitone_of_odd_of_monotoneOn_nonneg {f : G → H} (h₁ : ∀ x, f (-x) = -f x)
     (h₂ : AntitoneOn f (Ici 0)) : Antitone f :=
-  @monotone_of_odd_of_monotone_on_nonneg G Hᵒᵈ _ _ _ h₁ h₂
-#align antitone_of_odd_of_monotone_on_nonneg antitone_of_odd_of_monotone_on_nonneg
+  @monotone_of_odd_of_monotoneOn_nonneg G Hᵒᵈ _ _ _ h₁ h₂
+#align antitone_of_odd_of_monotone_on_nonneg antitone_of_odd_of_monotoneOn_nonneg

9116dd67

feat: port Order.Monotone.Odd (#1162)

Co-authored-by: ChrisHughes24 <chrishughes24@gmail.com>

418c4689

`order.monotone.odd` ⟷ `Mathlib.Order.Monotone.Odd`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 60

order.monotone.odd ⟷ Mathlib.Order.Monotone.Odd

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 60

`order.monotone.odd` ⟷ `Mathlib.Order.Monotone.Odd`