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
On Thu, 2019-08-01 at 10:45 +0200, Florent Hivert wrote:
Dear all, Reading the MathComp book I was surprised reading at the bottom of page 125 the following sentence: Whenever we want to state equality between two expressions, if they live in an eqType, always use ==. It seems to suggest that lemmas such as Lemma subSS n m : m.+1 - n.+1 = m - n. should be written as Lemma subSS n m : m.+1 - n.+1 == m - n. which doesn't look very practical. Is it a mistake or am I missing something ?
Dear all,
Reading the MathComp book I was surprised reading at the bottom of page 125 the following sentence:
Whenever we want to state equality between two expressions, if they live in an eqType, always use ==.
It seems to suggest that lemmas such as
Lemma subSS n m : m.+1 - n.+1 = m - n.
should be written as
Lemma subSS n m : m.+1 - n.+1 == m - n.
which doesn't look very practical. Is it a mistake or am I missing something ?
The text was updated successfully, but these errors were encountered:
No branches or pull requests
On Thu, 2019-08-01 at 10:45 +0200, Florent Hivert wrote:
The text was updated successfully, but these errors were encountered: