data.rbtree.find | 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

8f6fd1b6

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

8f6fd1b6

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -51,21 +51,21 @@ theorem Std.RBNode.find?_correct {t : Std.RBNode α} {lt x} [DecidableRel lt]
       apply Iff.intro
       · intro hm; cases_type* or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h ; cases hm; contradiction
+        · simp at h; cases hm; contradiction
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ hm).1
-          simp [lift] at hyx 
-          have hxy : lt x y := by simp [cmpUsing] at h ; assumption
+          simp [lift] at hyx
+          have hxy : lt x y := by simp [cmpUsing] at h; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
       · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
-    · simp at h ; simp [h, StrictWeakOrder.Equiv]
+    · simp at h; simp [h, StrictWeakOrder.Equiv]
     · cases hs
       apply Iff.intro
       · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ hm).2
-          simp [lift] at hxy 
-          have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2
+          simp [lift] at hxy
+          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h ; cases hm; contradiction
+        · simp at h; cases hm; contradiction
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct Std.RBNode.find?_correct
@@ -91,32 +91,32 @@ theorem Std.RBNode.find?_correct_exact {t : Std.RBNode α} {lt x} [DecidableRel
       apply Iff.intro
       · intro hm; cases_type* or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h ; subst x; exact absurd h (irrefl y)
+        · simp at h; subst x; exact absurd h (irrefl y)
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
-          simp [lift] at hyx 
-          have hxy : lt x y := by simp [cmpUsing] at h ; assumption
+          simp [lift] at hyx
+          have hxy : lt x y := by simp [cmpUsing] at h; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
       · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
-    · simp at h 
+    · simp at h
       cases hs
       apply Iff.intro
       · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
-          simp [lift] at hxy 
+          simp [lift] at hxy
           exact absurd hxy h.1
         · subst hm
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
-          simp [lift] at hyx 
+          simp [lift] at hyx
           exact absurd hyx h.2
       · intro hm; simp [*]
     · cases hs
       apply Iff.intro
       · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
-          simp [lift] at hxy 
-          have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2
+          simp [lift] at hxy
+          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h ; subst x; exact absurd h (irrefl y)
+        · simp at h; subst x; exact absurd h (irrefl y)
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct_exact Std.RBNode.find?_correct_exact
@@ -128,7 +128,7 @@ theorem Std.RBNode.eqv_of_find?_some {t : Std.RBNode α} {lt x y} [DecidableRel
   apply find.induction lt t x <;> intros <;> simp_all only [mem, find]
   iterate 2 
     · cases hs; exact ih hs_hs₁ rfl
-    · subst y; simp at h ; exact h
+    · subst y; simp at h; exact h
     · cases hs; exact ih hs_hs₂ rfl
 #align rbnode.eqv_of_find_some Std.RBNode.eqv_of_find?_some

8f6fd1b6

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) 2017 Microsoft Corporation. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
 -/
-import Mathbin.Data.Rbtree.Basic
+import Data.Rbtree.Basic
 
 #align_import data.rbtree.find from "leanprover-community/mathlib"@"8f6fd1b69096c6a587f745d354306c0d46396915"

8f6fd1b6

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) 2017 Microsoft Corporation. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
-
-! This file was ported from Lean 3 source module data.rbtree.find
-! leanprover-community/mathlib commit 8f6fd1b69096c6a587f745d354306c0d46396915
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Rbtree.Basic
 
+#align_import data.rbtree.find from "leanprover-community/mathlib"@"8f6fd1b69096c6a587f745d354306c0d46396915"
+
 universe u
 
 namespace Std.RBNode

8f6fd1b6

bump to nightly-2023-06-27-05

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

9377c86a

Diff

@@ -12,15 +12,16 @@ import Mathbin.Data.Rbtree.Basic
 
 universe u
 
-namespace Rbnode
+namespace Std.RBNode
 
 variable {α : Type u}
 
 @[elab_without_expected_type]
-theorem find.induction {p : Rbnode α → Prop} (lt) [DecidableRel lt] (t x) (h₁ : p leaf)
-    (h₂ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.lt) (ih : p l), p (red_node l y r))
-    (h₃ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.eq), p (red_node l y r))
-    (h₄ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.gt) (ih : p r), p (red_node l y r))
+theorem Std.RBNode.find?.induction {p : Std.RBNode α → Prop} (lt) [DecidableRel lt] (t x)
+    (h₁ : p Std.RBNode.nil)
+    (h₂ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.lt) (ih : p l), p (Std.RBNode.node l y r))
+    (h₃ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.eq), p (Std.RBNode.node l y r))
+    (h₄ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.gt) (ih : p r), p (Std.RBNode.node l y r))
     (h₅ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.lt) (ih : p l), p (black_node l y r))
     (h₆ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.eq), p (black_node l y r))
     (h₇ : ∀ (l y r) (h : cmpUsing lt x y = Ordering.gt) (ih : p r), p (black_node l y r)) : p t :=
@@ -37,10 +38,12 @@ theorem find.induction {p : Rbnode α → Prop} (lt) [DecidableRel lt] (t x) (h
     case lt => apply h₅; assumption; assumption
     case eq => apply h₆; assumption
     case gt => apply h₇; assumption; assumption
-#align rbnode.find.induction Rbnode.find.induction
+#align rbnode.find.induction Std.RBNode.find?.induction
 
-theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder α lt] :
-    ∀ {lo hi} (hs : IsSearchable lt t lo hi), Mem lt x t ↔ ∃ y, find lt t x = some y ∧ x ≈[lt]y :=
+theorem Std.RBNode.find?_correct {t : Std.RBNode α} {lt x} [DecidableRel lt]
+    [IsStrictWeakOrder α lt] :
+    ∀ {lo hi} (hs : Std.RBNode.IsSearchable lt t lo hi),
+      Std.RBNode.Mem lt x t ↔ ∃ y, Std.RBNode.find? lt t x = some y ∧ x ≈[lt]y :=
   by
   apply find.induction lt t x <;> intros <;> simp only [mem, find, *]
   · simp
@@ -68,18 +71,21 @@ theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder
         · simp at h ; cases hm; contradiction
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
-#align rbnode.find_correct Rbnode.find_correct
+#align rbnode.find_correct Std.RBNode.find?_correct
 
-theorem mem_of_memExact {lt} [IsIrrefl α lt] {x t} : MemExact x t → Mem lt x t :=
+theorem Std.RBNode.mem_of_memExact {lt} [IsIrrefl α lt] {x t} :
+    Std.RBNode.MemExact x t → Std.RBNode.Mem lt x t :=
   by
   induction t <;> simp [mem_exact, mem, false_imp_iff] <;> intro h
   all_goals
     cases_type* or.1; simp [t_ih_lchild h]; simp [h, irrefl_of lt t_val]
     simp [t_ih_rchild h]
-#align rbnode.mem_of_mem_exact Rbnode.mem_of_memExact
+#align rbnode.mem_of_mem_exact Std.RBNode.mem_of_memExact
 
-theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder α lt] :
-    ∀ {lo hi} (hs : IsSearchable lt t lo hi), MemExact x t ↔ find lt t x = some x :=
+theorem Std.RBNode.find?_correct_exact {t : Std.RBNode α} {lt x} [DecidableRel lt]
+    [IsStrictWeakOrder α lt] :
+    ∀ {lo hi} (hs : Std.RBNode.IsSearchable lt t lo hi),
+      Std.RBNode.MemExact x t ↔ Std.RBNode.find? lt t x = some x :=
   by
   apply find.induction lt t x <;> intros <;> simp only [mem_exact, find, *]
   iterate 2
@@ -116,20 +122,23 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
         · simp at h ; subst x; exact absurd h (irrefl y)
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
-#align rbnode.find_correct_exact Rbnode.find_correct_exact
+#align rbnode.find_correct_exact Std.RBNode.find?_correct_exact
 
-theorem eqv_of_find_some {t : Rbnode α} {lt x y} [DecidableRel lt] :
-    ∀ {lo hi} (hs : IsSearchable lt t lo hi) (he : find lt t x = some y), x ≈[lt]y :=
+theorem Std.RBNode.eqv_of_find?_some {t : Std.RBNode α} {lt x y} [DecidableRel lt] :
+    ∀ {lo hi} (hs : Std.RBNode.IsSearchable lt t lo hi) (he : Std.RBNode.find? lt t x = some y),
+      x ≈[lt]y :=
   by
   apply find.induction lt t x <;> intros <;> simp_all only [mem, find]
   iterate 2 
     · cases hs; exact ih hs_hs₁ rfl
     · subst y; simp at h ; exact h
     · cases hs; exact ih hs_hs₂ rfl
-#align rbnode.eqv_of_find_some Rbnode.eqv_of_find_some
+#align rbnode.eqv_of_find_some Std.RBNode.eqv_of_find?_some
 
-theorem find_eq_find_of_eqv {lt a b} [DecidableRel lt] [IsStrictWeakOrder α lt] {t : Rbnode α} :
-    ∀ {lo hi} (hs : IsSearchable lt t lo hi) (heqv : a ≈[lt]b), find lt t a = find lt t b :=
+theorem Std.RBNode.find?_eq_find?_of_eqv {lt a b} [DecidableRel lt] [IsStrictWeakOrder α lt]
+    {t : Std.RBNode α} :
+    ∀ {lo hi} (hs : Std.RBNode.IsSearchable lt t lo hi) (heqv : a ≈[lt]b),
+      Std.RBNode.find? lt t a = Std.RBNode.find? lt t b :=
   by
   apply find.induction lt t a <;> intros <;>
     simp_all [mem, find, StrictWeakOrder.Equiv, true_imp_iff]
@@ -141,7 +150,7 @@ theorem find_eq_find_of_eqv {lt a b} [DecidableRel lt] [IsStrictWeakOrder α lt]
     · have := lt_of_lt_of_incomp h heqv
       have := not_lt_of_lt this
       simp [cmpUsing, find, *]; cases hs; apply ih hs_hs₂
-#align rbnode.find_eq_find_of_eqv Rbnode.find_eq_find_of_eqv
+#align rbnode.find_eq_find_of_eqv Std.RBNode.find?_eq_find?_of_eqv
 
-end Rbnode
+end Std.RBNode

8f6fd1b6

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -49,7 +49,7 @@ theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder
     -- red and black cases are identical
     · cases hs
       apply Iff.intro
-      · intro hm; cases_type*or.1
+      · intro hm; cases_type* or.1
         · exact Iff.mp (ih hs_hs₁) hm
         · simp at h ; cases hm; contradiction
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ hm).1
@@ -60,7 +60,7 @@ theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder
     · simp at h ; simp [h, StrictWeakOrder.Equiv]
     · cases hs
       apply Iff.intro
-      · intro hm; cases_type*or.1
+      · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ hm).2
           simp [lift] at hxy 
           have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2
@@ -74,7 +74,7 @@ theorem mem_of_memExact {lt} [IsIrrefl α lt] {x t} : MemExact x t → Mem lt x
   by
   induction t <;> simp [mem_exact, mem, false_imp_iff] <;> intro h
   all_goals
-    cases_type*or.1; simp [t_ih_lchild h]; simp [h, irrefl_of lt t_val]
+    cases_type* or.1; simp [t_ih_lchild h]; simp [h, irrefl_of lt t_val]
     simp [t_ih_rchild h]
 #align rbnode.mem_of_mem_exact Rbnode.mem_of_memExact
 
@@ -86,7 +86,7 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
     
     · cases hs
       apply Iff.intro
-      · intro hm; cases_type*or.1
+      · intro hm; cases_type* or.1
         · exact Iff.mp (ih hs_hs₁) hm
         · simp at h ; subst x; exact absurd h (irrefl y)
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
@@ -97,7 +97,7 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
     · simp at h 
       cases hs
       apply Iff.intro
-      · intro hm; cases_type*or.1
+      · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
           simp [lift] at hxy 
           exact absurd hxy h.1
@@ -108,7 +108,7 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
       · intro hm; simp [*]
     · cases hs
       apply Iff.intro
-      · intro hm; cases_type*or.1
+      · intro hm; cases_type* or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
           simp [lift] at hxy 
           have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2

8f6fd1b6

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -51,21 +51,21 @@ theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder
       apply Iff.intro
       · intro hm; cases_type*or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h; cases hm; contradiction
+        · simp at h ; cases hm; contradiction
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ hm).1
-          simp [lift] at hyx
-          have hxy : lt x y := by simp [cmpUsing] at h; assumption
+          simp [lift] at hyx 
+          have hxy : lt x y := by simp [cmpUsing] at h ; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
       · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
-    · simp at h; simp [h, StrictWeakOrder.Equiv]
+    · simp at h ; simp [h, StrictWeakOrder.Equiv]
     · cases hs
       apply Iff.intro
       · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ hm).2
-          simp [lift] at hxy
-          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
+          simp [lift] at hxy 
+          have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h; cases hm; contradiction
+        · simp at h ; cases hm; contradiction
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct Rbnode.find_correct
@@ -88,32 +88,32 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
       apply Iff.intro
       · intro hm; cases_type*or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h; subst x; exact absurd h (irrefl y)
+        · simp at h ; subst x; exact absurd h (irrefl y)
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
-          simp [lift] at hyx
-          have hxy : lt x y := by simp [cmpUsing] at h; assumption
+          simp [lift] at hyx 
+          have hxy : lt x y := by simp [cmpUsing] at h ; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
       · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
-    · simp at h
+    · simp at h 
       cases hs
       apply Iff.intro
       · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
-          simp [lift] at hxy
+          simp [lift] at hxy 
           exact absurd hxy h.1
         · subst hm
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
-          simp [lift] at hyx
+          simp [lift] at hyx 
           exact absurd hyx h.2
       · intro hm; simp [*]
     · cases hs
       apply Iff.intro
       · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
-          simp [lift] at hxy
-          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
+          simp [lift] at hxy 
+          have hyx : lt y x := by simp [cmpUsing] at h ; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h; subst x; exact absurd h (irrefl y)
+        · simp at h ; subst x; exact absurd h (irrefl y)
         · exact Iff.mp (ih hs_hs₂) hm
       · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct_exact Rbnode.find_correct_exact
@@ -124,7 +124,7 @@ theorem eqv_of_find_some {t : Rbnode α} {lt x y} [DecidableRel lt] :
   apply find.induction lt t x <;> intros <;> simp_all only [mem, find]
   iterate 2 
     · cases hs; exact ih hs_hs₁ rfl
-    · subst y; simp at h; exact h
+    · subst y; simp at h ; exact h
     · cases hs; exact ih hs_hs₂ rfl
 #align rbnode.eqv_of_find_some Rbnode.eqv_of_find_some

8f6fd1b6

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -49,41 +49,25 @@ theorem find_correct {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWeakOrder
     -- red and black cases are identical
     · cases hs
       apply Iff.intro
-      · intro hm
-        cases_type*or.1
+      · intro hm; cases_type*or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h
-          cases hm
-          contradiction
+        · simp at h; cases hm; contradiction
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ hm).1
           simp [lift] at hyx
-          have hxy : lt x y := by
-            simp [cmpUsing] at h
-            assumption
+          have hxy : lt x y := by simp [cmpUsing] at h; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-      · intro hc
-        left
-        exact Iff.mpr (ih hs_hs₁) hc
-    · simp at h
-      simp [h, StrictWeakOrder.Equiv]
+      · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
+    · simp at h; simp [h, StrictWeakOrder.Equiv]
     · cases hs
       apply Iff.intro
-      · intro hm
-        cases_type*or.1
+      · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ hm).2
           simp [lift] at hxy
-          have hyx : lt y x := by
-            simp [cmpUsing] at h
-            exact h.2
+          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h
-          cases hm
-          contradiction
+        · simp at h; cases hm; contradiction
         · exact Iff.mp (ih hs_hs₂) hm
-      · intro hc
-        right
-        right
-        exact Iff.mpr (ih hs_hs₂) hc
+      · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct Rbnode.find_correct
 
 theorem mem_of_memExact {lt} [IsIrrefl α lt] {x t} : MemExact x t → Mem lt x t :=
@@ -102,26 +86,18 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
     
     · cases hs
       apply Iff.intro
-      · intro hm
-        cases_type*or.1
+      · intro hm; cases_type*or.1
         · exact Iff.mp (ih hs_hs₁) hm
-        · simp at h
-          subst x
-          exact absurd h (irrefl y)
+        · simp at h; subst x; exact absurd h (irrefl y)
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
           simp [lift] at hyx
-          have hxy : lt x y := by
-            simp [cmpUsing] at h
-            assumption
+          have hxy : lt x y := by simp [cmpUsing] at h; assumption
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-      · intro hc
-        left
-        exact Iff.mpr (ih hs_hs₁) hc
+      · intro hc; left; exact Iff.mpr (ih hs_hs₁) hc
     · simp at h
       cases hs
       apply Iff.intro
-      · intro hm
-        cases_type*or.1
+      · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
           simp [lift] at hxy
           exact absurd hxy h.1
@@ -129,41 +105,27 @@ theorem find_correct_exact {t : Rbnode α} {lt x} [DecidableRel lt] [IsStrictWea
         · have hyx : lift lt (some y) (some x) := (range hs_hs₂ (mem_of_mem_exact hm)).1
           simp [lift] at hyx
           exact absurd hyx h.2
-      · intro hm
-        simp [*]
+      · intro hm; simp [*]
     · cases hs
       apply Iff.intro
-      · intro hm
-        cases_type*or.1
+      · intro hm; cases_type*or.1
         · have hxy : lift lt (some x) (some y) := (range hs_hs₁ (mem_of_mem_exact hm)).2
           simp [lift] at hxy
-          have hyx : lt y x := by
-            simp [cmpUsing] at h
-            exact h.2
+          have hyx : lt y x := by simp [cmpUsing] at h; exact h.2
           exact absurd (trans_of lt hxy hyx) (irrefl_of lt x)
-        · simp at h
-          subst x
-          exact absurd h (irrefl y)
+        · simp at h; subst x; exact absurd h (irrefl y)
         · exact Iff.mp (ih hs_hs₂) hm
-      · intro hc
-        right
-        right
-        exact Iff.mpr (ih hs_hs₂) hc
+      · intro hc; right; right; exact Iff.mpr (ih hs_hs₂) hc
 #align rbnode.find_correct_exact Rbnode.find_correct_exact
 
 theorem eqv_of_find_some {t : Rbnode α} {lt x y} [DecidableRel lt] :
     ∀ {lo hi} (hs : IsSearchable lt t lo hi) (he : find lt t x = some y), x ≈[lt]y :=
   by
   apply find.induction lt t x <;> intros <;> simp_all only [mem, find]
-  iterate 2
-    
-    · cases hs
-      exact ih hs_hs₁ rfl
-    · subst y
-      simp at h
-      exact h
-    · cases hs
-      exact ih hs_hs₂ rfl
+  iterate 2 
+    · cases hs; exact ih hs_hs₁ rfl
+    · subst y; simp at h; exact h
+    · cases hs; exact ih hs_hs₂ rfl
 #align rbnode.eqv_of_find_some Rbnode.eqv_of_find_some
 
 theorem find_eq_find_of_eqv {lt a b} [DecidableRel lt] [IsStrictWeakOrder α lt] {t : Rbnode α} :
@@ -174,16 +136,11 @@ theorem find_eq_find_of_eqv {lt a b} [DecidableRel lt] [IsStrictWeakOrder α lt]
   iterate 2
     
     · have : lt b y := lt_of_incomp_of_lt heqv.swap h
-      simp [cmpUsing, find, *]
-      cases hs
-      apply ih hs_hs₁
-    · have := incomp_trans_of lt heqv.swap h
-      simp [cmpUsing, find, *]
+      simp [cmpUsing, find, *]; cases hs; apply ih hs_hs₁
+    · have := incomp_trans_of lt heqv.swap h; simp [cmpUsing, find, *]
     · have := lt_of_lt_of_incomp h heqv
       have := not_lt_of_lt this
-      simp [cmpUsing, find, *]
-      cases hs
-      apply ih hs_hs₂
+      simp [cmpUsing, find, *]; cases hs; apply ih hs_hs₂
 #align rbnode.find_eq_find_of_eqv Rbnode.find_eq_find_of_eqv
 
 end Rbnode

8f6fd1b6

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

8f6fd1b6

chore: move #align_import out of comment (#6165)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

1919f537

Diff

@@ -3,12 +3,13 @@ Copyright (c) 2017 Microsoft Corporation. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
 -/
+import Mathlib.Mathport.Rename
+
+#align_import data.rbtree.find from "leanprover-community/mathlib"@"8f6fd1b69096c6a587f745d354306c0d46396915"
 
 /-!
 # Porting note: essentially already ported to std4
 
-#align_import data.rbtree.find from "leanprover-community/mathlib"@"8f6fd1b69096c6a587f745d354306c0d46396915"
-
 https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Mathlib4.20porting.20meeting.20series/near/369848971
 
 -/

8f6fd1b6

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,16 +2,13 @@
 Copyright (c) 2017 Microsoft Corporation. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Leonardo de Moura
-
-! This file was ported from Lean 3 source module data.rbtree.find
-! leanprover-community/mathlib commit 8f6fd1b69096c6a587f745d354306c0d46396915
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 
 /-!
 # Porting note: essentially already ported to std4
 
+#align_import data.rbtree.find from "leanprover-community/mathlib"@"8f6fd1b69096c6a587f745d354306c0d46396915"
+
 https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Mathlib4.20porting.20meeting.20series/near/369848971
 
 -/

8f6fd1b6

feat: "port" Rbmap and Rbtree files (#5504)

Cf. here. Incorporates #5479.

Co-authored-by: Johan Commelin <johan@commelin.net>

0171e873

`data.rbtree.find` ⟷ `Mathlib.Data.Rbtree.Find`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 6

data.rbtree.find ⟷ Mathlib.Data.Rbtree.Find

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 6

`data.rbtree.find` ⟷ `Mathlib.Data.Rbtree.Find`