Queue.push_model: law of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/queue.bend as Queue
Lines 55-60 of bend-lawful-stdlib@0.1.0.0/src/queue.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&start_line=55&end_line=60

import Base
import bend-lawful-stdlib@0.1.0.0/src/list.bend as List

# push appends x to the model.
law push_model:
  for -A: Data
  for q: Queue<A>
  for +x: A
  {List.append(&2, A, model(A, q), [x]) == model(A, push(A, q, x)) : List<&2, A>}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  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
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/list.bend&name=append_assoc
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/list.bend&name=reverse_go
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&name=Queue
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&name=model
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&name=push