data.set.constructions | 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

9003f287

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

e04043d6

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -71,7 +71,7 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/
 
-/- ./././Mathport/Syntax/Translate/Basic.lean:641:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+/- ./././Mathport/Syntax/Translate/Basic.lean:642:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 #print FiniteInter.finiteInterClosure_insert /-
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=

e04043d6

bump to nightly-2024-02-01-06

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

5433bded

Diff

@@ -59,7 +59,15 @@ variable {S}
 
 #print FiniteInter.finiteInter_mem /-
 theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
-    ↑F ⊆ S → ⋂₀ (↑F : Set (Set α)) ∈ S := by classical
+    ↑F ⊆ S → ⋂₀ (↑F : Set (Set α)) ∈ S := by
+  classical
+  refine' Finset.induction_on F (fun _ => _) _
+  · simp [cond.univ_mem]
+  · intro a s h1 h2 h3
+    suffices a ∩ ⋂₀ ↑s ∈ S by simpa
+    exact
+      cond.inter_mem (h3 (Finset.mem_insert_self a s))
+        (h2 fun x hx => h3 <| Finset.mem_insert_of_mem hx)
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/

e04043d6

bump to nightly-2024-01-31-06

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

61100fe9

Diff

@@ -59,15 +59,7 @@ variable {S}
 
 #print FiniteInter.finiteInter_mem /-
 theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
-    ↑F ⊆ S → ⋂₀ (↑F : Set (Set α)) ∈ S := by
-  classical
-  refine' Finset.induction_on F (fun _ => _) _
-  · simp [cond.univ_mem]
-  · intro a s h1 h2 h3
-    suffices a ∩ ⋂₀ ↑s ∈ S by simpa
-    exact
-      cond.inter_mem (h3 (Finset.mem_insert_self a s))
-        (h2 fun x hx => h3 <| Finset.mem_insert_of_mem hx)
+    ↑F ⊆ S → ⋂₀ (↑F : Set (Set α)) ∈ S := by classical
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/

e04043d6

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) 2020 Adam Topaz. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Adam Topaz
 -/
-import Mathbin.Data.Finset.Basic
+import Data.Finset.Basic
 
 #align_import data.set.constructions from "leanprover-community/mathlib"@"e04043d6bf7264a3c84bc69711dc354958ca4516"
 
@@ -71,7 +71,7 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/
 
-/- ./././Mathport/Syntax/Translate/Basic.lean:635:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+/- ./././Mathport/Syntax/Translate/Basic.lean:641:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 #print FiniteInter.finiteInterClosure_insert /-
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=

e04043d6

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) 2020 Adam Topaz. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Adam Topaz
-
-! This file was ported from Lean 3 source module data.set.constructions
-! leanprover-community/mathlib commit e04043d6bf7264a3c84bc69711dc354958ca4516
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Finset.Basic
 
+#align_import data.set.constructions from "leanprover-community/mathlib"@"e04043d6bf7264a3c84bc69711dc354958ca4516"
+
 /-!
 # Constructions involving sets of sets.
 
@@ -74,7 +71,7 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/
 
-/- ./././Mathport/Syntax/Translate/Basic.lean:638:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+/- ./././Mathport/Syntax/Translate/Basic.lean:635:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 #print FiniteInter.finiteInterClosure_insert /-
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=

e04043d6

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -75,6 +75,7 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 -/
 
 /- ./././Mathport/Syntax/Translate/Basic.lean:638:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+#print FiniteInter.finiteInterClosure_insert /-
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=
   by
@@ -95,6 +96,7 @@ theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
           ⟨Q ∩ R, cond.inter_mem hQ hR, by ext x;
             constructor <;> simp (config := { contextual := true })⟩
 #align has_finite_inter.finite_inter_closure_insert FiniteInter.finiteInterClosure_insert
+-/
 
 end FiniteInter

e04043d6

bump to nightly-2023-06-08-23

mathlib commit https://github.com/leanprover-community/mathlib/commit/31c24aa72e7b3e5ed97a8412470e904f82b81004

d3cfe2e3

Diff

@@ -74,7 +74,7 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/
 
-/- ./././Mathport/Syntax/Translate/Basic.lean:635:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+/- ./././Mathport/Syntax/Translate/Basic.lean:638:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=
   by

e04043d6

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -64,13 +64,13 @@ variable {S}
 theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
     ↑F ⊆ S → ⋂₀ (↑F : Set (Set α)) ∈ S := by
   classical
-    refine' Finset.induction_on F (fun _ => _) _
-    · simp [cond.univ_mem]
-    · intro a s h1 h2 h3
-      suffices a ∩ ⋂₀ ↑s ∈ S by simpa
-      exact
-        cond.inter_mem (h3 (Finset.mem_insert_self a s))
-          (h2 fun x hx => h3 <| Finset.mem_insert_of_mem hx)
+  refine' Finset.induction_on F (fun _ => _) _
+  · simp [cond.univ_mem]
+  · intro a s h1 h2 h3
+    suffices a ∩ ⋂₀ ↑s ∈ S by simpa
+    exact
+      cond.inter_mem (h3 (Finset.mem_insert_self a s))
+        (h2 fun x hx => h3 <| Finset.mem_insert_of_mem hx)
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/

e04043d6

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -74,12 +74,6 @@ theorem finiteInter_mem (cond : FiniteInter S) (F : Finset (Set α)) :
 #align has_finite_inter.finite_inter_mem FiniteInter.finiteInter_mem
 -/
 
-/- warning: has_finite_inter.finite_inter_closure_insert -> FiniteInter.finiteInterClosure_insert is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {S : Set.{u1} (Set.{u1} α)} {A : Set.{u1} α}, (FiniteInter.{u1} α S) -> (forall (P : Set.{u1} α), (Membership.Mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.hasMem.{u1} (Set.{u1} α)) P (FiniteInter.finiteInterClosure.{u1} α (Insert.insert.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.hasInsert.{u1} (Set.{u1} α)) A S))) -> (Or (Membership.Mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.hasMem.{u1} (Set.{u1} α)) P S) (Exists.{succ u1} (Set.{u1} α) (fun (Q : Set.{u1} α) => Exists.{0} (Membership.Mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.hasMem.{u1} (Set.{u1} α)) Q S) (fun (H : Membership.Mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.hasMem.{u1} (Set.{u1} α)) Q S) => Eq.{succ u1} (Set.{u1} α) P (Inter.inter.{u1} (Set.{u1} α) (Set.hasInter.{u1} α) A Q))))))
-but is expected to have type
-  forall {α : Type.{u1}} {S : Set.{u1} (Set.{u1} α)} {A : Set.{u1} α}, (FiniteInter.{u1} α S) -> (forall (P : Set.{u1} α), (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) P (FiniteInter.finiteInterClosure.{u1} α (Insert.insert.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instInsertSet.{u1} (Set.{u1} α)) A S))) -> (Or (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) P S) (Exists.{succ u1} (Set.{u1} α) (fun (Q : Set.{u1} α) => And (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) Q S) (Eq.{succ u1} (Set.{u1} α) P (Inter.inter.{u1} (Set.{u1} α) (Set.instInterSet.{u1} α) A Q))))))
-Case conversion may be inaccurate. Consider using '#align has_finite_inter.finite_inter_closure_insert FiniteInter.finiteInterClosure_insertₓ'. -/
 /- ./././Mathport/Syntax/Translate/Basic.lean:635:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=

e04043d6

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -98,8 +98,7 @@ theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     ·
       exact
         Or.inr
-          ⟨Q ∩ R, cond.inter_mem hQ hR, by
-            ext x
+          ⟨Q ∩ R, cond.inter_mem hQ hR, by ext x;
             constructor <;> simp (config := { contextual := true })⟩
 #align has_finite_inter.finite_inter_closure_insert FiniteInter.finiteInterClosure_insert

e04043d6

bump to nightly-2023-03-01-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/4c586d291f189eecb9d00581aeb3dd998ac34442

20cadee0

Diff

@@ -80,7 +80,7 @@ lean 3 declaration is
 but is expected to have type
   forall {α : Type.{u1}} {S : Set.{u1} (Set.{u1} α)} {A : Set.{u1} α}, (FiniteInter.{u1} α S) -> (forall (P : Set.{u1} α), (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) P (FiniteInter.finiteInterClosure.{u1} α (Insert.insert.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instInsertSet.{u1} (Set.{u1} α)) A S))) -> (Or (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) P S) (Exists.{succ u1} (Set.{u1} α) (fun (Q : Set.{u1} α) => And (Membership.mem.{u1, u1} (Set.{u1} α) (Set.{u1} (Set.{u1} α)) (Set.instMembershipSet.{u1} (Set.{u1} α)) Q S) (Eq.{succ u1} (Set.{u1} α) P (Inter.inter.{u1} (Set.{u1} α) (Set.instInterSet.{u1} α) A Q))))))
 Case conversion may be inaccurate. Consider using '#align has_finite_inter.finite_inter_closure_insert FiniteInter.finiteInterClosure_insertₓ'. -/
-/- ./././Mathport/Syntax/Translate/Basic.lean:628:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
+/- ./././Mathport/Syntax/Translate/Basic.lean:635:2: warning: expanding binder collection (P «expr ∈ » finite_inter_closure[has_finite_inter.finite_inter_closure] (insert[has_insert.insert] A S)) -/
 theorem finiteInterClosure_insert {A : Set α} (cond : FiniteInter S) (P)
     (_ : P ∈ finiteInterClosure (insert A S)) : P ∈ S ∨ ∃ Q ∈ S, P = A ∩ Q :=
   by

e04043d6

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

9003f287

chore(Data/Finset/Basic): Depend on less order theory (#11732)

Move Finset.biUnion and Finset.disjiUnion to a new file so that Data.Finset.Basic doesn't depend on that much order theory.

335f65c7

Diff

@@ -4,6 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Adam Topaz
 -/
 import Mathlib.Data.Finset.Basic
+import Mathlib.Data.Set.Lattice
 
 #align_import data.set.constructions from "leanprover-community/mathlib"@"9003f28797c0664a49e4179487267c494477d853"

9003f287

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

@@ -24,7 +24,7 @@ set of subsets of `α` which is closed under finite intersections.
 -/
 
 
-variable {α : Type _} (S : Set (Set α))
+variable {α : Type*} (S : Set (Set α))
 
 /-- A structure encapsulating the fact that a set of sets is closed under finite intersection. -/
 structure FiniteInter : Prop where

9003f287

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) 2020 Adam Topaz. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Adam Topaz
-
-! This file was ported from Lean 3 source module data.set.constructions
-! leanprover-community/mathlib commit 9003f28797c0664a49e4179487267c494477d853
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Finset.Basic
 
+#align_import data.set.constructions from "leanprover-community/mathlib"@"9003f28797c0664a49e4179487267c494477d853"
+
 /-!
 # Constructions involving sets of sets.

9003f287

chore: the style linter shouldn't complain about long #align lines (#1643)

54af0498

Diff

@@ -49,9 +49,7 @@ inductive finiteInterClosure : Set (Set α)
 theorem finiteInterClosure_finiteInter : FiniteInter (finiteInterClosure S) :=
   { univ_mem := finiteInterClosure.univ
     inter_mem := fun _ h _ => finiteInterClosure.inter h }
-#align
-  has_finite_inter.finite_inter_closure_has_finite_inter
-  FiniteInter.finiteInterClosure_finiteInter
+#align has_finite_inter.finite_inter_closure_has_finite_inter FiniteInter.finiteInterClosure_finiteInter
 
 variable {S}

9003f287

chore: tidy various files (#1595)

6fe10b88

Diff

@@ -22,7 +22,7 @@ We define `finiteInterClosure` which, given a set `S` of subsets of `α`, is the
 set of subsets of `α` which is closed under finite intersections.
 
 `finiteInterClosure S` is endowed with a term of type `FiniteInter` using
-`finiteInterClosure_FiniteInter`.
+`finiteInterClosure_finiteInter`.
 
 -/
 
@@ -46,12 +46,12 @@ inductive finiteInterClosure : Set (Set α)
   | inter {s t} : finiteInterClosure s → finiteInterClosure t → finiteInterClosure (s ∩ t)
 #align has_finite_inter.finite_inter_closure FiniteInter.finiteInterClosure
 
-theorem finiteInterClosure_FiniteInter : FiniteInter (finiteInterClosure S) :=
+theorem finiteInterClosure_finiteInter : FiniteInter (finiteInterClosure S) :=
   { univ_mem := finiteInterClosure.univ
     inter_mem := fun _ h _ => finiteInterClosure.inter h }
 #align
   has_finite_inter.finite_inter_closure_has_finite_inter
-  FiniteInter.finiteInterClosure_FiniteInter
+  FiniteInter.finiteInterClosure_finiteInter
 
 variable {S}

9003f287

feat: port Data.Set.Constructions (#1585)

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

09a26db3

`data.set.constructions` ⟷ `Mathlib.Data.Set.Constructions`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 151

data.set.constructions ⟷ Mathlib.Data.Set.Constructions

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 151

`data.set.constructions` ⟷ `Mathlib.Data.Set.Constructions`