ProofGrow.gfull: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_grow.bend as ProofGrow
Lines 287-294 of lawful-bytes@0.1.1.0/proof_grow.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_grow.bend&start_line=287&end_line=294

import Base
import lawful-arrays@0.1.0.0/defs.bend as A
import lawful-arrays@0.1.0.0/proof_tree.bend as P

law gfull:
  for +n: Nat
  for +t: P.Tree<U32>
  for +td: P.Tree<U32>
  for +i: U32
  for +e: Nat
  for +hf: {A.full(U32, P.fromT(U32, td), e) == True{} : Bool}
  {A.full(U32, P.fromT(U32, gtree(n, t, td, i)), e) == True{} : Bool}

Uses (11):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.add
  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_index.bend&name=set_tree
  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
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&name=WD
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&name=full_set
  https://jend.leeeet.dev/definition.txt?path=lawful-bytes@0.1.1.0/proof_grow.bend&name=gtree