exact .leaf lt x i hl
case leaf
α : Type u
lt : α → α → Bool
inst✝ : LawfulLTBRel lt
x✝ : Subarray α
i✝ : Nat
y x : Subarray α
i : Nat
hl : 2 * i + 1 ≥ Subarray.size x
heap_left : IsHeap lt x (2 * i + 1)
heap_right : IsHeap lt x (2 * i + 2)
_hy_left : ∀ (hl_1 : 2 * i + 1 < Subarray.size x), lt x[i] x[2 * i + 1] = false :=
  fun hl_1 => not_lt_left (leaf x i hl) hl_1 heap_left
_hy_right : ∀ (hr : 2 * i + 2 < Subarray.size x), lt x[i] x[2 * i + 2] = false :=
  fun hr => not_lt_right (leaf x i hl) hr heap_right
⊢ IsHeap lt x i
no goals