law swap
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
173law swap:
174 for -T: Data
175 for +tree: Tree.Tree<T>
176 for +i: U32
177 for +v: T
178 {Array.swap(T,Tree.pack(T,tree),i,v) == (Tree.pack(T,Tree.write(T,tree,i,v)),Tree.read(T,tree,i)) : Array<T> & T}