ProofSeq.take_take: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_seq.bend as ProofSeq
Lines 40-45 of lawful-bytes@0.1.1.0/proof_seq.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_seq.bend&start_line=40&end_line=45

import Base

law take_take:
  for +xs: List<&2, U32>
  for +m: Nat
  for +n: Nat
  for +h: {Nat.is_le(n, m) == True{} : Bool}
  {List.take(&2, U32, List.take(&2, U32, xs, m), n) == List.take(&2, U32, xs, n) : List<&2, U32>}

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=Empty.absurd
  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=Nat
  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=U32
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=false_ne_true