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

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

law of_list_get:
  for -T: Data
  for +d: Nat
  for +xs: List<&2, T>
  for +f: T
  for +hl: {List.length(&2, T, xs) == A.Arrays.slots(d) : Nat}
  for +hd: {Nat.is_lt(d, 32n) == True{} : Bool}
  for +i: U32
  {Array.get(T, A.Arrays.of_list(T, d, xs, f), i) == (A.Arrays.of_list(T, d, xs, f), A.Arrays.nth(T, xs, A.Arrays.index(d, i), f)) : Array<T> & T}

Uses (15):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.get
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/PROOF.bend&name=AP.of_list_get.go
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.index
  https://jend.leeeet.dev/definition.txt?path=bend-osdev-array@0.1.0.1/array.bend&name=Arrays.nth
  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