ProofFastAppend.al_k: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_fast_append.bend as ProofFastAppend
Lines 1050-1058 of lawful-bytes@0.1.1.0/proof_fast_append.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_fast_append.bend&start_line=1050&end_line=1058

import Base

# x = 4a + k with k + h = 4 gives x + h = 4(a + 1).
law al_k:
  for +x: Nat
  for +a: Nat
  for +k: Nat
  for +h: Nat
  for +ex: {x == Nat.add(Nat.mul(a, 4n), k) : Nat}
  for +ek: {Nat.add(k, h) == 4n : Nat}
  {Nat.add(x, h) == Nat.mul(1n+a, 4n) : Nat}

Uses (6):
  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=Base/base.bend&name=Nat.mul
  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_comm