[Merged by Bors] - feat: Pairwise and composition with an equiv
#10706
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add a lemma about `Pairwise` being preserved by composing the
arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to
avoid increasing the imports of very basic files I put it in its own
new file, but feel free to suggest a better location of this lemma
(and to golf the proof).
From AperiodicMonotilesLean.
|
To consider in review: do we also want variants for unbundled bijective functions, and one-way implications for unbundled injective and surjective functions and for |
eric-wieser
reviewed
Feb 19, 2024
eric-wieser
reviewed
Feb 19, 2024
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
|
I've now added the lemmas for unbundled functions (in |
leanprover-community-mathlib4-bot
added
ready-to-merge
mathlib-bors bot
pushed a commit
that referenced
this pull request
Mar 26, 2024
Add a lemma about `Pairwise` being preserved by composing the arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).
From AperiodicMonotilesLean.
|
Pull request successfully merged into master. Build succeeded: |
mathlib-bors
bot
changed the title
Pairwise and composition with an equivPairwise and composition with an equiv
Louddy
pushed a commit
that referenced
this pull request
Apr 15, 2024
Add a lemma about `Pairwise` being preserved by composing the arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).
From AperiodicMonotilesLean.
atarnoam
pushed a commit
that referenced
this pull request
Apr 16, 2024
Add a lemma about `Pairwise` being preserved by composing the arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).
From AperiodicMonotilesLean.
uniwuni
pushed a commit
that referenced
this pull request
Apr 19, 2024
Add a lemma about `Pairwise` being preserved by composing the arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).
From AperiodicMonotilesLean.
callesonne
pushed a commit
that referenced
this pull request
Apr 22, 2024
Add a lemma about `Pairwise` being preserved by composing the arguments of the pairwise relation with an equiv.
```lean
lemma EquivLike.pairwise_comp_iff {X : Type*} {Y : Type*} {F} [EquivLike F Y X]
(f : F) (p : X → X → Prop) : Pairwise (fun y z ↦ p (f y) (f z)) ↔ Pairwise p := by
```
This depends on `Mathlib.Data.FunLike.Equiv` and
`Mathlib.Logic.Pairwise`, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).
From AperiodicMonotilesLean.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Add a lemma about
Pairwisebeing preserved by composing the arguments of the pairwise relation with an equiv.This depends on
Mathlib.Data.FunLike.EquivandMathlib.Logic.Pairwise, neither of which imports the other, so to avoid increasing the imports of very basic files I put it in its own new file, but feel free to suggest a better location of this lemma (and to golf the proof).From AperiodicMonotilesLean.