We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
This lemma proves this implication:
lemma LemmaCardinalityOfSetNoDuplicates<T>(s: seq<T>) requires HasNoDuplicates(s) ensures |ToSet(s)| == |s|
But the opposite implication would also be very useful:
lemma LemmaNoDuplicatesCardinalityOfSet<T>(s: seq<T>) requires |ToSet(s)| == |s| ensures HasNoDuplicates(s)
Especially because |ToSet(s)| == |s| is much cheaper to evaluate at runtime than HasNoDuplicates(s) would be (if it was a compiled function method)
|ToSet(s)| == |s|
HasNoDuplicates(s)
function method
The text was updated successfully, but these errors were encountered:
Created pull request. Please let me know if any style fixes are needed :)
Sorry, something went wrong.
robin-aws
Successfully merging a pull request may close this issue.
This lemma proves this implication:
But the opposite implication would also be very useful:
Especially because
|ToSet(s)| == |s|
is much cheaper to evaluate at runtime thanHasNoDuplicates(s)
would be (if it was a compiledfunction method
)The text was updated successfully, but these errors were encountered: