law mb_hi

lawful-bytes@0.1.1.0 · proof_fast_append.bend:556

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

556law mb_hi:
557  for +ts: P.Tree<U32>
558  for +e: Nat
559  for +si: U32
560  for +p: U32
561  for +lo: U32
562  for +r: Nat
563  for +j: Nat
564  for +hf: {A.full(U32, P.fromT(U32, ts), e) == True{} : Bool}
565  for +he: {Nat.is_le(e, 29n) == True{} : Bool}
566  for +hp: {U32.to_nat(p) == Nat.add(U32.to_nat(si), 1n) : Nat}
567  for +hr: {Nat.is_lt(r, 4n) == True{} : Bool}
568  for +hj: {Nat.is_lt(j, 4n) == True{} : Bool}
569  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}
570  for +hq: {Nat.is_lt(Nat.add(r, j), 4n) == False{} : Bool}
571  {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>}