law ok_full

lawful-bytes@0.1.1.0 · proof_core.bend:236

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

236# The three parts of ok.
237law ok_full:
238  for +len: U32
239  for +t: P.Tree<U32>
240  for +d: Nat
241  for +h: {D.ok(BT(len, t), d) == True{} : Bool}
242  {A.full(U32, P.fromT(U32, t), d) == True{} : Bool}