ProofList.pl_r_le: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_list.bend as ProofList
Lines 112-117 of lawful-bytes@0.1.1.0/proof_list.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_list.bend&start_line=112&end_line=117

import Base
import lawful-bytes@0.1.1.0/defs.bend as D

# The run is no longer than the prefix.
law pl_r_le:
  for +zs: List<&2, U32>
  for +n: Nat
  for +c: U32
  {Nat.is_le(D.run_len(List.take(&2, U32, zs, n), c), n) == True{} : Bool}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.take
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_le
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_eq
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=run_len
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_list.bend&name=pl_r_step_le