-
Notifications
You must be signed in to change notification settings - Fork 405
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
feat: lemmas for Bitvector division when denominator is zero #5609
Open
bollu
wants to merge
2
commits into
leanprover:master
Choose a base branch
from
opencompl:udiv-denom-zero-lemmas
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+28
−0
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
These lemmas explain what happens when the denominator is zero. This is used by bv_decide for bitblasting.
bollu
changed the title
Udiv denom zero lemmas
feat: lemmas for division when denominator is zero
Oct 3, 2024
bollu
changed the title
feat: lemmas for division when denominator is zero
feat: lemmas for Bitvector division when denominator is zero
Oct 3, 2024
github-actions
bot
added
the
toolchain-available
A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN
label
Oct 3, 2024
Mathlib CI status (docs):
|
Comment on lines
+2060
to
+2061
theorem sdiv_zero_eq (x : BitVec n) : x.sdiv 0#n = 0#n := by | ||
simp only [sdiv_eq, msb_zero] |
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.
Suggested change
theorem sdiv_zero_eq (x : BitVec n) : x.sdiv 0#n = 0#n := by | |
simp only [sdiv_eq, msb_zero] | |
@[simp] | |
theorem sdiv_zero {x : BitVec n} : x.sdiv 0#n = 0#n := by | |
simp only [sdiv_eq, msb_zero] |
Comment on lines
+2063
to
+2064
|
||
theorem smod_zero_eq (x : BitVec n) : x.smod 0#n = x := by |
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.
Suggested change
theorem smod_zero_eq (x : BitVec n) : x.smod 0#n = x := by | |
@[simp] | |
theorem smod_zero {x : BitVec n} : x.smod 0#n = x := by |
I think you can also drop the |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
toolchain-available
A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN
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.
These lemmas explain what happens when the denominator is zero with
udiv
,umod
,sdiv
,smod
. A follow-up PR will show what happens withsmtUDiv
andsmtSMod
, since these need some more bitvector theory.These lemmas will be used by
bv_decide
for bitblasting.The theorems
{sdiv, smod}_zero_eq
are located afterneg
theory has been built for the purpose of writing terse proofs.