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.

Sign up for GitHub

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

Jump to bottom

apply tactic produces incorrect proof #644

Open

gebner opened this issue Nov 1, 2021 · 1 comment

Member

gebner commented Nov 1, 2021 •

edited

Loading

def additive (α : Type*) := α

instance {α} [has_one α] : has_zero (additive α) := ⟨(1 : α)⟩

example : (0 : ℕ) = (0 : additive ℕ) :=
by apply eq.refl

gebner mentioned this issue

convert generates proof that is not accepted by the kernel leanprover-community/mathlib3#9805

Closed

gebner changed the title ~~reflexivity tactic produces incorrect proof~~ apply tactic produces incorrect proof

Member Author

gebner commented Nov 1, 2021

This is getting more and more interesting:

#eval tactic.is_def_eq `(0 : ℕ) `(0 : additive ℕ) -- succeeds!?!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment