Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Merged by Bors] - feat(Data/Set/Pairwise/Basic): pairwise disjoint sets and subsingletons #11629

Closed

Conversation

jsm28
Copy link
Collaborator

@jsm28 jsm28 commented Mar 24, 2024

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=

From AperiodicMonotilesLean.


Open in Gitpod

Add a lemma giving a characterization of pairwise disjoint sets in
terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
@jsm28 jsm28 added awaiting-review The author would like community review of the PR easy < 20s of review time. See the lifecycle page for guidelines. labels Mar 24, 2024
@ocfnash
Copy link
Contributor

ocfnash commented Apr 4, 2024

Thanks!

bors merge

@github-actions github-actions bot added ready-to-merge This PR has been sent to bors. and removed awaiting-review The author would like community review of the PR labels Apr 4, 2024
mathlib-bors bot pushed a commit that referenced this pull request Apr 4, 2024
…ns (#11629)

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
@mathlib-bors
Copy link

mathlib-bors bot commented Apr 4, 2024

Pull request successfully merged into master.

Build succeeded:

@mathlib-bors mathlib-bors bot changed the title feat(Data/Set/Pairwise/Basic): pairwise disjoint sets and subsingletons [Merged by Bors] - feat(Data/Set/Pairwise/Basic): pairwise disjoint sets and subsingletons Apr 4, 2024
@mathlib-bors mathlib-bors bot closed this Apr 4, 2024
@mathlib-bors mathlib-bors bot deleted the jsm28/subsingleton_setOf_mem_iff_pairwise_disjoint branch April 4, 2024 22:42
Louddy pushed a commit that referenced this pull request Apr 15, 2024
…ns (#11629)

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
atarnoam pushed a commit that referenced this pull request Apr 16, 2024
…ns (#11629)

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
uniwuni pushed a commit that referenced this pull request Apr 19, 2024
…ns (#11629)

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
callesonne pushed a commit that referenced this pull request Apr 22, 2024
…ns (#11629)

Add a lemma giving a characterization of pairwise disjoint sets in terms of each value lying in at most one set:

```lean
lemma subsingleton_setOf_mem_iff_pairwise_disjoint {f : ι → Set α} :
    (∀ a, {i | a ∈ f i}.Subsingleton) ↔ Pairwise (Disjoint on f) :=
```

From AperiodicMonotilesLean.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
easy < 20s of review time. See the lifecycle page for guidelines. ready-to-merge This PR has been sent to bors.
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants