law slice_take
import lawful-bytes@0.1.1.0/proof_fast_find.bend as ProofFastFindimport Base
import lawful-bytes@0.1.1.0/defs.bend as D
772law slice_take:
773 for +xs: List<&2, U32>
774 for +l: Nat
775 for +f: Nat
776 for +n: Nat
777 for +h: {Nat.is_le(Nat.add(f, n), l) == True{} : Bool}
778 {D.slice(List.take(&2, U32, xs, l), f, n) == D.slice(xs, f, n) : List<&2, U32>}