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(analysis/convex/between): more transitivity variants #17527

Closed
wants to merge 1 commit into from

Conversation

jsm28
Copy link
Collaborator

@jsm28 jsm28 commented Nov 13, 2022

Add more variants of transitivity lemmas, giving that one endpoint is not equal to the middle point in cases where the hypotheses imply weak betweenness (and we already have the corresponding transitivity lemmas for that), and that one endpoint is not equal to the middle point, but don't imply strict betweenness.


Open in Gitpod

Add more variants of transitivity lemmas, giving that one endpoint is
not equal to the middle point in cases where the hypotheses imply weak
betweenness (and we already have the corresponding transitivity lemmas
for that), and that one endpoint is not equal to the middle point, but
don't imply strict betweenness.
@jsm28 jsm28 added easy < 20s of review time. See the lifecycle page for guidelines. awaiting-review The author would like community review of the PR labels Nov 13, 2022
@eric-wieser eric-wieser added the t-order Order hierarchy label Nov 16, 2022
Comment on lines +381 to +382
lemma wbtw.trans_left_ne [no_zero_smul_divisors R V] {w x y z : P} (h₁ : wbtw R w y z)
(h₂ : wbtw R w x y) (h : y ≠ z) : x ≠ z :=
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This to me reads like you're doing transitivity on the rightmost two elements, so it should rather be

Suggested change
lemma wbtw.trans_left_ne [no_zero_smul_divisors R V] {w x y z : P} (h₁ : wbtw R w y z)
(h₂ : wbtw R w x y) (h : y ≠ z) : x ≠ z :=
lemma wbtw.trans_right_ne [no_zero_smul_divisors R V] {w x y z : P} (h₁ : wbtw R w x y)
(h₂ : wbtw R w y z) (h : y ≠ z) : x ≠ z :=

but I see you already have been using another in the rest of the file.

Copy link
Member

@jcommelin jcommelin left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks 🎉

bors merge

(If left/right needs to be swapped, then this should be done for the entire file/directory in another PR.)

@leanprover-community-bot-assistant leanprover-community-bot-assistant added ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) and removed awaiting-review The author would like community review of the PR labels Dec 6, 2022
bors bot pushed a commit that referenced this pull request Dec 6, 2022
Add more variants of transitivity lemmas, giving that one endpoint is not equal to the middle point in cases where the hypotheses imply weak betweenness (and we already have the corresponding transitivity lemmas for that), and that one endpoint is not equal to the middle point, but don't imply strict betweenness.
@bors
Copy link

bors bot commented Dec 6, 2022

Pull request successfully merged into master.

Build succeeded:

@bors bors bot changed the title feat(analysis/convex/between): more transitivity variants [Merged by Bors] - feat(analysis/convex/between): more transitivity variants Dec 6, 2022
@bors bors bot closed this Dec 6, 2022
@bors bors bot deleted the jsm28/wbtw.trans_left_ne branch December 6, 2022 23:59
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 All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) t-order Order hierarchy
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

5 participants