law fresh
import stelliferous@0.0.2.0/proofs/storage_refinement.bend as StorageRefinementimport Base
import stelliferous@0.0.2.0/proofs/storage_tree_model.bend as Tree
35law fresh:
36 for -T: Data
37 for +depth: Nat
38 for +value: T
39 {Array.new(T,depth,value) == Tree.pack(T,Tree.fresh(T,depth,value)) : Array<T>}