[Merged by Bors] - feat: βαΆ x in π a, x < a
#7941
Closed
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
urkud
added
awaiting-review
|
βοΈ urkud can now approve this pull request. To approve and merge a pull request, simply reply with |
leanprover-community-mathlib4-bot
added
delegated
and removed
awaiting-review
urkud
commented
Oct 29, 2023
urkud
commented
Oct 29, 2023
|
bors merge |
bors bot
pushed a commit
that referenced
this pull request
Oct 30, 2023
* Add `frequently_lt_nhds` and `frequently_gt_nhds`. * Move some lemmas from `Topology/Order/Basic` to `Topology/Algebra/Order/LeftRight`. * Relax TC assumptions in `Filter.Eventually.exists_lt` (and `*_gt`). New versions assume `NeBot (π[<] a)` and `NeBot (π[>] a)`, so the latter one can be applied, e.g., to `((a : ββ₯0) : ββ₯0β)`. From the Mandelbrot set connectedness project. Co-Authored-By: @girving
|
Pull request successfully merged into master. Build succeeded! The publicly hosted instance of bors-ng is deprecated and will go away soon. If you want to self-host your own instance, instructions are here. If you want to switch to GitHub's built-in merge queue, visit their help page. |
bors
bot
changed the title
βαΆ x in π a, x < aβαΆ x in π a, x < a
grunweg
pushed a commit
that referenced
this pull request
Nov 1, 2023
* Add `frequently_lt_nhds` and `frequently_gt_nhds`. * Move some lemmas from `Topology/Order/Basic` to `Topology/Algebra/Order/LeftRight`. * Relax TC assumptions in `Filter.Eventually.exists_lt` (and `*_gt`). New versions assume `NeBot (π[<] a)` and `NeBot (π[>] a)`, so the latter one can be applied, e.g., to `((a : ββ₯0) : ββ₯0β)`. From the Mandelbrot set connectedness project. Co-Authored-By: @girving
fgdorais
pushed a commit
that referenced
this pull request
Nov 1, 2023
* Add `frequently_lt_nhds` and `frequently_gt_nhds`. * Move some lemmas from `Topology/Order/Basic` to `Topology/Algebra/Order/LeftRight`. * Relax TC assumptions in `Filter.Eventually.exists_lt` (and `*_gt`). New versions assume `NeBot (π[<] a)` and `NeBot (π[>] a)`, so the latter one can be applied, e.g., to `((a : ββ₯0) : ββ₯0β)`. From the Mandelbrot set connectedness project. Co-Authored-By: @girving
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.
frequently_lt_nhdsandfrequently_gt_nhds.Topology/Order/BasictoTopology/Algebra/Order/LeftRight.Filter.Eventually.exists_lt(and*_gt).New versions assume
NeBot (π[<] a)andNeBot (π[>] a),so the latter one can be applied, e.g., to
((a : ββ₯0) : ββ₯0β).From the Mandelbrot set connectedness project.
Co-Authored-By: @girving