ProofTree.get_go_eta: law of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTree
Lines 268-274 of lawful-arrays@0.1.0.0/proof_tree.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&start_line=268&end_line=274

import Base

law get_go_eta:
  for -T: Data
  for a: Array<T>
  for +n: U32
  for +i: U32
  for +z: Bool
  {Array.get.go(T, a, n, i, z) == (a, Pair.snd(Array<T>, T, Array.get.go(T, a, n, i, z))) : Array<T> & T}

Uses (13):
  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.go
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.swap.hi
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.swap.lo
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair.snd
  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=Base/base.bend&name=U32.is_lt
  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.sub