law grow_view_t

lawful-bytes@0.1.1.0 · proof_grow.bend:456

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

456law grow_view_t:
457  for +len: U32
458  for +t: P.Tree<U32>
459  for +d: Nat
460  for +e: Nat
461  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
462  for +he: {Nat.is_le(d, e) == True{} : Bool}
463  for +he29: {Nat.is_le(e, 29n) == True{} : Bool}
464  {D.view(B.grow(C.BT(len, t), e)) == D.view(C.BT(len, t)) : List<&2, U32>}