-
Notifications
You must be signed in to change notification settings - Fork 681
[Merged by Bors] - feat(Topology/ClusterPt): Swapped version of ClusterPt.frequently
#27407
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
Conversation
PR summary f1fa81263dImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
If I had to point out a "common generalization", I guess it would be Filter.inf_neBot_iff_frequently_left and Filter.inf_neBot_iff_frequently_right, but I guess we need these special cases anyways. Could you also add the analogues of Filter.HasBasis.clusterPt_iff_frequently and clusterPt_iff_frequently, with similar proofs? |
Thanks! bors merge |
…27407) This PR adds the theorem ``` theorem ClusterPt.frequently' {F : Filter X} {p : X → Prop} (hx : ClusterPt x F) (hp : ∀ᶠ y in F, p y) : ∃ᶠ y in nhds x, p y := by ``` which is basically a swapped version of the existing theorem ``` theorem ClusterPt.frequently {F : Filter X} {p : X → Prop} (hx : ClusterPt x F) (hp : ∀ᶠ y in 𝓝 x, p y) : ∃ᶠ y in F, p y := ``` I'm not sure if there's a common generalization.
Pull request successfully merged into master. Build succeeded: |
ClusterPt.frequently
ClusterPt.frequently
…eanprover-community#27407) This PR adds the theorem ``` theorem ClusterPt.frequently' {F : Filter X} {p : X → Prop} (hx : ClusterPt x F) (hp : ∀ᶠ y in F, p y) : ∃ᶠ y in nhds x, p y := by ``` which is basically a swapped version of the existing theorem ``` theorem ClusterPt.frequently {F : Filter X} {p : X → Prop} (hx : ClusterPt x F) (hp : ∀ᶠ y in 𝓝 x, p y) : ∃ᶠ y in F, p y := ``` I'm not sure if there's a common generalization.
This PR adds the theorem
which is basically a swapped version of the existing theorem
I'm not sure if there's a common generalization.