Theorem: Std.RBMap.find?_insert_of_ne (Etch/Verification/RBMap.lean)

State before:
α : Type u_1
cmp : α → α → Ordering
β : Type u_2
k' k : α
v : β
inst✝ : TransCmp cmp
t : RBMap α β cmp
h : cmp k' k ≠ Ordering.eq
⊢ find? (insert t k v) k' = find? t k'
Tactic:
simp [find?, findEntry?_insert_of_ne _ h]
State after:
no goals