-
Notifications
You must be signed in to change notification settings - Fork 299
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] - refactor(order/bounded_lattice): generalize le on with_{top,bot} #10085
Conversation
Before, some lemmas assumed `preorder` even when they were true for just the underlying `le`. In the case of `with_bot`, the missing underlying `has_le` instance is defined. For both `with_{top,bot}`, a few lemmas are generalized accordingly.
@@ -336,7 +336,7 @@ begin | |||
end | |||
|
|||
lemma one_le_iff_pos {n : with_top ℕ} : 1 ≤ n ↔ 0 < n := | |||
⟨λ h, (coe_lt_coe.2 zero_lt_one).trans_le h, | |||
⟨lt_of_lt_of_le (coe_lt_coe.mpr zero_lt_one), |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is this just a style change, or did something actually change here?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Huh, somehow the elaborator now gets stuck. Weird.
bors merge |
Pull request successfully merged into master. Build succeeded: |
Before, some lemmas assumed
preorder
even when they were true forjust the underlying
le
. In the case ofwith_bot
, the missingunderlying
has_le
instance is defined.For both
with_{top,bot}
, a few lemmas are generalized accordingly.