ProofTree.size_tree: law of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTree
Lines 125-130 of lawful-arrays@0.1.0.0/proof_tree.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&start_line=125&end_line=130

import Base
import lawful-arrays@0.1.0.0/defs.bend as D

law size_tree:
  for -T: Data
  for +d: Nat
  for +t: Tree<T>
  for hf: {D.full(T, fromT(T, t), d) == True{} : Bool}
  {Array.size(T, fromT(T, t)) == (fromT(T, t), U32.shln(1, d)) : Array<T> & U32}

Uses (16):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.size
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.size.node
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Empty.absurd
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  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=Base/base.bend&name=U32.shln
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/defs.bend&name=full
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=and_true_l
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=false_ne_true
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Tree
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=fromT