StorageRefinement.observed_node_reflection: def of stelliferous@0.0.2.0 Import: import stelliferous@0.0.2.0/proofs/storage_refinement.bend as StorageRefinement Lines 452-458 of stelliferous@0.0.2.0/proofs/storage_refinement.bend: https://jend.leeeet.dev/read.txt?path=stelliferous@0.0.2.0/proofs/storage_refinement.bend&start_line=452&end_line=458 import Base import stelliferous@0.0.2.0/proofs/storage_tree_model.bend as Tree def observed_node_reflection(-Element: Data,-left: Array,-right: Array,+left_tree: Tree.Tree,+right_tree: Tree.Tree, left_reflected: {left_tree == Tree.reflect(Element,left) : Tree.Tree}, right_reflected: {right_tree == Tree.reflect(Element,right) : Tree.Tree}) -> {Tree.Node{left_tree,right_tree} == Tree.reflect(Element,ANode{left,right}) : Tree.Tree}: %left_reflected : {Tree.Node{left_tree,right_tree} == Tree.Node{_,Tree.reflect(Element,right)} : Tree.Tree} %right_reflected : {Tree.Node{left_tree,right_tree} == Tree.Node{left_tree,_} : Tree.Tree} {==} Uses (3): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array https://jend.leeeet.dev/definition.txt?path=stelliferous@0.0.2.0/proofs/storage_tree_model.bend&name=Tree https://jend.leeeet.dev/definition.txt?path=stelliferous@0.0.2.0/proofs/storage_tree_model.bend&name=reflect