ProofShift.sv_m: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_shift.bend as ProofShift
Lines 208-212 of lawful-bytes@0.1.1.0/proof_shift.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_shift.bend&start_line=208&end_line=212

import Base

law sv_m:
  for +jj: Nat
  for +kk: Nat
  for +n: Nat
  {Nat.add(Nat.add(Nat.add(jj, 1n), kk), n) == Nat.add(Nat.add(jj, kk), 1n+n) : Nat}

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=add_assoc
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=add_succ