proposition: Lemma hOwhO2: forall L j, heapOrdered L -> weak_heapOrdered2 L j.
proof: Proof. split. 2: apply hO_grandsOk; auto. rewrite hOhO2 in H. intros ? ? ?. apply H. Qed.
imports: Psatz List Arith.Div2 Even Relations RelationClasses PeanoNat Peano_dec Recdef Sorting Permutation Multiset