law mb_lo

lawful-bytes@0.1.1.0 · proof_fast_append.bend:525

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

525law mb_lo:
526  for +ts: P.Tree<U32>
527  for +e: Nat
528  for +si: U32
529  for +p: U32
530  for +lo: U32
531  for +r: Nat
532  for +j: Nat
533  for +hf: {A.full(U32, P.fromT(U32, ts), e) == True{} : Bool}
534  for +he: {Nat.is_le(e, 29n) == True{} : Bool}
535  for +hlo: {lo == C.WD(ts, si) : U32}
536  for +hb: {Nat.is_lt(Nat.add(Nat.mul(U32.to_nat(si), 4n), Nat.add(r, j)), Nat.mul(4n, Nat.pow(2n, e))) == True{} : Bool}
537  for +hq: {Nat.is_lt(Nat.add(r, j), 4n) == True{} : Bool}
538  {List.get(&2, U32, US(ts), Nat.add(Nat.mul(U32.to_nat(si), 4n), Nat.add(r, j))) == Some{W.byte(W.merge(lo, C.WD(ts, p), r), j)} : Maybe<&2, U32>}