TreeMap all/any characterization theorems
Open
Nobody has claimed this yet.
P-medium
- Dominant language
- Lean
- Stars
- 9.2k
- Forks
- 990
- Avg merge
- 1d 17h
- Merged PRs (30d)
- 175
Description
These theorems are missing:
namespace Std.TreeMap
variable {α : Type u} {β : Type v} {cmp : α → α → Ordering} {t : TreeMap α β cmp}
theorem all_eq_all_toList {p : α → β → Bool} :
t.all p = t.toList.all fun a => p a.1 a.2 := sorry
theorem any_eq_any_toList {p : α → β → Bool} :
t.any p = t.toList.any fun a => p a.1 a.2 := sorry
end Std.TreeMap
Contributor guide
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 reading the Std.TreeMap definitions and the existing behavior of all, any, and toList; the issue names no source file or test. Establish the two displayed equalities and verify them with the repository's Lean checks.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 55/100