ProofSame.lists_end: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_same.bend as ProofSame
Lines 410-416 of lawful-bytes@0.1.1.0/proof_same.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_same.bend&start_line=410&end_line=416

import Base
import lawful-bytes@0.1.1.0/defs.bend as D

# Comparing n more bytes from i of A and from j of B, after an empty prefix:
# acc and the comparison of the two slices.
law lists_end:
  for +acc: Bool
  for +xs: List<&2, U32>
  for +ys: List<&2, U32>
  {acc == Bool.and(acc, D.list_eq(List.take(&2, U32, xs, 0n), List.take(&2, U32, ys, 0n))) : Bool}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  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.take
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/defs.bend&name=list_eq
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_seq.bend&name=take_zero
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=and_true_r_id