ProofGrow.ut: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_grow.bend as ProofGrow
Lines 343-349 of lawful-bytes@0.1.1.0/proof_grow.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_grow.bend&start_line=343&end_line=349

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

# Only the first q words matter for the first m <= 4q bytes.
law ut:
  for +ws: List<&2, U32>
  for +q: Nat
  for +m: Nat
  for +h: {Nat.is_le(m, Nat.mul(q, 4n)) == True{} : Bool}
  {List.take(&2, U32, D.unpack(ws), m) == List.take(&2, U32, D.unpack(List.take(&2, U32, ws, q)), m) : List<&2, U32>}

Uses (11):
  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_le
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.mul
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=false_ne_true
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=unpack
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/defs.bend&name=byte