diff options
| author | Raito Bezarius | 2024-04-23 14:24:04 +0200 |
|---|---|---|
| committer | Raito Bezarius | 2024-04-23 14:24:04 +0200 |
| commit | b650710ad3f8c14b713bdf52f684f472115dce2f (patch) | |
| tree | d9da70f7564ea73ceacf880b78473c89f617bba7 /Verification/Tree.lean | |
| parent | 2ff68510aabc63e250f98264e0642557015de4e2 (diff) | |
feat: close `find` / `insert` proofs
After a complete 180 with the Order theory, we close the goals of find
and insert and we give an example of U32 order that we will upstream to
Aeneas directly.
Signed-off-by: Raito Bezarius <masterancpp@gmail.com>
Diffstat (limited to '')
| -rw-r--r-- | Verification/Tree.lean (renamed from AvlVerification/Tree.lean) | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/AvlVerification/Tree.lean b/Verification/Tree.lean index 8a043a1..d6a4f80 100644 --- a/AvlVerification/Tree.lean +++ b/Verification/Tree.lean @@ -76,6 +76,7 @@ def AVLTree.mem_some {x: T} {left right: AVLTree T}: AVLTree.mem (some (AVLNode. def AVLTree.set (t: AVLTree T): Set T := _root_.setOf (AVLTree.mem t) @[simp] -def AVLTree.set_some {x: T} {left right: AVLTree T}: AVLTree.set (some (AVLNode.mk x left right)) = {x} ∪ AVLTree.set left ∪ AVLTree.set right := sorry +def AVLTree.set_some {x: T} {left right: AVLTree T}: AVLTree.set (some (AVLNode.mk x left right)) = {x} ∪ AVLTree.set left ∪ AVLTree.set right := by + simp [set, setOf] end Tree |