LAWS.reflect: law of bend-osdev-array@0.1.0.1
Import: import bend-osdev-array@0.1.0.1/LAWS.bend as LAWS
Lines 207-214 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=207&end_line=214

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

law reflect:
  for -T: Data
  for +d: Nat
  for a: Array<T>
  for h: {A.Arrays.is_perfect(T, d, a) == True{} : Bool}
  for +f: T
  exs xs: List<&2, T>
  {A.Arrays.of_list(T, d, xs, f) == a : Array<T>} & {List.length(&2, T, xs) == A.Arrays.slots(d) : Nat}

Uses (12):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Exists
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.length
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/PROOF.bend&name=AP.reflect
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/PROOF.bend&name=AP.reflect.go
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.is_perfect
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.of_list
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.slots