law gfull

lawful-bytes@0.1.1.0 · proof_grow.bend:287

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

287law gfull:
288  for +n: Nat
289  for +t: P.Tree<U32>
290  for +td: P.Tree<U32>
291  for +i: U32
292  for +e: Nat
293  for +hf: {A.full(U32, P.fromT(U32, td), e) == True{} : Bool}
294  {A.full(U32, P.fromT(U32, gtree(n, t, td, i)), e) == True{} : Bool}