ProofIndex.half: law of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/proof_index.bend as ProofIndex
Lines 27-31 of lawful-arrays@0.1.0.0/proof_index.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&start_line=27&end_line=31

import Base

law half:
  for +n: U32
  for +p: Nat
  for +hn: {U32.to_nat(n) == Nat.pow(2n, 1n+p) : Nat}
  {U32.to_nat(U32.shr(n)) == Nat.pow(2n, p) : Nat}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.div
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.pow
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.shr
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.to_nat
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&name=n_half
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_words.bend&name=w_shr