law pl_r2_le
import lawful-bytes@0.1.1.0/proof_list.bend as ProofListimport Base
import lawful-bytes@0.1.1.0/defs.bend as D
338law pl_r2_le:
339 for +zs: List<&2, U32>
340 for +n: Nat
341 for +c1: U32
342 for +c2: U32
343 {Nat.is_le(D.run_len2(List.take(&2, U32, zs, n), c1, c2), n) == True{} : Bool}