order.succ_pred.relation | 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

9aba7801

(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,7 +3,7 @@ Copyright (c) 2022 Floris van Doorn. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Floris van Doorn
 -/
-import Mathbin.Order.SuccPred.Basic
+import Order.SuccPred.Basic
 
 #align_import order.succ_pred.relation 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,14 +2,11 @@
 Copyright (c) 2022 Floris van Doorn. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Floris van Doorn
-
-! This file was ported from Lean 3 source module order.succ_pred.relation
-! 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.SuccPred.Basic
 
+#align_import order.succ_pred.relation from "leanprover-community/mathlib"@"c3291da49cfa65f0d43b094750541c0731edc932"
+
 /-!
 # Relations on types with a `succ_order`

c3291da4

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -27,6 +27,7 @@ section PartialSucc
 
 variable {α : Type _} [PartialOrder α] [SuccOrder α] [IsSuccArchimedean α]
 
+#print reflTransGen_of_succ_of_le /-
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
@@ -38,27 +39,34 @@ theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀
     cases' (le_succ m).eq_or_lt with hm hm; · rwa [← hm]
     exact this.tail (h m ⟨hnm, hm⟩)
 #align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_le
+-/
 
+#print reflTransGen_of_succ_of_ge /-
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
     (hmn : m ≤ n) : ReflTransGen r n m := by rw [← refl_trans_gen_swap];
   exact reflTransGen_of_succ_of_le (swap r) h hmn
 #align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_ge
+-/
 
+#print transGen_of_succ_of_lt /-
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
     (hnm : n < m) : TransGen r n m :=
   (reflTransGen_iff_eq_or_transGen.mp <| reflTransGen_of_succ_of_le r h hnm.le).resolve_left hnm.ne'
 #align trans_gen_of_succ_of_lt transGen_of_succ_of_lt
+-/
 
+#print transGen_of_succ_of_gt /-
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
     (hmn : m < n) : TransGen r n m :=
   (reflTransGen_iff_eq_or_transGen.mp <| reflTransGen_of_succ_of_ge r h hmn.le).resolve_left hmn.Ne
 #align trans_gen_of_succ_of_gt transGen_of_succ_of_gt
+-/
 
 end PartialSucc
 
@@ -101,33 +109,41 @@ section PartialPred
 
 variable {α : Type _} [PartialOrder α] [PredOrder α] [IsPredArchimedean α]
 
+#print reflTransGen_of_pred_of_ge /-
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
     (hnm : m ≤ n) : ReflTransGen r n m :=
   @reflTransGen_of_succ_of_le αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align refl_trans_gen_of_pred_of_ge reflTransGen_of_pred_of_ge
+-/
 
+#print reflTransGen_of_pred_of_le /-
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)
     (hmn : n ≤ m) : ReflTransGen r n m :=
   @reflTransGen_of_succ_of_ge αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hmn
 #align refl_trans_gen_of_pred_of_le reflTransGen_of_pred_of_le
+-/
 
+#print transGen_of_pred_of_gt /-
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
     (hnm : m < n) : TransGen r n m :=
   @transGen_of_succ_of_lt αᵒᵈ _ _ _ r _ _ (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align trans_gen_of_pred_of_gt transGen_of_pred_of_gt
+-/
 
+#print transGen_of_pred_of_lt /-
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)
     (hmn : n < m) : TransGen r n m :=
   @transGen_of_succ_of_gt αᵒᵈ _ _ _ r _ _ (fun x hx => h x ⟨hx.2, hx.1⟩) hmn
 #align trans_gen_of_pred_of_lt transGen_of_pred_of_lt
+-/
 
 end PartialPred

c3291da4

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -27,12 +27,6 @@ section PartialSucc
 
 variable {α : Type _} [PartialOrder α] [SuccOrder α] [IsSuccArchimedean α]
 
-/- warning: refl_trans_gen_of_succ_of_le -> reflTransGen_of_succ_of_le is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_leₓ'. -/
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
@@ -45,12 +39,6 @@ theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀
     exact this.tail (h m ⟨hnm, hm⟩)
 #align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_le
 
-/- warning: refl_trans_gen_of_succ_of_ge -> reflTransGen_of_succ_of_ge is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_geₓ'. -/
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
@@ -58,12 +46,6 @@ theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀
   exact reflTransGen_of_succ_of_le (swap r) h hmn
 #align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_ge
 
-/- warning: trans_gen_of_succ_of_lt -> transGen_of_succ_of_lt is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align trans_gen_of_succ_of_lt transGen_of_succ_of_ltₓ'. -/
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
@@ -71,12 +53,6 @@ theorem transGen_of_succ_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i 
   (reflTransGen_iff_eq_or_transGen.mp <| reflTransGen_of_succ_of_le r h hnm.le).resolve_left hnm.ne'
 #align trans_gen_of_succ_of_lt transGen_of_succ_of_lt
 
-/- warning: trans_gen_of_succ_of_gt -> transGen_of_succ_of_gt is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align trans_gen_of_succ_of_gt transGen_of_succ_of_gtₓ'. -/
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
@@ -125,12 +101,6 @@ section PartialPred
 
 variable {α : Type _} [PartialOrder α] [PredOrder α] [IsPredArchimedean α]
 
-/- warning: refl_trans_gen_of_pred_of_ge -> reflTransGen_of_pred_of_ge is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_pred_of_ge reflTransGen_of_pred_of_geₓ'. -/
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
@@ -138,12 +108,6 @@ theorem reflTransGen_of_pred_of_ge (r : α → α → Prop) {n m : α} (h : ∀
   @reflTransGen_of_succ_of_le αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align refl_trans_gen_of_pred_of_ge reflTransGen_of_pred_of_ge
 
-/- warning: refl_trans_gen_of_pred_of_le -> reflTransGen_of_pred_of_le is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_pred_of_le reflTransGen_of_pred_of_leₓ'. -/
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)
@@ -151,12 +115,6 @@ theorem reflTransGen_of_pred_of_le (r : α → α → Prop) {n m : α} (h : ∀
   @reflTransGen_of_succ_of_ge αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hmn
 #align refl_trans_gen_of_pred_of_le reflTransGen_of_pred_of_le
 
-/- warning: trans_gen_of_pred_of_gt -> transGen_of_pred_of_gt is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align trans_gen_of_pred_of_gt transGen_of_pred_of_gtₓ'. -/
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
@@ -164,12 +122,6 @@ theorem transGen_of_pred_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i 
   @transGen_of_succ_of_lt αᵒᵈ _ _ _ r _ _ (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align trans_gen_of_pred_of_gt transGen_of_pred_of_gt
 
-/- warning: trans_gen_of_pred_of_lt -> transGen_of_pred_of_lt is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
-Case conversion may be inaccurate. Consider using '#align trans_gen_of_pred_of_lt transGen_of_pred_of_ltₓ'. -/
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)

c3291da4

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -38,12 +38,10 @@ Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ
 theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
     (hnm : n ≤ m) : ReflTransGen r n m := by
   revert h; refine' Succ.rec _ _ hnm
-  · intro h
-    exact refl_trans_gen.refl
+  · intro h; exact refl_trans_gen.refl
   · intro m hnm ih h
     have : refl_trans_gen r n m := ih fun i hi => h i ⟨hi.1, hi.2.trans_le <| le_succ m⟩
-    cases' (le_succ m).eq_or_lt with hm hm
-    · rwa [← hm]
+    cases' (le_succ m).eq_or_lt with hm hm; · rwa [← hm]
     exact this.tail (h m ⟨hnm, hm⟩)
 #align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_le
 
@@ -56,9 +54,7 @@ Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
-    (hmn : m ≤ n) : ReflTransGen r n m :=
-  by
-  rw [← refl_trans_gen_swap]
+    (hmn : m ≤ n) : ReflTransGen r n m := by rw [← refl_trans_gen_swap];
   exact reflTransGen_of_succ_of_le (swap r) h hmn
 #align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_ge

c3291da4

bump to nightly-2023-05-16-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/0b9eaaa7686280fad8cce467f5c3c57ee6ce77f8

9cb92e8c

Diff

@@ -27,7 +27,12 @@ section PartialSucc
 
 variable {α : Type _} [PartialOrder α] [SuccOrder α] [IsSuccArchimedean α]
 
-#print reflTransGen_of_succ_of_le /-
+/- warning: refl_trans_gen_of_succ_of_le -> reflTransGen_of_succ_of_le is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_leₓ'. -/
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
@@ -41,9 +46,13 @@ theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀
     · rwa [← hm]
     exact this.tail (h m ⟨hnm, hm⟩)
 #align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_le
--/
 
-#print reflTransGen_of_succ_of_ge /-
+/- warning: refl_trans_gen_of_succ_of_ge -> reflTransGen_of_succ_of_ge is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_geₓ'. -/
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
@@ -52,25 +61,32 @@ theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀
   rw [← refl_trans_gen_swap]
   exact reflTransGen_of_succ_of_le (swap r) h hmn
 #align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_ge
--/
 
-#print transGen_of_succ_of_lt /-
+/- warning: trans_gen_of_succ_of_lt -> transGen_of_succ_of_lt is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r i (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align trans_gen_of_succ_of_lt transGen_of_succ_of_ltₓ'. -/
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico n m, r i (succ i))
     (hnm : n < m) : TransGen r n m :=
   (reflTransGen_iff_eq_or_transGen.mp <| reflTransGen_of_succ_of_le r h hnm.le).resolve_left hnm.ne'
 #align trans_gen_of_succ_of_lt transGen_of_succ_of_lt
--/
 
-#print transGen_of_succ_of_gt /-
+/- warning: trans_gen_of_succ_of_gt -> transGen_of_succ_of_gt is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : SuccOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsSuccArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ico.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r (Order.succ.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align trans_gen_of_succ_of_gt transGen_of_succ_of_gtₓ'. -/
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
     (hmn : m < n) : TransGen r n m :=
   (reflTransGen_iff_eq_or_transGen.mp <| reflTransGen_of_succ_of_ge r h hmn.le).resolve_left hmn.Ne
 #align trans_gen_of_succ_of_gt transGen_of_succ_of_gt
--/
 
 end PartialSucc
 
@@ -113,41 +129,57 @@ section PartialPred
 
 variable {α : Type _} [PartialOrder α] [PredOrder α] [IsPredArchimedean α]
 
-#print reflTransGen_of_pred_of_ge /-
+/- warning: refl_trans_gen_of_pred_of_ge -> reflTransGen_of_pred_of_ge is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.ReflTransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_pred_of_ge reflTransGen_of_pred_of_geₓ'. -/
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
     (hnm : m ≤ n) : ReflTransGen r n m :=
   @reflTransGen_of_succ_of_le αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align refl_trans_gen_of_pred_of_ge reflTransGen_of_pred_of_ge
--/
 
-#print reflTransGen_of_pred_of_le /-
+/- warning: refl_trans_gen_of_pred_of_le -> reflTransGen_of_pred_of_le is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toHasLe.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LE.le.{u1} α (Preorder.toLE.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.ReflTransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align refl_trans_gen_of_pred_of_le reflTransGen_of_pred_of_leₓ'. -/
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_pred_of_le (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)
     (hmn : n ≤ m) : ReflTransGen r n m :=
   @reflTransGen_of_succ_of_ge αᵒᵈ _ _ _ r n m (fun x hx => h x ⟨hx.2, hx.1⟩) hmn
 #align refl_trans_gen_of_pred_of_le reflTransGen_of_pred_of_le
--/
 
-#print transGen_of_pred_of_gt /-
+/- warning: trans_gen_of_pred_of_gt -> transGen_of_pred_of_gt is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) m n)) -> (r i (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i))) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) m n) -> (Relation.TransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align trans_gen_of_pred_of_gt transGen_of_pred_of_gtₓ'. -/
 /-- For `m < n`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_gt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc m n, r i (pred i))
     (hnm : m < n) : TransGen r n m :=
   @transGen_of_succ_of_lt αᵒᵈ _ _ _ r _ _ (fun x hx => h x ⟨hx.2, hx.1⟩) hnm
 #align trans_gen_of_pred_of_gt transGen_of_pred_of_gt
--/
 
-#print transGen_of_pred_of_lt /-
+/- warning: trans_gen_of_pred_of_lt -> transGen_of_pred_of_lt is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.Mem.{u1, u1} α (Set.{u1} α) (Set.hasMem.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toHasLt.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
+but is expected to have type
+  forall {α : Type.{u1}} [_inst_1 : PartialOrder.{u1} α] [_inst_2 : PredOrder.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)] [_inst_3 : IsPredArchimedean.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2] (r : α -> α -> Prop) {n : α} {m : α}, (forall (i : α), (Membership.mem.{u1, u1} α (Set.{u1} α) (Set.instMembershipSet.{u1} α) i (Set.Ioc.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) n m)) -> (r (Order.pred.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1) _inst_2 i) i)) -> (LT.lt.{u1} α (Preorder.toLT.{u1} α (PartialOrder.toPreorder.{u1} α _inst_1)) n m) -> (Relation.TransGen.{u1} α r n m)
+Case conversion may be inaccurate. Consider using '#align trans_gen_of_pred_of_lt transGen_of_pred_of_ltₓ'. -/
 /-- For `n < m`, `(n, m)` is in the transitive closure of a relation `~` for `n ≠ m` if `pred i ~ i`
   for all `i` between `n` and `m`. -/
 theorem transGen_of_pred_of_lt (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ioc n m, r (pred i) i)
     (hmn : n < m) : TransGen r n m :=
   @transGen_of_succ_of_gt αᵒᵈ _ _ _ r _ _ (fun x hx => h x ⟨hx.2, hx.1⟩) hmn
 #align trans_gen_of_pred_of_lt transGen_of_pred_of_lt
--/
 
 end PartialPred

c3291da4

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

9aba7801

chore: remove uses of cases' (#9171)

I literally went through and regex'd some uses of cases', replacing them with rcases; this is meant to be a low effort PR as I hope that tools can do this in the future.

rcases is an easier replacement than cases, though with better tools we could in future do a second pass converting simple rcases added here (and existing ones) to cases.

3fca282c

Diff

@@ -30,7 +30,7 @@ theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀
     exact ReflTransGen.refl
   · intro m hnm ih h
     have : ReflTransGen r n m := ih fun i hi => h i ⟨hi.1, hi.2.trans_le <| le_succ m⟩
-    cases' (le_succ m).eq_or_lt with hm hm
+    rcases (le_succ m).eq_or_lt with hm | hm
     · rwa [← hm]
     exact this.tail (h m ⟨hnm, hm⟩)
 #align refl_trans_gen_of_succ_of_le reflTransGen_of_succ_of_le

9aba7801

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 @@ open Function Order Relation Set
 
 section PartialSucc
 
-variable {α : Type _} [PartialOrder α] [SuccOrder α] [IsSuccArchimedean α]
+variable {α : Type*} [PartialOrder α] [SuccOrder α] [IsSuccArchimedean α]
 
 /-- For `n ≤ m`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ succ i`
   for all `i` between `n` and `m`. -/
@@ -63,7 +63,7 @@ end PartialSucc
 
 section LinearSucc
 
-variable {α : Type _} [LinearOrder α] [SuccOrder α] [IsSuccArchimedean α]
+variable {α : Type*} [LinearOrder α] [SuccOrder α] [IsSuccArchimedean α]
 
 /-- `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ succ i` and `succ i ~ i`
   for all `i` between `n` and `m`. -/
@@ -91,7 +91,7 @@ end LinearSucc
 
 section PartialPred
 
-variable {α : Type _} [PartialOrder α] [PredOrder α] [IsPredArchimedean α]
+variable {α : Type*} [PartialOrder α] [PredOrder α] [IsPredArchimedean α]
 
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ pred i`
   for all `i` between `n` and `m`. -/
@@ -125,7 +125,7 @@ end PartialPred
 
 section LinearPred
 
-variable {α : Type _} [LinearOrder α] [PredOrder α] [IsPredArchimedean α]
+variable {α : Type*} [LinearOrder α] [PredOrder α] [IsPredArchimedean α]
 
 /-- `(n, m)` is in the reflexive-transitive closure of `~` if `i ~ pred i` and `pred i ~ i`
   for all `i` between `n` and `m`. -/

9aba7801

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,14 +2,11 @@
 Copyright (c) 2022 Floris van Doorn. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Floris van Doorn
-
-! This file was ported from Lean 3 source module order.succ_pred.relation
-! leanprover-community/mathlib commit 9aba7801eeecebb61f58a5763c2b6dd1b47dc6ef
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Order.SuccPred.Basic
 
+#align_import order.succ_pred.relation from "leanprover-community/mathlib"@"9aba7801eeecebb61f58a5763c2b6dd1b47dc6ef"
+
 /-!
 # Relations on types with a `SuccOrder`

9aba7801

chore: format by line breaks (#1523)

During porting, I usually fix the desired format we seem to want for the line breaks around by with

awk '{do {{if (match($0, "^  by$") && length(p) < 98) {p=p " by";} else {if (NR!=1) {print p}; p=$0}}} while (getline == 1) if (getline==0) print p}' Mathlib/File/Im/Working/On.lean

I noticed there are some more files that slipped through.

This pull request is the result of running this command:

grep -lr "^  by\$" Mathlib | xargs -n 1 awk -i inplace '{do {{if (match($0, "^  by$") && length(p) < 98 && not (match(p, "^[ \t]*--"))) {p=p " by";} else {if (NR!=1) {print p}; p=$0}}} while (getline == 1) if (getline==0) print p}'

Co-authored-by: Moritz Firsching <firsching@google.com>

d6d859a7

Diff

@@ -41,8 +41,7 @@ theorem reflTransGen_of_succ_of_le (r : α → α → Prop) {n m : α} (h : ∀
 /-- For `m ≤ n`, `(n, m)` is in the reflexive-transitive closure of `~` if `succ i ~ i`
   for all `i` between `n` and `m`. -/
 theorem reflTransGen_of_succ_of_ge (r : α → α → Prop) {n m : α} (h : ∀ i ∈ Ico m n, r (succ i) i)
-    (hmn : m ≤ n) : ReflTransGen r n m :=
-  by
+    (hmn : m ≤ n) : ReflTransGen r n m := by
   rw [← reflTransGen_swap]
   exact reflTransGen_of_succ_of_le (swap r) h hmn
 #align refl_trans_gen_of_succ_of_ge reflTransGen_of_succ_of_ge
@@ -86,8 +85,7 @@ theorem transGen_of_succ_of_ne (r : α → α → Prop) {n m : α} (h1 : ∀ i 
 /-- `(n, m)` is in the transitive closure of a reflexive relation `~` if `i ~ succ i` and
   `succ i ~ i` for all `i` between `n` and `m`. -/
 theorem transGen_of_succ_of_reflexive (r : α → α → Prop) {n m : α} (hr : Reflexive r)
-    (h1 : ∀ i ∈ Ico n m, r i (succ i)) (h2 : ∀ i ∈ Ico m n, r (succ i) i) : TransGen r n m :=
-  by
+    (h1 : ∀ i ∈ Ico n m, r i (succ i)) (h2 : ∀ i ∈ Ico m n, r (succ i) i) : TransGen r n m := by
   rcases eq_or_ne m n with (rfl | hmn); · exact TransGen.single (hr m)
   exact transGen_of_succ_of_ne r h1 h2 hmn.symm
 #align trans_gen_of_succ_of_reflexive transGen_of_succ_of_reflexive

9aba7801

feat: port Order.SuccPred.Relation (#1295)

Port Order.SuccPred.Relation. This is my first port, but there were very few things that I needed to change from the file Mathport generated in order to get things to compile.

cdfaca59

`order.succ_pred.relation` ⟷ `Mathlib.Order.SuccPred.Relation`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 68

order.succ_pred.relation ⟷ Mathlib.Order.SuccPred.Relation

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 68

`order.succ_pred.relation` ⟷ `Mathlib.Order.SuccPred.Relation`