law nth_correct

bend-collections@1.0.0.0 · proofs/crypto/sha/packed/conformance.bend:32

import Base
import bend-collections@1.0.0.0/proofs/crypto/sha/packed/core_model.bend as C
import bend-collections@1.0.0.0/spec/crypto/sha.bend as F

32law nth_correct:
33  for xs: List<&2, U32>
34  for n: Nat
35  {C.get(xs, n) == F.nth(xs, n) : U32}