law step_lt

lawful-bytes@0.1.1.0 · proof_append.bend:161

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

161law step_lt:
162  for +ld: U32
163  for +td: P.Tree<U32>
164  for +d: Nat
165  for +k: Nat
166  for +hd: {D.ok(C.BT(ld, td), d) == True{} : Bool}
167  for +hc: {Nat.is_le(Nat.add(U32.to_nat(ld), 1n+k), D.cap(C.BT(ld, td))) == True{} : Bool}
168  {Nat.is_lt(D.size(C.BT(ld, td)), D.cap(C.BT(ld, td))) == True{} : Bool}