def len_lt

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

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

149def len_lt(-T: Data, +p: Nat, +l: Tree<T>, +j: Nat, +pl: {perfect(T, p, l) == True{} : Bool}, +h: {Nat.is_lt(j, SC.pow2(p)) == True{} : Bool}) -> {Nat.is_lt(j, SC.length(T, slots(T, l))) == True{} : Bool}:
150  %Equal.sym(Nat, SC.length(T, slots(T, l)), SC.pow2(p), slots_length(T, p, l, pl)) : {Nat.is_lt(j, _) == True{} : Bool}
151  h