data.list.sections | 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

26f081a2

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

10708587

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -29,7 +29,7 @@ theorem mem_sections {L : List (List α)} {f} : f ∈ sections L ↔ Forall₂ (
   by
   refine' ⟨fun h => _, fun h => _⟩
   · induction L generalizing f; · cases mem_singleton.1 h; exact forall₂.nil
-    simp only [sections, bind_eq_bind, mem_bind, mem_map] at h 
+    simp only [sections, bind_eq_bind, mem_bind, mem_map] at h
     rcases h with ⟨_, _, _, _, rfl⟩
     simp only [*, forall₂_cons, true_and_iff]
   · induction' h with a l f L al fL fs; · exact Or.inl rfl

10708587

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) 2018 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
-import Mathbin.Data.List.Forall2
+import Data.List.Forall2
 
 #align_import data.list.sections from "leanprover-community/mathlib"@"10708587e81b68c763fcdb7505f279d52e569768"

10708587

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) 2018 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.list.sections
-! leanprover-community/mathlib commit 10708587e81b68c763fcdb7505f279d52e569768
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.List.Forall2
 
+#align_import data.list.sections from "leanprover-community/mathlib"@"10708587e81b68c763fcdb7505f279d52e569768"
+
 /-!
 # List sections

10708587

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -47,12 +47,14 @@ theorem mem_sections_length {L : List (List α)} {f} (h : f ∈ sections L) : le
 #align list.mem_sections_length List.mem_sections_length
 -/
 
+#print List.rel_sections /-
 theorem rel_sections {r : α → β → Prop} :
     (Forall₂ (Forall₂ r) ⇒ Forall₂ (Forall₂ r)) sections sections
   | _, _, forall₂.nil => Forall₂.cons Forall₂.nil Forall₂.nil
   | _, _, forall₂.cons h₀ h₁ =>
     rel_bind (rel_sections h₁) fun _ _ hl => rel_map (fun _ _ ha => Forall₂.cons ha hl) h₀
 #align list.rel_sections List.rel_sections
+-/
 
 end List

10708587

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -32,7 +32,7 @@ theorem mem_sections {L : List (List α)} {f} : f ∈ sections L ↔ Forall₂ (
   by
   refine' ⟨fun h => _, fun h => _⟩
   · induction L generalizing f; · cases mem_singleton.1 h; exact forall₂.nil
-    simp only [sections, bind_eq_bind, mem_bind, mem_map] at h
+    simp only [sections, bind_eq_bind, mem_bind, mem_map] at h 
     rcases h with ⟨_, _, _, _, rfl⟩
     simp only [*, forall₂_cons, true_and_iff]
   · induction' h with a l f L al fL fs; · exact Or.inl rfl

10708587

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -47,12 +47,6 @@ theorem mem_sections_length {L : List (List α)} {f} (h : f ∈ sections L) : le
 #align list.mem_sections_length List.mem_sections_length
 -/
 
-/- warning: list.rel_sections -> List.rel_sections is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {β : Type.{u2}} {r : α -> β -> Prop}, Relator.LiftFun.{succ u1, succ u2, succ u1, succ u2} (List.{u1} (List.{u1} α)) (List.{u2} (List.{u2} β)) (List.{u1} (List.{u1} α)) (List.{u2} (List.{u2} β)) (List.Forall₂.{u1, u2} (List.{u1} α) (List.{u2} β) (List.Forall₂.{u1, u2} α β r)) (List.Forall₂.{u1, u2} (List.{u1} α) (List.{u2} β) (List.Forall₂.{u1, u2} α β r)) (List.sections.{u1} α) (List.sections.{u2} β)
-but is expected to have type
-  forall {α : Type.{u2}} {β : Type.{u1}} {r : α -> β -> Prop}, Relator.LiftFun.{succ u2, succ u1, succ u2, succ u1} (List.{u2} (List.{u2} α)) (List.{u1} (List.{u1} β)) (List.{u2} (List.{u2} α)) (List.{u1} (List.{u1} β)) (List.Forall₂.{u2, u1} (List.{u2} α) (List.{u1} β) (List.Forall₂.{u2, u1} α β r)) (List.Forall₂.{u2, u1} (List.{u2} α) (List.{u1} β) (List.Forall₂.{u2, u1} α β r)) (List.sections.{u2} α) (List.sections.{u1} β)
-Case conversion may be inaccurate. Consider using '#align list.rel_sections List.rel_sectionsₓ'. -/
 theorem rel_sections {r : α → β → Prop} :
     (Forall₂ (Forall₂ r) ⇒ Forall₂ (Forall₂ r)) sections sections
   | _, _, forall₂.nil => Forall₂.cons Forall₂.nil Forall₂.nil

10708587

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -31,14 +31,11 @@ variable {α β : Type _}
 theorem mem_sections {L : List (List α)} {f} : f ∈ sections L ↔ Forall₂ (· ∈ ·) f L :=
   by
   refine' ⟨fun h => _, fun h => _⟩
-  · induction L generalizing f
-    · cases mem_singleton.1 h
-      exact forall₂.nil
+  · induction L generalizing f; · cases mem_singleton.1 h; exact forall₂.nil
     simp only [sections, bind_eq_bind, mem_bind, mem_map] at h
     rcases h with ⟨_, _, _, _, rfl⟩
     simp only [*, forall₂_cons, true_and_iff]
-  · induction' h with a l f L al fL fs
-    · exact Or.inl rfl
+  · induction' h with a l f L al fL fs; · exact Or.inl rfl
     simp only [sections, bind_eq_bind, mem_bind, mem_map]
     exact ⟨_, fs, _, al, rfl, rfl⟩
 #align list.mem_sections List.mem_sections

10708587

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

26f081a2

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

@@ -18,7 +18,7 @@ open Nat Function
 
 namespace List
 
-variable {α β : Type _}
+variable {α β : Type*}
 
 theorem mem_sections {L : List (List α)} {f} : f ∈ sections L ↔ Forall₂ (· ∈ ·) f L := by
   refine' ⟨fun h => _, fun h => _⟩

26f081a2

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,13 +2,10 @@
 Copyright (c) 2018 Mario Carneiro. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
-
-! This file was ported from Lean 3 source module data.list.sections
-! leanprover-community/mathlib commit 26f081a2fb920140ed5bc5cc5344e84bcc7cb2b2
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.List.Forall2
+
+#align_import data.list.sections from "leanprover-community/mathlib"@"26f081a2fb920140ed5bc5cc5344e84bcc7cb2b2"
 /-!
 # List sections

26f081a2

chore: bump Std (#3113)

Notably incorporates https://github.com/leanprover/std4/pull/98 and https://github.com/leanprover/std4/pull/109.

https://github.com/leanprover/std4/pull/98 moves a number of lemmas from Mathlib to Std, so the bump requires deleting them in Mathlib. I did check on each lemma whether its attributes were kept in the move (and gave attribute markings in Mathlib if they were not present in Std), but a reviewer may wish to re-check.

List.mem_map changed statement from b ∈ l.map f ↔ ∃ a, a ∈ l ∧ b = f a to b ∈ l.map f ↔ ∃ a, a ∈ l ∧ f a = b. Similarly for List.exists_of_mem_map. This was a deliberate change, so I have simply adjusted proofs (many become simpler, which supports the change). I also deleted List.mem_map', List.exists_of_mem_map', which were temporary versions in Mathlib while waiting for this change (replacing their uses with the unprimed versions).

Also, the lemma sublist_nil_iff_eq_nil seems to have been renamed to sublist_nil during the move, so I added an alias for the old name.

(another issue fixed during review by @digama0) List.Sublist.filter had an argument change from explicit to implicit. This appears to have been an oversight (cc @JamesGallicchio). I have temporarily introduced List.Sublist.filter' with the argument explicit, and replaced Mathlib uses of Sublist.filter with Sublist.filter'. Later we can fix the argument in Std, and then delete List.Sublist.filter'.

a0733e9e

Diff

@@ -34,9 +34,7 @@ theorem mem_sections {L : List (List α)} {f} : f ∈ sections L ↔ Forall₂ (
   · induction' h with a l f L al fL fs
     · simp only [sections, mem_singleton]
     simp only [sections, bind_eq_bind, mem_bind, mem_map]
-    use f
-    simp only [cons.injEq, and_true, exists_eq_right']
-    exact ⟨fs, al⟩
+    exact ⟨f, fs, a, al, rfl⟩
 #align list.mem_sections List.mem_sections
 
 theorem mem_sections_length {L : List (List α)} {f} (h : f ∈ sections L) : length f = length L :=

26f081a2

feat: port Data.List.Sections (#1381)

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

9255ce93

`data.list.sections` ⟷ `Mathlib.Data.List.Sections`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 74

data.list.sections ⟷ Mathlib.Data.List.Sections

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 74

`data.list.sections` ⟷ `Mathlib.Data.List.Sections`