max/lean4-htt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 2

chore: use specialize tactic

Browse source
This commit is contained in:
Leonardo de Moura 2022-04-02 19:35:36 -07:00
parent d7abecd07d
commit ca9b494e4d
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
doc/examples/bintree.lean
View file

@ -285,8 +285,8 @@ theorem BinTree.find_insert_of_ne (b : BinTree β) (h : k ≠ k') (v : β)
contradiction
| node left key value right ihl ihr =>
let .node hl hr bl br := h
have ihl := ihl bl
have ihr := ihr br
specialize ihl bl
specialize ihr br
by_cases' k < key; by_cases' key < k
have_eq key k
by_cases' k' < k; by_cases' k < k'