ProofList.pl_r_miss: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_list.bend as ProofList
Lines 191-198 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=191&end_line=198

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

# Before the end of the run, no c.
law pl_r_miss:
  for +zs: List<&2, U32>
  for +n: Nat
  for +c: U32
  for +k: Nat
  for +hk: {Nat.is_lt(k, D.run_len(List.take(&2, U32, zs, n), c)) == True{} : Bool}
  {D.has(zs, k, c) == False{} : Bool}

Uses (12):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Empty.absurd
  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_lt
  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=has
  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_lt0
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_list.bend&name=pl_r_miss_step