cases imh with | nil =>
cases st with | mk mt =>
dsimp at mt
apply IsMinHeap_of_IsMinTree
repeat assumption
case mk.cons.heap
α : Type u_1
le : α → α → Bool
not_le_le : ∀ (x y : α), ¬le x y = true → le y x = true
le_trans : ∀ (x y z : α), le x y = true → le y z = true → le x z = true
le_rfl : ∀ (z : α), le z z = true
val : α
rank : ℕ
imh : IsMinHeap le (Heap.heap [])
nodes : List (HeapNodeAux α (Heap α))
st : IsSearchTree le { val := val, rank := rank, children := Heap.heap nodes }
⊢ IsMinHeap le (Heap.heap nodes)
no goals