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

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

# Below to, the answer holds c.
law first_hit:
  for +xs: List<&2, U32>
  for +from: Nat
  for +to: Nat
  for +c: U32
  for +hft: {Nat.is_le(from, to) == True{} : Bool}
  for +ht: {Nat.is_le(to, List.length(&2, U32, xs)) == True{} : Bool}
  for +hlt: {Nat.is_lt(D.first(xs, from, to, c), to) == True{} : Bool}
  {D.has(xs, D.first(xs, from, to, c), c) == True{} : 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.length
  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=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=first
  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/proof_list.bend&name=pl_ft
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_list.bend&name=pl_r_hit