intros hxs hys
α : Type u_1
le : α → α → Bool
not_le_le : ∀ (x y : α), ¬le x y = true → le y x = true
hx hy : List (HeapNodeAux α (Heap α))
h₁ : HeapNodeAux α (Heap α)
t₁ : List (HeapNodeAux α (Heap α))
h₂ : HeapNodeAux α (Heap α)
t₂ : List (HeapNodeAux α (Heap α))
⊢ IsMinHeap le (Heap.heap (h₁ :: t₁)) →
    IsMinHeap le (Heap.heap (h₂ :: t₂)) → IsMinHeap le (Heap.heap (mergeNodes le (h₁ :: t₁) (h₂ :: t₂)))
α : Type u_1
le : α → α → Bool
not_le_le : ∀ (x y : α), ¬le x y = true → le y x = true
hx hy : List (HeapNodeAux α (Heap α))
h₁ : HeapNodeAux α (Heap α)
t₁ : List (HeapNodeAux α (Heap α))
h₂ : HeapNodeAux α (Heap α)
t₂ : List (HeapNodeAux α (Heap α))
hxs : IsMinHeap le (Heap.heap (h₁ :: t₁))
hys : IsMinHeap le (Heap.heap (h₂ :: t₂))
⊢ IsMinHeap le (Heap.heap (mergeNodes le (h₁ :: t₁) (h₂ :: t₂)))