data.bool.all_any | 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

5a3e8195

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

10708587

bump to nightly-2023-10-25-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/3365b20c2ffa7c35e47e5209b89ba9abdddf3ffe

8f0bb510

Diff

@@ -39,7 +39,7 @@ theorem all_iff_forall {p : α → Bool} : all l p ↔ ∀ a ∈ l, p a :=
   by
   induction' l with a l ih
   · exact iff_of_true rfl (forall_mem_nil _)
-  simp only [all_cons, Bool.and_coe_iff, ih, forall_mem_cons]
+  simp only [all_cons, Bool.coe_and_iff, ih, forall_mem_cons]
 #align list.all_iff_forall List.all_iff_forall
 -/
 
@@ -66,7 +66,7 @@ theorem any_iff_exists {p : α → Bool} : any l p ↔ ∃ a ∈ l, p a :=
   by
   induction' l with a l ih
   · exact iff_of_false Bool.not_false' (not_exists_mem_nil _)
-  simp only [any_cons, Bool.or_coe_iff, ih, exists_mem_cons_iff]
+  simp only [any_cons, Bool.coe_or_iff, ih, exists_mem_cons_iff]
 #align list.any_iff_exists List.any_iff_exists
 -/

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

10708587

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -64,15 +64,19 @@ theorem any_cons (p : α → Bool) (a : α) (l : List α) : any (a :: l) p = (p
   rfl
 #align list.any_cons List.any_consₓ
 
+#print List.any_iff_exists /-
 theorem any_iff_exists {p : α → Bool} : any l p ↔ ∃ a ∈ l, p a :=
   by
   induction' l with a l ih
   · exact iff_of_false Bool.not_false' (not_exists_mem_nil _)
   simp only [any_cons, Bool.or_coe_iff, ih, exists_mem_cons_iff]
 #align list.any_iff_exists List.any_iff_exists
+-/
 
+#print List.any_iff_exists_prop /-
 theorem any_iff_exists_prop : (any l fun a => p a) ↔ ∃ a ∈ l, p a := by simp [any_iff_exists]
 #align list.any_iff_exists_prop List.any_iff_exists_prop
+-/
 
 #print List.any_of_mem /-
 theorem any_of_mem {p : α → Bool} (h₁ : a ∈ l) (h₂ : p a) : any l p :=

10708587

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -64,12 +64,6 @@ theorem any_cons (p : α → Bool) (a : α) (l : List α) : any (a :: l) p = (p
   rfl
 #align list.any_cons List.any_consₓ
 
-/- warning: list.any_iff_exists -> List.any_iff_exists is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {l : List.{u1} α} {p : α -> Bool}, Iff (coeSort.{1, 1} Bool Prop coeSortBool (List.any.{u1} α l p)) (Exists.{succ u1} α (fun (a : α) => Exists.{0} (Membership.Mem.{u1, u1} α (List.{u1} α) (List.hasMem.{u1} α) a l) (fun (H : Membership.Mem.{u1, u1} α (List.{u1} α) (List.hasMem.{u1} α) a l) => coeSort.{1, 1} Bool Prop coeSortBool (p a))))
-but is expected to have type
-  forall {α : Type.{u1}} {l : List.{u1} α} {p : α -> Bool}, Iff (Eq.{1} Bool (List.any.{u1} α l p) Bool.true) (Exists.{succ u1} α (fun (a : α) => And (Membership.mem.{u1, u1} α (List.{u1} α) (List.instMembershipList.{u1} α) a l) (Eq.{1} Bool (p a) Bool.true)))
-Case conversion may be inaccurate. Consider using '#align list.any_iff_exists List.any_iff_existsₓ'. -/
 theorem any_iff_exists {p : α → Bool} : any l p ↔ ∃ a ∈ l, p a :=
   by
   induction' l with a l ih
@@ -77,12 +71,6 @@ theorem any_iff_exists {p : α → Bool} : any l p ↔ ∃ a ∈ l, p a :=
   simp only [any_cons, Bool.or_coe_iff, ih, exists_mem_cons_iff]
 #align list.any_iff_exists List.any_iff_exists
 
-/- warning: list.any_iff_exists_prop -> List.any_iff_exists_prop is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {p : α -> Prop} [_inst_1 : DecidablePred.{succ u1} α p] {l : List.{u1} α}, Iff (coeSort.{1, 1} Bool Prop coeSortBool (List.any.{u1} α l (fun (a : α) => Decidable.decide (p a) (_inst_1 a)))) (Exists.{succ u1} α (fun (a : α) => Exists.{0} (Membership.Mem.{u1, u1} α (List.{u1} α) (List.hasMem.{u1} α) a l) (fun (H : Membership.Mem.{u1, u1} α (List.{u1} α) (List.hasMem.{u1} α) a l) => p a)))
-but is expected to have type
-  forall {α : Type.{u1}} {p : α -> Prop} [_inst_1 : DecidablePred.{succ u1} α p] {l : List.{u1} α}, Iff (Eq.{1} Bool (List.any.{u1} α l (fun (a : α) => Decidable.decide (p a) (_inst_1 a))) Bool.true) (Exists.{succ u1} α (fun (a : α) => And (Membership.mem.{u1, u1} α (List.{u1} α) (List.instMembershipList.{u1} α) a l) (p a)))
-Case conversion may be inaccurate. Consider using '#align list.any_iff_exists_prop List.any_iff_exists_propₓ'. -/
 theorem any_iff_exists_prop : (any l fun a => p a) ↔ ∃ a ∈ l, p a := by simp [any_iff_exists]
 #align list.any_iff_exists_prop List.any_iff_exists_prop

10708587

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

5a3e8195

chore(Data/List): Use Std lemmas (#11711)

Make use of Nat-specific lemmas from Std rather than the general ones provided by mathlib. Also reverse the dependency between Multiset.Nodup/Multiset.dedup and Multiset.sum since only the latter needs algebra. Also rename Algebra.BigOperators.Multiset.Abs to Algebra.BigOperators.Multiset.Order and move some lemmas from Algebra.BigOperators.Multiset.Basic to it.

The ultimate goal here is to carve out Data, Algebra and Order sublibraries.

3713a3fe

Diff

@@ -4,6 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Mario Carneiro
 -/
 import Mathlib.Data.List.Basic
+import Mathlib.Init.Data.Bool.Lemmas
 
 #align_import data.bool.all_any from "leanprover-community/mathlib"@"5a3e819569b0f12cbec59d740a2613018e7b8eec"

5a3e8195

chore: fix the names of some Bool lemmas (#7841)

cf041ccc

Diff

@@ -27,7 +27,7 @@ namespace List
 theorem all_iff_forall {p : α → Bool} : all l p ↔ ∀ a ∈ l, p a := by
   induction' l with a l ih
   · exact iff_of_true rfl (forall_mem_nil _)
-  simp only [all_cons, Bool.and_coe_iff, ih, forall_mem_cons]
+  simp only [all_cons, Bool.coe_and_iff, ih, forall_mem_cons]
 #align list.all_iff_forall List.all_iff_forall
 
 theorem all_iff_forall_prop : (all l fun a => p a) ↔ ∀ a ∈ l, p a := by
@@ -42,7 +42,7 @@ theorem all_iff_forall_prop : (all l fun a => p a) ↔ ∀ a ∈ l, p a := by
 theorem any_iff_exists {p : α → Bool} : any l p ↔ ∃ a ∈ l, p a := by
   induction' l with a l ih
   · exact iff_of_false Bool.not_false' (not_exists_mem_nil _)
-  simp only [any_cons, Bool.or_coe_iff, ih, exists_mem_cons_iff]
+  simp only [any_cons, Bool.coe_or_iff, ih, exists_mem_cons_iff]
 #align list.any_iff_exists List.any_iff_exists
 
 theorem any_iff_exists_prop : (any l fun a => p a) ↔ ∃ a ∈ l, p a := by simp [any_iff_exists]

5a3e8195

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

@@ -15,7 +15,7 @@ existential quantifiers. Their definitions are in core Lean.
 -/
 
 
-variable {α : Type _} {p : α → Prop} [DecidablePred p] {l : List α} {a : α}
+variable {α : Type*} {p : α → Prop} [DecidablePred p] {l : List α} {a : α}
 
 namespace List

5a3e8195

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) 2017 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.bool.all_any
-! leanprover-community/mathlib commit 5a3e819569b0f12cbec59d740a2613018e7b8eec
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.List.Basic
 
+#align_import data.bool.all_any from "leanprover-community/mathlib"@"5a3e819569b0f12cbec59d740a2613018e7b8eec"
+
 /-!
 # Boolean quantifiers

5a3e8195

chore: tidy various files (#1412)

0ee6552e

Diff

@@ -13,7 +13,7 @@ import Mathlib.Data.List.Basic
 /-!
 # Boolean quantifiers
 
-This proves a few properties about `List.all` and `List.any`, which are the `bool` universal and
+This proves a few properties about `List.all` and `List.any`, which are the `Bool` universal and
 existential quantifiers. Their definitions are in core Lean.
 -/

5a3e8195

feat: port Data.Bool.AllAny (#1357)

Co-authored-by: Moritz Firsching <firsching@google.com> Co-authored-by: Johan Commelin <johan@commelin.net>

1fafbcad

`data.bool.all_any` ⟷ `Mathlib.Data.Bool.AllAny`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 72

data.bool.all_any ⟷ Mathlib.Data.Bool.AllAny

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 72

`data.bool.all_any` ⟷ `Mathlib.Data.Bool.AllAny`