leanprover / leanprover/comparator
Proof irrelevance is not respected in statements
Open
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 203
- Forks
- 36
- Avg merge
- 1h 40m
- Merged PRs (30d)
- 7
Description
With challenge
theorem foo_aux : 3 < 5 := show 2 + 1 < 5 by simp
theorem foo : ⟨3, foo_aux⟩ = (3 : Fin 5) := sorry
and solution
@[simp] theorem two_add_one : 2 + 1 = 3 := (rfl)
theorem foo_aux : 3 < 5 := show 2 + 1 < 5 by simp
theorem foo : ⟨3, foo_aux⟩ = (3 : Fin 5) := sorry
the solution is rejected because the simp proof has changed, with
Exporting #[foo, foo_aux, propext, Quot.sound, Classical.choice, Nat.add, Nat.sub, Nat.mul, Nat.pow, Nat.gcd, Nat.div, Nat.mod, Nat.beq, Nat.ble, Nat.land, Nat.lor, Nat.xor, Nat.shiftLeft, Nat.shiftRight, String.ofList] from Solution
uncaught exception: Const does not match between challenge and target 'foo_aux'
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reproducing the challenge and solution from the issue, then compare how the exported declarations are checked when the proof of foo_aux differs. Trace the handling of proof-valued statements around the reported “Const does not match” failure. Done means the solution is accepted despite the changed simp proof, while ordinary mismatches remain rejected.
Written by the indexing model from the issue text.
Assessment
- Domain
- devtools, testing-qa
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100