Array.reify: law of bend-collections-laws-crypto@1.0.0.0
Import: import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend as Array
Lines 13-16 of bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend&start_line=13&end_line=16

import Base

# Consume any linear array once, retaining a proof of its exact representation.
law reify:
  for a: Array<U32>
  Sigma<&2,&1,Tree,t => {a == thaw(t) : Array<U32>}>

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend&name=reify_node
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/crypto/blake/blake2b/array.bend&name=thaw