Deque.Deque.lemma.reverse_go: law of bend-kit-collections@0.1.4.1
Import: import bend-kit-collections@0.1.4.1/deque.bend as Deque
Lines 252-258 of bend-kit-collections@0.1.4.1/deque.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-collections@0.1.4.1/deque.bend&start_line=252&end_line=258

import Base

# reversing onto an accumulator is reversing, then appending it
law Deque.lemma.reverse_go:
  for -A: Data
  for  xs: List<&2, A>
  for -acc: List<&2, A>
  {List.append(&2, A, List.reverse.go(&2, A, xs, Nil{}), acc)
   == List.reverse.go(&2, A, xs, acc) : List<&2, A>}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.append
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.reverse.go
  https://jend.leeeet.dev/definition.txt?path=bend-kit-collections@0.1.4.1/deque.bend&name=Deque.lemma.append_assoc