fact: Definition weak_heapOrdered_bounded (L : list A) (k : nat) (j : nat) : Prop := (forall i a, i >= k -> i <> j -> nth_error L i = Some a -> (forall b, nth_error L (left_child i) = Some b -> a <<= b) /\ (forall c, nth_error L (right_child i) = Some c -> a <<= c)) /\ (grandsOk L j k).
imports: Psatz List Arith.Div2 Even Relations RelationClasses PeanoNat Peano_dec Recdef Sorting Permutation Multiset