def len_le

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/array.bend:153

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/lib/common.bend as SC

153def len_le(-T: Data, +p: Nat, +l: Tree<T>, +j: Nat, +pl: {perfect(T, p, l) == True{} : Bool}, +h: {Nat.is_le(SC.pow2(p), j) == True{} : Bool}) -> {Nat.is_le(SC.length(T, slots(T, l)), j) == True{} : Bool}:
154  %Equal.sym(Nat, SC.length(T, slots(T, l)), SC.pow2(p), slots_length(T, p, l, pl)) : {Nat.is_le(_, j) == True{} : Bool}
155  h