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

tactics.rst: fix example #91

Merged
merged 1 commit into from
Nov 13, 2019
Merged

tactics.rst: fix example #91

merged 1 commit into from
Nov 13, 2019

Conversation

dharmatech
Copy link
Contributor

@dharmatech dharmatech commented Nov 12, 2019

The example as shown in the book:

example {m n : ℕ} (h : n = 1) (h' : 0 = m) : (f m n) * m = m := by simp [h, h'.symm, f]

doesn't actually require all three items passed to simp. It only requires two:

example {m n : ℕ} (h : n = 1) (h' : 0 = m) : (f m n) * m = m := by simp [h, h'.symm]

These two work as well:

example {m n : ℕ} (h : n = 1) (h' : 0 = m) : (f m n) * m = m := by simp [f, h'.symm]

If we change the goal as follows, all three appear to be required:

example {m n : ℕ} (h : n = 1) (h' : 0 = m) : (f m n) = n := by simp [h, h'.symm, f]

@avigad avigad merged commit 8e1eac8 into leanprover:master Nov 13, 2019
@dharmatech dharmatech deleted the patch-9 branch November 13, 2019 19:36
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants