cases heq
case inr
α : Type u
lt : α → α → Bool
inst✝ : LawfulLTBRel lt
x : Subarray α
stop : Nat
h : Algdata.BinaryHeap.heapSort.Intermed lt x stop
i k : Nat
hi : (BinaryHeap.popMax lt x).stop ≤ i ∧ i < stop
hk : k < Subarray.size (BinaryHeap.popMax lt x)
k' : Nat
hk' : k' < Subarray.size x
left✝ : 0 < k'
hrng : x.start < x.stop
hi' : x.stop - 1 ≤ i
heq : x.stop - 1 = i
⊢ lt (BinaryHeap.popMax lt x).as[i] x[k'] = false
case inr.refl
α : Type u
lt : α → α → Bool
inst✝ : LawfulLTBRel lt
x : Subarray α
stop : Nat
h : Algdata.BinaryHeap.heapSort.Intermed lt x stop
k : Nat
hk : k < Subarray.size (BinaryHeap.popMax lt x)
k' : Nat
hk' : k' < Subarray.size x
left✝ : 0 < k'
hrng : x.start < x.stop
hi : (BinaryHeap.popMax lt x).stop ≤ x.stop - 1 ∧ x.stop - 1 < stop
hi' : x.stop - 1 ≤ x.stop - 1
⊢ lt (BinaryHeap.popMax lt x).as[x.stop - 1] x[k'] = false