LAWS.new_leaves: law of bend-osdev-array@0.1.0.1
Import: import bend-osdev-array@0.1.0.1/LAWS.bend as LAWS
Lines 79-83 of bend-osdev-array@0.1.0.1/LAWS.bend: https://jend.leeeet.dev/read.txt?path=bend-osdev-array@0.1.0.1/LAWS.bend&start_line=79&end_line=83

import Base
import bend-osdev-array@0.1.0.1/array.bend as A

law new_leaves:
  for -T: Data
  for d: Nat
  for v: T
  {A.Arrays.leaves(T, Array.new(T, d, v)) == List.replicate(T, A.Arrays.slots(d), v) : List<&2, T>}

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.new
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.replicate
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/PROOF.bend&name=AP.new_leaves.go
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.leaves
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.slots