ProofShift.sv_lt: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_shift.bend as ProofShift
Lines 183-190 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=183&end_line=190

import Base

# Nat facts for one step: j + k + (1 + n) = L.
law sv_lt:
  for +jj: Nat
  for +kk: Nat
  for +n: Nat
  for +ll: Nat
  for +hm: {Nat.add(Nat.add(jj, kk), 1n+n) == ll : Nat}
  {Nat.is_lt(Nat.add(jj, kk), ll) == True{} : Bool}

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  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.is_le
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=subst
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_append.bend&name=le_split
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=le_refl