LAWS.byte_merge_lo: law of lawful-words@0.1.0.0
Import: import lawful-words@0.1.0.0/LAWS.bend as LAWS
Lines 437-444 of lawful-words@0.1.0.0/LAWS.bend: https://jend.leeeet.dev/read.txt?path=lawful-words@0.1.0.0/LAWS.bend&start_line=437&end_line=444

import Base
import lawful-words@0.1.0.0/defs.bend as D

# A word read r bytes into the pair (lo, hi): bytes r.. of lo, then bytes of hi.
law byte_merge_lo:
  for lo: U32
  for hi: U32
  for r: Nat
  for j: Nat
  for h: {Nat.is_lt(Nat.add(j, r), 4n) == True{} : Bool}
  {D.byte(D.merge(lo, hi, r), j) == D.byte(lo, Nat.add(j, r)) : U32}

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/defs.bend&name=byte
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/defs.bend&name=merge
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_bytes.bend&name=byte_merge_lo