Sim.run_step: law of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/sim.bend as Sim
Lines 63-70 of bend-lawful-stdlib@0.1.0.0/src/sim.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/sim.bend&start_line=63&end_line=70

import Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C

# run's last step is its outermost one
law run_step:
  for ~P: Data
  for ~g: C.Group<P>
  for ~F: P -> P
  for k: Nat
  for s: State<P>
  {step(~P, ~g, ~F, run(~P, ~g, ~F, k, s)) == run(~P, ~g, ~F, k, step(~P, ~g, ~F, s)) : State<P>}

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Group
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sim.bend&name=State
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sim.bend&name=run
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sim.bend&name=step