ProofFind.slice_cons: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_find.bend as ProofFind
Lines 68-74 of lawful-bytes@0.1.1.0/proof_find.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_find.bend&start_line=68&end_line=74

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

law slice_cons:
  for +xs: List<&2, U32>
  for +j: Nat
  for +k: Nat
  for +x: U32
  for +hx: {List.get(&2, U32, xs, j) == Some{x} : Maybe<&2, U32>}
  {D.slice(xs, j, 1n+k) == x <> D.slice(xs, Nat.add(j, 1n), k) : List<&2, U32>}

Uses (11):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.drop
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.get
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.take
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  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=slice
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_find.bend&name=drop_cons